http://codechillout.sphere-contest.com/problems/onlineround/PREFSUFF

Input:
4
5 4 2 3 1 2
5 4 -2 1 1 -2
6 1 -1 1 -1 1 -1
3 0 0 0

Output:
2
0
2
1

Answer

#include 

int main(void) {
	int instances;
	scanf("%d", &instances);
	int n;
	int i;
	for(i = 0 ; i < instances ; i++){
		scanf("%d", &n);
		int entries[n];
		int j;
		for(j = 0 ; j < n ; j++){
			scanf("%d", &entries[j]);
		}
		int sumA[n-1];
    	int total = 0;
    	int k;
    	int flag1 =1;
    	for(k = 0 ; k <= n-2 ; k++){
    		if(entries[k] != entries[n-(k)]) // Check for palindrome
    		     flag1=0;
	    	total +=entries[k];
	    	sumA[k] = total;
    	}
    	if(flag1 == 1 && entries[n/2] == entries[(n/2)-1])
    	    return (n/2)-1;
    	
	    total +=entries[n-1];
	    int flag = 1;
        if(total%2 == 0){ // If it is odd it cannot be split
        	int j;
        	int tot2 = total/2;
	    	for(j = 0 ; j <= n-2 ; j++){
		      if(sumA[j] == tot2){
		         printf("%d\n", j+1);
		         flag = 0;
		         break;
		      }
		    }
        }
       if(flag ==1)
          printf("0\n");
	}
	return 0;
}

Warm-Up round at Codingchillout.Malta http://codechillout.sphere-contest.com/round/test

http://codechillout.sphere-contest.com/problems/test/TEST

Input:
1
2
88
42
99

Output:
1
2
88

Answer

#include 

int main(void) {
	int i;
	while (scanf("%d", &i)==1){
		if(i == 42) break;
		printf("%d\n",i);
	}

	return 0;
}

http://codechillout.sphere-contest.com/problems/test/FCTRL2

4
1
2
5
3

1
2
120
6

Answer

import math

n = int(raw_input());
for v in range(0,n):
	print math.factorial(int(raw_input()))

http://codechillout.sphere-contest.com/problems/test/ADDTWO

Input:
2 3
10 -2
-1 5
-3 -3
0 1

Output:
5
8
4
-6
1

Answer

import fileinput

for line in fileinput.input():
    n = line.split();
    print int(n[0]) + int(n[1])

http://codechillout.sphere-contest.com/problems/test/REVARR

Input:
2
7 1 2 3 4 5 6 7
3 3 2 11

Output:
7 6 5 4 3 2 1
11 2 3

Answer

n = int(raw_input())
for v in range(0,n):
    j = raw_input().split(" ")
    del j[0]
    j = " ".join(reversed(j))
    print j

http://codechillout.sphere-contest.com/problems/onlineround/GLUTTONS

Input:
2
2 10
3600
1800
3 356
123
32999
10101

Output:
8
2

Answers

C

#include 
#include 
int main(void) {
	int n;
	int invites;
	int nBox;
	int i;
	scanf("%d", &n);
	for(i = 0 ; i < n ; i++){
		scanf("%d %d", &invites,&nBox);
	    double total = 0;
		int j;
		for(j = 0 ; j < invites;j++){
			    int time;
			    scanf("%d",&time);
		    	total += 86400/time;
        }
        printf("%d\n",(int)ceil(total/nBox));
	}
	return 0;

Python 2.7

import math
contestDuration = 86400
instances = int(raw_input())
for v in range(0,instances):
    data = raw_input().split(" ") # Invited/Cookies
    i = int(data[0])
    cookies = int(data[1])
    total = 0
    for k in range(0,i):
       total = total + contestDuration/int(raw_input())
    print int(math.ceil(total/cookies))

Java 7

import java.util.*;
import java.lang.*;

class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		 java.io.BufferedReader r = new java.io.BufferedReader (new java.io.InputStreamReader (System.in));
		 int instances = Integer.parseInt(r.readLine());
		 
		 for(int k = 0 ; k < instances; k++){
		    String [] data = r.readLine().split("\\s+");
		    int invites = Integer.parseInt(data[0]);
		    double total = 0;
		    for(int i = 0 ; i < invites; i++){
		    	total += 86400/Integer.parseInt(r.readLine());
		 
		    }
		    System.out.println((int)Math.ceil(total/Integer.parseInt(data[1])));
		 }
	}
}

