# NVHS Computing Team

## Practice

Practice Problems And Homework For Various Topics.

Google Kickstart is a worldwide coding competition held by Google. The contest usually consists of four questions, each with two testcases that are worth differing amount of points each. The contest is held throughout the year, starting in March and ending in November. This contest is open to everyone, students and graduates alike. The first two problems are not difficult, but they increase in difficulty from problems three to four.

Here are solutions to past problems, offered by past captains:

## Allocation

Solution (in Java):

//Code written by Nihal
import java.util.*;
public class Solution
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int test = sc.nextInt();
for(int count = 1; count <= test; count++) {
int answer = 0; int n = sc.nextInt(); int b = sc.nextInt();
int[] a = new int[n];
for(int x = 0; x < n; x++) {
a[x] = sc.nextInt();
}
Arrays.sort(a);
for(int x = 0; x < n; x++) {
if(a[x] <= b) {
}
else { break; }
}
System.out.println("Case #" + count + ": " + answer);
}
sc.close();
}
}


What this code does:

This is a fairly simple problem that doesn't have many tricky efficiency requirements for the test cases. Once you recognize that it is always better to buy a cheaper house than a more expensive house, as it adds the same amount to the total, one, and is cheaper, the problem becomes very straightforward. It is a simple matter of sorting the array from cheapest house to most expensive, and traversing through the houses until you can't buy anymore. The number houses will be the solution.

Efficiency: $O(nlog(n))$

## Bus Routes

Solution (in Java):

//Code written by Nihal
import java.util.*;
public class Solution {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int test = sc.nextInt();
for(int xix = 1; xix <= test; xix++) {
int n = sc.nextInt(); long d = sc.nextLong();
int[] i = new int[n];
for(int x = 0; x < n; x++) {
i[x] = sc.nextInt();
}
for(int x=n-1;x>=0;x--) {
d /= i[x]; d *= i[x];
}
System.out.println("Case #" + xix + ": " + d);
}
}
}


What this code does:

The solution to the problem is fairly intuitive. You would need to find the latest bus for each value less than n, and each time you find a bus, you reduce $n$ to the day for the bus. The solution is to traverse backwards through the list of busses and find the latest multiple less than n. Once you find that, you make that latest multiple $n$ and remove that bus from the list. Fortunately, integer division automatically truncates in Java, so you can simply divide $n$ by the day for the bus and multiply the day for the bus again. Repeat this and the final value for $n$ you are left with is the solution.

Efficiency: $O(n)$

## Longest Arithmetic

Solution (in Java):

//Code written by Jason
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
{
int cases = in.nextInt();
for(int t = 1; t <= cases; t++) {
int n = in.nextInt();
int[] k = new int[n];
for(int x = 0; x < n; x++) {
k[x] = in.nextInt();
}
int maxcount = 0;
int count = 0;
int common = k - k;
for(int x = 1; x < n; x++) {
if(k[x-1] - k[x] == common) {
count++;
if(maxcount < count) {
maxcount = count;
}
}
else {
count = 0;
common = k[x-1] - k[x];
x--;
}
}
maxcount++;
System.out.println("Case #" + t + ": " + maxcount);
}
}
}
}


What this code does:

There isn't much to work on regarding efficiency in this problem. The best way to solve the problem is traverse throught the array and when you see a difference repeat, you count how long it lasts for, and everytime it changes, you reset. Then you just find the largest length, giving you the solution.

Efficiency: $O(n)$

## High Buildings

Solution (in Java):

//Code written by Nishikar
import java.io.*;
import java.util.*;

public class Solution {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int test = sc.nextInt();
for (int g = 0; g < test; g++) {
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
ArrayList<Integer> ans = new ArrayList<Integer>();
if ((a - c) + (b - c) + c > n) {
System.out.println("Case #" + (g + 1) + ": " + "IMPOSSIBLE");
} else if (a == b && b == c && a == 1) {
if (n == 1) {
System.out.println("Case #" + (g + 1) + ": 1");
} else
System.out.println("Case #" + (g + 1) + ": " + "IMPOSSIBLE");
} else {
int starter = n - (a - c);
for (int x = 0; x < a - c; x++) {
starter++;
}
for (int x = 0; x < c; x++) {
if (x == 0) {
}
}
for (int x = 0; x < b - c; x++) {
}
while (ans.size() < n) {
if (c == 1 && adder == ans.size()) {
} else {
}
}
System.out.print("Case #" + (g + 1) + ": ");
for (int x = 0; x < n; x++) {
if (x != n - 1)
System.out.print(ans.get(x) + " ");
else
System.out.print(ans.get(x));
}
System.out.println();

}
}
}
}


