Write 3 programs that do the following task: Let A, B, C source codes of those three programs; if A runs BC is produced as output, if B runs CA is produced, if C runs AB is produced; so each program writes a string (cycled for each program) and hides itself from it. Additional, but essent...

Smallest number which is divisible by all integers [1 ... n] Input: A non-negative integer, n. Output: The smallest integer which is divisible by every integer from 1 to n inclusive. Note that, by convention, the output for n=0 is 1. Rules and clarifications: You can write a program or funct...

Note: This is related to a variation of the game Rummikub Background & Rules Rummikub is a tile-based game. There are four colors: red, orange, blue and black. For each color there are 13 tiles (labeled from 1 to 13), and there are also 2 Jokers which are color-independent, hence there are 54...

#include <stdio.h> int main( ) { int x = 10, y = 3, z; for(z = 0; z<x; ){ z = z +y; printf("%d\n", z) ;} printf("%d\n", z) ; return 0; } and this code : #include <stdio.h> int main( ) { int x = 10, y = 3, z; for(z = 0; z<x; ){ z = z++ +y; printf("%d\n", ...

Alec and Bob are playing a game called Card Wars. Both players have one deck containing N cards each. The hierarchy of card values is as follows: ace (marked with the symbol A), king (K), queen (Q), jack (J), ten (T) and from nine to two (9−2). The game is played in turns. In every turn, each pl...

Probably a simple code-golf challenge. Given 2 positive integers m and n, make a list of n values that are positive integers whose sum is equal to the number m. Examples For example m=6 and n=3 would become 2, 2, 2 m=7 and n=3 would become 2, 2, 3 or 2, 3, 2 or 3, 2, 2 m=7 and n=2 would beco...