Skip to content

Instantly share code, notes, and snippets.

@nise-nabe
Last active August 29, 2015 14:19
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save nise-nabe/0b79ae833262c81e08ca to your computer and use it in GitHub Desktop.
Save nise-nabe/0b79ae833262c81e08ca to your computer and use it in GitHub Desktop.
Google Code Jam 2015 Qual A
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner s = new Scanner(System.in)) {
for (int t = 1, T = s.nextInt(); t <= T; ++t) {
int shynessLevelMax = s.nextInt();
String line = s.next();
int additionalFriends = 0;
for (int shynessLevel = 0, standingSum = 0; shynessLevel <= shynessLevelMax; ++shynessLevel) {
int numOfShynessLevel = line.charAt(shynessLevel) - '0';
if (standingSum < shynessLevel) {
int needToAdd = shynessLevel - standingSum;
additionalFriends += needToAdd;
standingSum += needToAdd;
}
standingSum += numOfShynessLevel;
}
System.out.printf("Case #%d: %d\n", t, additionalFriends);
}
}
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment