Så blir vi de bästa konsulterna i branschen

Våra duktiga IT- konsulter har specialistkunskap inom systemutveckling, systemintegration och agila metoder. Vi utvecklar ständigt vår kompetens genom att flera gånger i veckan anordna event för kompetensutveckling i form av föreläsningar, workshops, dojos och bokcirklar. Med en aktiv intern community för erfarenhetsutbyte arbetar vi tillsammans för att bli ännu bättre!

Vi gillar att använda oss av den senaste tekniken för att hjälpa våra kunder till de bästa lösningarna. Med individuell coachning arbetar vi engagerat och medvetet för våra konsulters möjlighet att följa sin passion. Våra konsulters intresse går i linje med bolagets utveckling och med hjälp av varandra skapar vi en miljö för de bästa i branschen.

Traineeprogrammet

Bli en duktig konsult tillsammans med oss! Under traineeprogrammets sex månader arbetar du med de allra senaste teknikerna i ett större kundprojekt och får alla redskapen som behövs. Vårt uppskattade traineeprogram startar i februari och september varje år.

Läs mer

Vill du jobba med de bästa IT-konsulterna i branschen?

Genom åren har duktiga konsulter samlats hos Dynabyte. Våra IT-konsulter är problemlösare som är hungriga på ny teknik. Vi tycker om att umgås med likasinnade som delar vår passion inom systemutveckling, systemintegration, systemarkitektur och teknisk projektledning. Vill du veta mer om oss och hur din vardag skulle se ut på Dynabyte? Kom förbi vårt häftiga kontor på en kaffe eller kontakta oss via formuläret nedan.

Erika Bjäråker

Rekryterare

073 055 44 80 Maila mig

Programmeringsutmaningar

Klarar du Dynabytes programmeringsutmaningar? Testa dina kunskaper och logiska tänkande genom att lösa så många uppgifter som du kan. Lösningarna kommer automatiskt att verifieras och du får svar direkt om du lyckats! Välj ett av följande språk för att lösa problemet i: C, C#, C++, Go, Haskell, Java, JavaScript, Objective-C, PHP, Python 2, Python 3. Skicka in svaret som ett mail med Problem-ID som ämne och din källkod som en bilaga via Skicka-knappen under respektive problem. Lycka till!

Reversed Binary Numbers

Problem ID: reversebinary

Yi has moved to Sweden and now goes to school here. The first years of schooling she got in China, and the curricula do not match completely in the two countries. Yi likes mathematics, but now... The teacher explains the algorithm for subtraction on the board, and Yi is bored. Maybe it is possible to perform the same calculations on the numbers corresponding to the reversed binary representations of the numbers on the board? Yi dreams away and starts constructing a program that reverses the binary representation, in her mind. As soon as the lecture ends, she will go home and write it on her computer.

Task

Your task will be to write a program for reversing numbers in binary. For instance, the binary representation of 13 is 1101, and reversing it gives 1011, which corresponds to number 11.

Input

The input contains a single line with an integer N, 1 ≤ N ≤ 1 000 000 000.

Output

Output one line with one integer, the number we get by reversing the binary representation of N.

Sample Input 1 Sample Output 1
13
11
Sample Input 2 Sample Output 2
47
61
Skicka

Phone List

Problem ID: phonelist

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:

  • Emergency 911

  • Alice 97 625 999

  • Bob 91 12 54 26

In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.

Input

The first line of input gives a single integer, 1 ≤ t ≤ 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 ≤ n ≤ 10, 000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.

Output

For each test case, output “YES” if the list is consistent, or “NO” otherwise.

Sample Input 1 Sample Output 1
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346
NO
YES
Skicka

Pizza Delivery

Problem ID: pizza

https://dynabyte.kattis.com/problemimage?problem=pizza&img=/en/img-0001.jpg

Your Irish pizza and kebab restaurant is doing very well. Not only is the restaurant full almost every night, but there are also an ever increasing number of deliveries to be made, all over town. To meet this demand, you realize that it will be necessary to separate the delivery service from the restaurant. A new large kitchen, only for baking pizzas and being a base for deliveries, has to be established somewhere in town.

The main cost in the delivery service is not the making of the pizza itself, but the time it takes to deliver it. To minimize this, you need to carefully plan the location of the new kitchen. To your help you have a database of all last year’s deliveries. For each location in the city, you know how many deliveries were made there last year. The kitchen location will be chosen based on the assumption that the pattern of demand will be the same in the future.

Your city has a typical suburban layout – an orthogonal grid of equal-size square blocks. All places of interest (delivery points and the kitchen) are considered to be located at street crossings. The distance between two street crossings is the Manhattan distance, i.e., the number of blocks you have to drive vertically, plus the number of blocks you have to drive horizontally. The total cost for a delivery point is its Manhattan distance from the kitchen, times the number of deliveries to the point. Note that we are only counting the distance from the kitchen to the delivery point. Even though we always drive directly back to the kitchen after a delivery is made, this (equal) distance is not included in the cost measure.

Input

On the first line, there is a number, 1 ≤ n ≤ 20, indicating the number of test cases. Each test case begins with a line with two integers, 1 ≤ x ≤ 100, 1 ≤ y ≤ 100, indicating the size of the two-dimensional street grid. Then follow y lines, each with x integers, 0 ≤ d ≤ 1000, indicating the number of deliveries made to each street crossing last year.

Output

For each test case, output the least possible total delivery cost (the sum of all delivery costs last year), assuming that the kitchen was located optimally. There should be one line for each test case, with an integer indicating the cost, followed by a single space and the word “blocks”.

Sample Input 1 Sample Output 1
2
4 4
0 8 2 0
1 4 5 0
0 1 0 1
3 9 2 0
6 7
0 0 0 0 0 0
0 1 0 3 0 1
2 9 1 2 1 2
8 7 1 3 4 3
1 0 2 2 7 7
0 1 0 0 1 0
0 0 0 0 0 0
55 blocks
162 blocks
Skicka