Search found 3 matches

by CptObvious
Fri Apr 25, 2014 11:42 am
Forum: Challenges Solved
Topic: Lorem Ipsum
Replies: 34
Views: 10560

Java:

Code: Select all

String challenge = "put lorem ipsum here";
for (String s : challenge.split(" ")){
	if (challenge.indexOf(s) == challenge.lastIndexOf(s)){
		System.out.println(s);
		break;
	}
}
by CptObvious
Fri Apr 25, 2014 10:47 am
Forum: Challenges Solved
Topic: Pi Hates Nines
Replies: 26
Views: 9291

Another Java approach public static void main(String[] args) { String pi = "put pi here"; String[] splitpi = pi.split("9"); String longest = ""; for(String s : splitpi){ if (s.length() > longest.length()){ longest = s; } } System.out.println(longest); }
by CptObvious
Thu Apr 24, 2014 5:29 pm
Forum: Challenges Solved
Topic: Didactic Feedback Cipher Long 2
Replies: 22
Views: 2550

I didn't even think about endianness here :oops: Also I now realize that I although I did solve the challenge, I didn't get the right x. I kinda ignored the fact that the key is 4 Bytes and worked the whole thing Byte by Byte. Meaning I also gave a shit about the carry :oops: So what I considered to...