Yesterday I came across https://www.konnekt.com/Challenge/Developer and I decided to give it a go

Firebug was used to check for hidden elements and the pesky display:none;  was removed

… and the following text appeared

So there must be a GetKey function probably javascript and it was found

There are 5 rows and 32 columns. Make use of a [5,15][3, 8]S algorithm with mode ECB. Oh, and you will need a key, try GetKey with a certain binary parameter!

What is ECB? Electronic Code book and learned that it has to do with encryption.

Who would name an algorithm [5,15][3, 8]S ? Aha that must be some coordinates

So [5,15][3, 8]S stands for DES. Then “There are 5 rows and 32 columns. Make use of a DES algorithm with mode ECB. Oh, and you will need a key, try GetKey with a certain binary parameter!”

Next is the key. It was staring at me in front of the elephant {01000111 01101111}

1. function bin2txt(bin) {
2. var res = bin.replace(/ /g,"").replace(/[01]{8}/g, function(v) {
3. return String.fromCharCode( parseInt(v,2) );
4. });
5. return res;
6. }

funnily enough when you convert this to string it becomes “Go” to complete Ready Set Go.

But when passed as a parameter to Getkey the word “origami” pops out

Other methods of finding the key in GetKey function the list

1. var asciiToUse = [111, 114, 105, 103, 97, 109, 105]

is the ascii of  “origami” in order

Since my knowledge of DES is next to none, I thought I must convert it to hex and was trying all sorts of website encrypter/decrypters At some point I also thought that “origami elephant” is the key in hex 🙂

Then I found http://des.online-domain-tools.com/tool-form-submit/

I pasted the encrypted text and entered origami as key

The result was: https://www.konnekt.com/Challenge/Developer/58fb1b4f9ac643cfa5fbsbb7def6eb29

Other curious things

https://www.konnekt.com/Blog/News/52/Developer-Challenge

Give it a try. We’re warning you, it’s {01100100 01100001 01101101 01101110 00100000 01100101 01100001 01110011 01111001}.

Tools used

JSFIDDLE http://jsfiddle.net/fairmutex/fGHeG/1/

http://des.online-domain-tools.com/tool-form-submit/

GetKey description

This function checks if the binary represents the string “Go” in unrelated ways like using  Math.sqrt(5041) which is 71 which is the ascii of “G” and  110.91935  and ceil  to get 111 which is the ascii of “o” and then lists the string “origami” if the string criteria is satisfied.

Thanks for reading

var treeData = [
{title: “item1 with key and tooltip”, tooltip: “Look, a tool tip!” },
{title: “item2: selected on init”, select: true },
{title: “Folder”, isFolder: true, key: “id3”,
children: [
{title: “Sub-item 3.1”,
children: [
{title: “Sub-item 3.1.1”, key: “id3.1.1” },
{title: “Sub-item 3.1.2”, key: “id3.1.2” }
]
},
{title: “Sub-item 3.2”,
children: [
{title: “Sub-item 3.2.1”, key: “id3.2.1” },
{title: “Sub-item 3.2.2”, key: “id3.2.2” }
]
}
]
},
{title: “Document with some children (expanded on init)”, key: “id4”, expand: true,
children: [
{title: “Sub-item 4.1 (active on init)”, activate: true,
children: [
{title: “Sub-item 4.1.1”, key: “id4.1.1” },
{title: “Sub-item 4.1.2”, key: “id4.1.2” }
]
},
{title: “Sub-item 4.2 (selected on init)”, select: true,
children: [
{title: “Sub-item 4.2.1”, key: “id4.2.1” },
{title: “Sub-item 4.2.2”, key: “id4.2.2” }
]
},
{title: “Sub-item 4.3 (hideCheckbox)” },
{title: “Sub-item 4.4 (unselectable)” }
]
}
];

 
var tryTree = [{}];
tryTree[0] = {};
tryTree[0].title = “item1 with key and tooltip”;
tryTree[0].tooltip = “Look, a tool tip!”;