What this code does:

There are a couple of things you need to recognize for this problem. First, look for the impossible cases. The only times the cases are impossible is if $a=b=1$ but $n>1$, or if $a+b-c>n$, as there are that many houses visible, so $n$ must be at least greater than that. Once you recognize this, you will also notice that all $c$ towers that all can see must be the same height(else they would block each other out), and must be the tallest towers. For convenience, we will make the height of the tall towers $n$. There will also be $a-c$ short towers, of increasing size to the left of those equally tall towers and $b-c$ towers of decreasing length to the right of the tall towers. This way, the $c$ common towers will block $a-c$ towers for one viewer and $b-c$ for the other viewer. The height of the $a-c$ and $b-c$ towers could be 1, but this code chose to have them in increasing order and decreasing order(with towers being as tall as possible). So if $n$ was 6, and $a-c$ was 2, the code would maximize the height of the left towers by making the towers heights 4 and height 5. After adding in all these required towers, the code checks if all $n$ building are accounted for. If they are not, and $c>1$, all the remaining towers will be put in between two of the $c$ common towers, with size 1. When $c=1$, because the towers to the left and right of it are of size $n-1$ in this code, the extra towers are inserted to the right of the single common tower (the $n-1$ height tower to the right will make them invisible). The only special case that needs to be addressed is when $b=c$, so the common tower is already to the very right with no decreasing $n-1$ tower to the right. In this case, simply add the extra towers of height 1 to the left of the common tower, as the $n-1$ tower to the left will make them invisible. You do not need to account for when there are no $n-1$ height towers to the right or left, as that means $a=b=c$, and if $c=1$, then you are guaranteed all $n$ towers are accounted for($n=1$), or the case is impossible($n>1$). With all these circumstances complete, your code should efficiently run through the test sets.

Efficiency: $O(n)$

## Toys

Solution (in Java):

//Code written by Nihal
import java.util.*;
public class Solution {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int test = sc.nextInt();
for(int count = 1; count <= test; count++) {
int n = sc.nextInt(); int[]e = new int[n]; int[] r = new int[n];
for(int x = 0; x < n; x++) {
e[x] = sc.nextInt(); r[x] = sc.nextInt();
}
long[] and = recurse(e, r, new boolean[n], 0);
long sol = n - and;
long ans = and;
System.out.print("Case #" + count + ": " + sol + " ");
if(ans == -1) {
System.out.println("INDEFINITELY");
}
else {
System.out.println(ans);
}
}
sc.close();
}
public static long[] recurse(int[]e, int[]r, boolean[]check, int i) {
if(i >= e.length) {
long[] w = new long; long esum = 0; boolean passed = true;
for(int x = 0; x < e.length; x++) {
if(check[x]) {
w++; esum += e[x];
}
}
if(w == 0) return w;

for(int x = 0; x < e.length; x++) {
if(check[x] && r[x] > esum - e[x]) {
passed = false;
w += esum;
break;
}
else if(check[x]) {
w += e[x];
}
}
if(passed) {
w =- 1;
}
return w;
}
else {
check[i] = false;
long[] w = recurse(e, r, check, i+1);
check[i] = true;
long[] v = recurse(e, r, check, i+1);
if(w == -1 && v == -1) {
if(w > v) return w;
return v;
}
else if(w == -1) return w;
else if(v == -1) return v;
else if(w > v) return w;
else if(w < v) return v;
else if(v > w) return v;
return w;
}
}
}


What this code does:

Since this problem is quite difficult and most of us aren't ready for it, we will only be reviewing how to get the first test set, which is efficient but not as efficient as it can be. Fortunately, the $n$ value is capped at 12, so we are able to practically brute force the solution. However, a pure brute force algorithm won't work. We still need to avoid repeated cases through a primitive form of dynamic programming. The way to approach this is to treat every permutation as a series of true or falses for the toys regarding whether they are in the set or not. Then, we find the highest possible amount of time of entertainment throughtout the permutations. Finally, if there are multiple cases with the same highest value, we check which one has the most toys and use that as the solution.

Efficiency: $O(n*2^n)$