I have the solution below. It works on the two test cases but times out on the
hidden test set. Could you please advise on how I could have possibly made it
faster.
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Problem1
{
class Program
{
static void Main(string[] args)
{
string numCases = Console.ReadLine();
int n = Int32.Parse(numCases.Trim());
for (int i = 0; i < n; i++)
{
int sizeMaze = Int32.Parse(Console.ReadLine());
string pathEnemy = Console.ReadLine();
string path = "";
for (int j = 0; j < pathEnemy.Length; j++)
{
if (pathEnemy[j] == 'S') path += 'E';
else path += 'S';
}
Console.WriteLine("Case #" + (i + 1) + ": " + path);
}
}
}
}
--
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 [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/91b4ea7e-ca8c-4bef-8ebc-f00a79605af3%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