tryTree[1] = {};
tryTree[1].title = “item2: selected on init”;
tryTree[1].select = true;

tryTree[2] = {};
tryTree[2].title = “Folder”;
tryTree[2].isFolder = true;
tryTree[2].key = “id3”;
tryTree[2].children = [{}];
tryTree[2].children[0] = {};
tryTree[2].children[0].title = “Sub-item 3.1”;
tryTree[2].children[0].children = [{}];
tryTree[2].children[0].children[0] = {};
tryTree[2].children[0].children[0].title = “Sub-item 3.1.1”;
tryTree[2].children[0].children[0].key = “id3.1.1”;
tryTree[2].children[0].children[1] = {};
tryTree[2].children[0].children[1].title = “Sub-item 3.1.2”;
tryTree[2].children[0].children[1].key = “id3.1.2”;
tryTree[2].children[1] = {};
tryTree[2].children[1].title = “Sub-item 3.2”;
tryTree[2].children[1].children = [{}];
tryTree[2].children[1].children[0] = {};
tryTree[2].children[1].children[0].title = “Sub-item 3.2.1”;
tryTree[2].children[1].children[0].key = “id3.2.1”;
tryTree[2].children[1].children[1] = {};
tryTree[2].children[1].children[1].title = “Sub-item 3.2.2”;
tryTree[2].children[1].children[1].key = “id3.2.2”;

tryTree[3] = {};
tryTree[3].title = “Document with some children (expanded on init)”;
tryTree[3].expand = true;
tryTree[3].key = “id3”;

tryTree[3].children = [{}];
tryTree[3].children[0] = {};
tryTree[3].children[0].title = “Sub-item 4.1 (active on init)”;
tryTree[3].children[0].activate = true;
tryTree[3].children[0].children = [{}];
tryTree[3].children[0].children[0] = {};
tryTree[3].children[0].children[0].title = “Sub-item 4.1.1”;
tryTree[3].children[0].children[0].key = “id4.1.1”;
tryTree[3].children[0].children[1] = {};
tryTree[3].children[0].children[1].title = “Sub-item 4.1.2”;
tryTree[3].children[0].children[1].key = “id4.1.2”;

tryTree[3].children[1] = {};
tryTree[3].children[1].title = “Sub-item 4.2 (selected on init)”;
tryTree[3].children[1].select = true;
tryTree[3].children[1].children = [{}];
tryTree[3].children[1].children[0] = {};
tryTree[3].children[1].children[0].title = “Sub-item 4.2.1”;
tryTree[3].children[1].children[0].key = “id4.2.1”;
tryTree[3].children[1].children[1] = {};
tryTree[3].children[1].children[1].title = “Sub-item 4.2.2”;
tryTree[3].children[1].children[1].key = “id4.2.2”;

tryTree[3].children[2] = {};
tryTree[3].children[2].title = “Sub-item 4.3 (hideCheckbox)”;

tryTree[3].children[3] = {};
tryTree[3].children[3].title = “Sub-item 4.4 (unselectable)”;

Tested with

//called with every property and it’s value
function process(key,value) {
document.write(key + ” : “+value+'<br/>’);
}

function traverse(o,func) {
for (i in o) {
func.apply(this,[i,o[i]]);
if (typeof(o[i])==”object”) {
//going on step down in the object tree!!
traverse(o[i],func);
}
}
}

//that’s all… no magic, no bloated framework
document.write(‘<br/><br/><br/><br/><br/><br/><br/><br/><table><tr><td>’);
traverse(treeData,process);
document.write(‘</td><td>’);
traverse(tryTree,process);
document.write(‘</td></tr></table>’);