# Java Arraylist

### Problem Statement :

```Sometimes it's better to use dynamic size arrays. Java's Arraylist can provide you this feature. Try to solve this problem using Arraylist.

You are given n lines. In each line there are zero or more integers. You need to answer a few queries where you need to tell the number located in yth position of xth line.

Input Format

The first line has an integer n. In each of the next n lines there will be an integer d denoting number of integers on that line and then there will be d space-separated integers. In the next line there will be an integer q denoting number of queries. Each query will consist of two integers x and y.

Constraints

1<=n<=20000
0<=d<=50000
1<=q<=1000
1<=x<=n
Each number will fit in signed integer.
Total number of integers in n lines will not cross 10^5.

Output Format

In each line, output the number located in yth position of xth line. If there is no such position, just print "ERROR!"```

### Solution :

```                            ```Solution in C :

import java.io.*;
import java.util.*;

public class Solution {

public static void main(String[] args)
{

Scanner scan = new Scanner(System.in);
ArrayList[] list= new ArrayList;
int n;
n=scan.nextInt();
for(int i=1;i<=n;i++)
{

list[i]=new ArrayList();
int x=scan.nextInt();

for(int j=1;j<=x;j++)
{
int val=scan.nextInt();

}
}
int q=scan.nextInt();

for(int i=1;i<=q;i++)
{
int x,y;
x=scan.nextInt();
y=scan.nextInt();
try
{
System.out.println(list[x].get(y-1));
}catch(Exception e)
{
System.out.println("ERROR!");
}
}
}
}```
```

## Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element