@shivamch17

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". import java.util.Stack; class MinStack { private Stack<Integer> stack; private Stack<Integer> minStack;

import java.util.*; class Graph { private int V; private List<List<Node>> adj; public Graph(int V) { this.V = V; adj = new ArrayList<>(V); for (int i = 0; i < V; i++) {

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class PD{ int data; int pri; PD(int d,int p){ data=d;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". import java.util.Stack; class MinStack { private Stack<Integer> stack; private Stack<Integer> minStack;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void check(int arr[], int day[]){ Stack<Integer> st=new Stack<>(); st.push(0); day[0]=1;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void toh(int n, char s, char d, char a){ if(n==1){ System.out.println("Move disk 1 from "+s+" to "+d); return;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int k = sc.nextInt();

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean check(int []ip, int []op){ Stack<Integer> st=new Stack<>(); int j=0; for(int i=0;i<ip.length;i++){

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Node{ int data; Node left,right; Node(int x) { data=x;

import java.util.*; // Class to represent a weighted directed graph class Graph { private int V; // Number of vertices private List<Edge> adj; // List of adj // Constructor public Graph(int V) { this.V = V;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static boolean subsetSum(int []arr, int ind, int target){ if(target==0) return true; if(ind==0)

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int lbs(int []arr){ int n=arr.length; int dp1[]=new int[n]; Arrays.fill(dp1,1);

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int lis(int []arr){ int n=arr.length; int dp[]=new int[n]; Arrays.fill(dp,1);

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int lcs(String s, String t, int i, int j){ if(i==s.length() || j==t.length()) return 0;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static int lcs(String s, String t, int i, int j){ if(i==s.length() || j==t.length()) return 0;

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Node{ int data; Node left,right; Node(int x) {

import java.util.*; class Node { int val; Node left; Node right; Node() {} Node(int val) { this.val = val; }

import java.util.*; class Node { int val; Node left; Node right; Node() {} Node(int val) { this.val = val; }

import java.util.*; public class Main { static final int INF = Integer.MAX_VALUE; private int V; private ArrayList<ArrayList<Tuple> > adj; public Main(int v){ this.V = v; this.adj = new ArrayList<ArrayList<Tuple> >(); for (int i = 0; i < v; i++) this.adj.add(new ArrayList<Tuple>());

import java.util.*; class Main { class Edge { int src, dest, weight; Edge(){ src = dest = weight = 0; } }; int V, E; Edge edge[];