hacker.org

DamaTeq

my approach is pretty fast (it takes only a few secs) but it is not perfect. btw, don't look at the goto's hehe class FalsePositive { public int Index { get; set; } public int Length { get; set; } public byte Key { get; set; } public FalsePositive(int index, int length, byte key) { Index = index; Le...

DamaTeq

hm i should have decoded the whole message at once and not stop after i thought i have everything i need

DamaTeq

I also used a "sliding window" for the first time using a specific length. Those sequences that found are stored in the list. Afterwards i just go through the list and check if those strings (+x) are also found. when not - it gets removed from the list. The most time is used for making the...

DamaTeq

I didn't use a list or something... hope that helps

DamaTeq

solved in c#

Code: Select all

using (StreamReader sr = new StreamReader(File.OpenRead("pi.txt")))
{
      Console.WriteLine(sr.ReadToEnd().Split('9').OrderByDescending(x => x.Length).First());
}

DamaTeq

easy going - did it in under 5 minutes ... no bot programming required

DamaTeq

this challenge really sucks ... i should have the correct number (8.xxxxxxxxxxxxxxxxxxxx) but it won't take my answer. I tried to round up / down to nearly every digit. I tried to round like wikipedia says (see: IEEE 754). Tried a ',' instead of '.' but nope ... everything is incorrect. That challen...

DamaTeq

i struggled at this challenge quite a while because english is not my native language. But i can give you a little hint: think of a mathematical funtion which is implemented in most programming languages.

Search found 8 matches