[구인] 3D Virtual World 개발자

SK C&C Metaverse팀에서는 준비중인 Virtual World Platform을같이 개발하실 개발자분들을 모집합니다.

* 담당 업무
Virtual World Platform 개발

* 지원 자격
성별/연령/학력 불문

C++ 전문 개발 경력 5년 이상
C/C++ Expert
팀 작업에 익숙하고 다른 사람들과의 커뮤니케이션에 문제가 없는 자
영문 기술 문서 읽기에 익숙하신 분

* 우대 사항

• 클라이언트
• 메인 클라이언트의 로직 구현과 서버와의 커뮤니케이션 구현
• 네트웍 및 게임 로직 구현 경험자
• 상용 3D engine 사용 경험자
• 네트웍과 3D 에 대한 이해 필요
• 기획팀과 커뮤니케이션이 원활한 자

• 서버
  
• Virtual World Server 제작
• MMORPG Server 개발 유경험자
• 네트웍/DB/Thread scheduling/memory management/server-side script language 관련 경험 보유자
• OS & kernel의 동작 구조를 이해하고 tuning 가능자

• Mobile (iPhone)
• iPhone Application 개발

* 대우
정직원

* 연봉
추후 협의

* 복리후생
연금/보험 : 국민연금, 고용보험, 산재보험, 건강보험
휴무/휴가 : 주5일 근무, 연차, 정기 휴가
보상 제도 : 인센티브제
건강관리 지원 : 건강검진, 본인 의료비 지원
생활안정 지원 : 자녀 학자금 지원, 직원대출제도
생활편의 지원 : 사원식당, 통근버스 운행
경조사 지원 : 각종 경조금, 경조휴가제
교육/여가 지원 : 자기계발비 지원
기타 : 사내 헬스 센터/의무실/어린이집 운영

* 전형 절차
기술 필기 -> 실무자 면접 -> 임원진 면접 -> 합격자 발표

관련 경력(MMORPG, Virtual World 개발 경력)이 충분히 있다고 판단하시는 분은 기술 필기 없이 바로 이력서를 보내주셔도 좋습니다.

* 기술 필기
다음의 문제 중 4문제 이상을 풀어 source code를 메일로 제출
C++ 을 사용할 것. STL/MFC 사용하지 말 것.

• The 3n + 1 problem
• Prime Ring Problem
  
• The Settlers of Catan
  
• Anagram
  
• Wormholes
• Re-connecting Computer Sites
• Password Search
• 2D Representations
• Telephone Directory Alphabetization
• Dividing up
• Overlapping Air Traffic Control Zones
• Caesar Cypher

* 제출 서류 (담당자에게 이메일 제출)
기술 필기 시험 결과 (program source code)
이력서
Project 경력 기술서

* 담당자













* 기타
Metaverse 팀은 개발자를 구인 중입니다. programming을 직접 하실 분만 지원 부탁드립니다. (PM 직군은 신규 채용 예정이 없습니다.)
문의 사항이 있으신 분은 담당자에게 연락 부탁드립니다.

회사 이메일 주소가 안되시는 분은 개인 이메일 주소 naraofbaram at gmail.com 으로 보내주시기 바랍니다.

[구인] C++ Senior Programmer

SK C&C E-PRJ팀에서는 C++ Senior Programmer를 모집합니다.

* 담당 업무
항공 사진을 이용한 3D Mirror World Production System 개발
cluster 로 이루어진 production system 에서 동작할 대용량 이미지 처리 s/w 구현

* 지원 자격 및 우대 사항
성별/연령/학력 불문

C++ 전문 개발 경력 5년 이상
C/C++ Expert
팀 작업에 익숙하고 다른 사람들과의 커뮤니케이션에 문제가 없는 자
영문 기술 문서 읽기에 익숙하신 분
다양한 상용/공개 라이브러리를 사용해본 경험자 우대
GIS/Computer Graphics/Computer Vision/Numerical Analysis 경험자 우대

* 대우
정직원

* 연봉
추후 협의

* 복리후생
연금/보험 : 국민연금, 고용보험, 산재보험, 건강보험
휴무/휴가 : 주5일 근무, 연차, 정기 휴가
보상 제도 : 인센티브제
건강관리 지원 : 건강검진, 본인 의료비 지원
생활안정 지원 : 자녀 학자금 지원, 직원대출제도
생활편의 지원 : 사원식당, 통근버스 운행
경조사 지원 : 각종 경조금, 경조휴가제
교육/여가 지원 : 자기계발비 지원
기타 : 사내 헬스 센터/의무실/어린이집 운영

