So, I posted this code (a bit messy because its after a few fixes) to round
2, and I got WA. according to the analysis, my idea is right, but I still
got WA.
Can anyone spot why, or should I try and ask for a second look from the
codejam team?
I tried many local tests and I couldn't find anythi
Posted here is the code I've written for wormhole in one. It worked on
every test I ran on it, and it follows the logic of the analysis, and it
still doesnt work.
Can anyone spot the mistake? I would love to know what it was, so I could
fix it the next time, because I can't seem to find any mist
Please explain what is wrong with this code for Google Kickstart 2020 Round
C Problem 2 Stable Wall
def dfs(visited, graph, node):
if node not in visited:
print(node, end = "")
visited.add(node)
for neighbour in graph[node]:
dfs(visited, graph, neighbour)
for case in range(1, int(input()) +1):
v
Can anyone please tell me what is wrong in this Python3 code for Kickstart
Round C Problem 2 (Stable Wall)
Link:
https://codingcompetitions.withgoogle.com/kickstart/round/0019ff43/003379bb
def dfs(visited, graph, node):
if node not in visited:
print(node, end = "")
visited.add(
Hello all,
I try to solve this problem but I got WA for the second test case.
As there is no new conditions between 1 and 2 I don't know why it is
happening.
Here is my code :
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Solution {
static Solution
You can try the following test case
*1*
*4 2*
*AA*
*AB*
*AC*
*AA*
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-code+unsubscr...@googlegroups.com.
T
I cannot figure out what test case your code will fail, but I was able to
fix your problem
The problem is with floating point arithmetic. Because this problem
requires very precise calculation, you should avoid using floating point at
all
Please check out the following code that would pass both
You need to take care of overflow problem.
See the code below for references.
*import java.util.ArrayList;*
*import java.util.List;*
*import java.util.Scanner;*
*public class Solution {*
*public static void main(String[] args) {*
*Scanner scann = new Scanner(System.in); // Create a
