A certain computer has ten registers and 1,000 words of RAM. Each register or RAM location holds a three-digit integer between 0 and 999. Instructions are encoded as three-digit integers and stored in RAM. The encodings are as follows: 100 means halt 2dn means set register d to n (between 0 and 9) 3dn means add n to register d 4dn means multiply register d by n 5ds means set register d to the va..

Graphical editors such as Photoshop allow us to alter bit-mapped images in the same way that text editors allow us to modify documents. Images are represented as an M x N array of pixels, where each pixel has a given color. Your task is to write a program which simulates a simple interactive graphical editor. Input The input consists of a sequence of editor commands, one per line. Each command i..

A friend of yours has just bought a new computer. Before this, the most powerful machine he ever used was a pocket calculator. He is a little disappointed because he liked the LCD display of his calculator more than the screen on his new computer! To make him happy, write a program that prints numbers in LCD display style. Input The input file contains several lines, one for each number to be di..

The Trip A group of students are members of a club that travels annually to different locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San Jose, and Atlanta. This spring they are planning a trip to Eindhoven. The group agrees in advance to share expenses equally, but it is not practical to share every expense as it occurs. Thus individuals i..

Minesweeper Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can't remember. The goal of the game is to find where all the mines are located within a M x N field. The game shows a number in a square which tells you how many mines there are adjacent to that square. Each square has at most eight adjacent squares. The 4 x 4 field on the lef..

ttp://programming-challenges.com/pg.php?page=downloadproblem&probid=110101&format=html Consider the following algorithm to generate a sequence of numbers. Start with an integer n. If n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process with the new value of n, terminating when n = 1. For example, the following sequence of numbers will be generated for n = 22: 22 11 3..

출처: http://lohengrin.egloos.com/1907690 Find three ways to change one character in the following code so that the resulting code will print exactly 20 minus signs Remember: for each solution you can only change "one" character from this original code: int i, n=20; for(i =0 ; i 오답 in..

http://www.careercup.com/question?id=58132 1. Implement memcopy considering the overlap 2. Given a linked list: a->b->c->d.... Write a function to swap the each node pair , such that output will be as follows: b->a->d->c->... void reversePair(Node** p_ppstrHead) { Node* z_pstr1st = *p_ppstrHead; Node* z_pstr2nd = (*p_ppstrHead)->next; Node* z_pstr3rd = z_pstr1st; *p_ppstrHead = z_pstr2nd; while ..

http://www.careercup.com/question?id=58086 Given a function int strcspn(char * source, char * search) code the most efficient way to return the index of first character that matches in the source string. eg# source ="ttbbcca" search ="ggabba" the returned value is 6 since the first match "a" occurs at 6th index in source string. * 실제 strcspn 함수의 동작은 문제와는 다름 size_t strcspn (const char *string, co..