* 전형 절차
기술 필기 -> 실무자 면접 -> 임원진 면접 -> 합격자 발표

* 기술 필기
다음의 문제 중 4문제 이상을 풀어 source code를 메일로 제출
C++ 을 사용할 것. STL/MFC 사용하지 말 것.

• The 3n + 1 problem
• Prime Ring Problem
  
• The Settlers of Catan
  
• Anagram
  
• Wormholes
• Re-connecting Computer Sites
• Password Search
• 2D Representations
• Telephone Directory Alphabetization
• Dividing up
• Overlapping Air Traffic Control Zones
• Caesar Cypher

* 제출 서류 (담당자에게 이메일 제출)
기술 필기 시험 결과 (program source code)
이력서
Project 경력 기술서

* 담당자













* 기타
E-PRJ팀은 개발자를 구인 중입니다. programming을 직접 하실 분만 지원 부탁드립니다. (PM 직군은 신규 채용 예정이 없습니다.)
문의 사항이 있으신 분은 담당자에게 연락 부탁드립니다.

회사 이메일 주소가 안되시는 분은 개인 이메일 주소 naraofbaram at gmail.com 으로 보내주시기 바랍니다.

[Job Offer] Program Manager

The SK C&C 3D Mirror World team is looking for program managers (PM) for creating a 3D virtual globe of the Earth. The successful PM has a graduate degree, preferable a PhD in a field closely related to the subject such as computer vision, photogrammetry, or GIS combined with 5+ years of relevant industry experience.

Expected are in-depth knowledge of digital image processing, digital photogrammetry, 2D and 3D geometry, multiple view geometry and a proven track record in developing software algorithm. Experience with true ortho-imagery, close range photogrammetry and oblique aerial imagery are especially relevant for this position.

To apply, please send resume and salary history/requirements in word/pdf documents to naraofbaram@skcc.com .

[Job Offer] C++ Senior Programmer

SK C&C, a Korean IT outsourcing and SI consulting company is seeking for Programmer / Senior Programmer for newly developing Earth Browser Project. The ideal applicant will be proficient in programming C++, specialized for Computer Vision / Photogrammetry. We are looking for a highly skilled, experienced, self-motivated and creative programmer who has solid coding, troubleshooting and analytical skills, an in-depth knowledge of C++ and who thrives on delivering unique solutions to customers within an advanced product incubation environment.

Requirements :

* Expert C++ programming skills

* 5+ years of professional software development

* MS or PhD in Computer Science, Applied Math or a related technical field

* Excellent verbal and written communication skills in English

* Self-motivation

Plusses :

* Expertise in developing state of the art 3D reconstruction algorithms from still photo or video data using a combination of computer vision and photogrammetric methodologies

* Familiarity with image processing, mapping, and geospatial technologies

* Graduate level study of computer vision, numerical analysis, and probability related disciplines

To apply, please send resume, salary history/requirements in word/pdf documents, and answers from following questions - from at least 3 questions - in plain text to naraofbaram@skcc.com .

• The 3n + 1 problem
• Prime Ring Problem
  
• The Settlers of Catan
  
• Anagram
  
• Wormholes
• Re-connecting Computer Sites
• Password Search
• 2D Representations
• Telephone Directory Alphabetization
• Dividing up
• Overlapping Air Traffic Control Zones
• Caesar Cypher

Re-connecting Computer Sites

Consider the problem of selecting a set T of high-speed lines for connecting N computer sites, from a universe of M high-speed lines each connecting a pair of computer sites. Each high-speed line has a given monthly cost, and the objective is to minimize the total cost of connecting the N computer sites, where the total cost is the sum of the cost of each line included in set T. Consider further that this problem has been solved earlier for the set of N computer sites and M high-speed lines, but that a few K new high-speed lines have recently become available.

Your objective is to compute the new set T' that may yield a cost lower than the original set T, due to the additional K new high-speed lines and when M+K high-speed lines are available.

Input

The input will contain several test cases, each of them as described below. Consecutive test cases are separated by a single blank line.

The input is organized as follows:

• A line containing the number N of computer sites, with 1 <= N <= 1000000, and where each computer site is referred by a number i, 1 <= i <= N.
• The set T of previously chosen high-speed lines, consisting of N-1 lines, each describing a high-speed line, and containing the numbers of the two computer sites the line connects and the monthly cost of using this line. All costs are integers.
• A line containing the number K of new additional lines, 1 <= K <= 10.
• K lines, each describing a new high-speed line, and containing the numbers of the two computer sites the line connects and the monthly cost of using this line. All costs are integers.
• A line containing the number M of originally available high-speed lines, with N-1 <= M <= N (N-1) / 2.
• M lines, each describing one of the originally available high-speed lines, and containing the numbers of the two computer sites the line connects and the monthly cost of using this line. All costs are integers.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

The output file must have one line containing the original cost of connecting the Ncomputer sites with M high-speed lines and another line containing the new cost of connecting the N computer sites with M+K high-speed lines. If the new cost equals the original cost, the same value is written twice.

Sample Input

5 

1 2 5 

1 3 5 

1 4 5 

1 5 5 

1

2 3 2 

6 

1 2 5 

1 3 5 

1 4 5 

1 5 5 

3 4 8 

4 5 8 

Sample Output

20 

17 

Password Search

Being able to send encoded messages during World War II was very important to the Allies. The messages were always sent after being encoded with a known password. Having a fixed password was of course insecure, thus there was a need to change it frequently. However, a mechanism was necessary to send the new password. One of the mathematicians working in the cryptographic team had a clever idea that was to send the password hidden within the message itself. The interesting point was that the receiver of the message only had to know the size of the password and then search for the password within the received text.

A password with size N can be found by searching the text for the most frequent substring with N characters. After finding the password, all the substrings that coincide with the password are removed from the encoded text. Now, the password can be used to decode the message.

Problem

Your mission has been simplified as you are only requested to write a program that, given the size of the password and the encoded message, determines the password following the strategy given above.

To illustrate your task, consider the following example in which the password size is three (N=3) and the text message is just baababacb. The password would then be aba because this is the substring with size 3 that appears most often in the whole text (it appears twice) while the other six different substrings appear only once (baa ; aab ; bab ; bac ; acb).

Input

The input file contains several test cases, each of them consists of one line with the size of the password, 0 < N ≤10, followed by the text representing the encoded message. To simplify things, you can assume that the text only includes lower case letters.

Output

For each test case, your program should print as output a line with the password string.

Sample Input

3 baababacb 

Sample Output

aba   

2D Representations

2D Representations

Background

   A 2D raster image is defined by a matrix of points or pixels. In a black and white raster image, each pixel (a matrix element) can be black (full) or white (empty). There are several methods known to represent a raster image. Two of them, are the "Quadtree" and the "Run Length code".
   In a Quadtree, the matrix is preferably square with a length that is a power of two. One image is represented following a recursive visit: the image is divided in four image cells (accordingly to the order shown in Figure 1) and each cell is evaluated to be Full, Empty, or Partial. When a Partial cell is found, it is recursively subdivided in four cells and the same principle is repeated again and again until the cell is completely Full or completely Empty. The structure of a quadtree is a tree of nodes and each node can have from zero to four descendents (see Figure 1).

Figure 1 - One image, the order of visit and the quadtree

   In the Run Length code, pixels are grouped in series of empty pixels, full pixels and empty pixels again, etc. In this way, the image can be represented as a series of numbers, being each number of pixels in a group (we can assume that the first group is composed of full pixels). Using the image of Figure 1 as an example, the run length code is: 0, 20, 4, 4, 9, 1, 1, 1, 4, 1, 1, 2, 4, 4, 4, 4 (considering the lower left pixel as the first one).

Problem

   Given an image in the form of a quadtree, the problem is to obtain the correspondent run length code. The image maximum size is 256*256 and the origin of coordinates is the lower left pixel.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

   The first line of the input contains the length of the image and the second line contains the number of nodes Nto be considered (both in integer format). Each one of the following N lines describes a different node (in sequence, starting with node 1), with four fields separated by a space. Each field may be one character F (full) or E (empty) or a number that is the index of a descendent node.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

   One line with the run length code of the given image (integers separated by a space). Note that the first group is assumed to be Full.

Sample Input
1

8
5
E 2 F 3
E E F F
4 5 E E
F E E F
F E E E

Sample Output
0 20 4 4 9 1 1 1 4 1 1 2 4 4 4 4