CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Codeforces Round #453 (Div. 1)by Philip Ares
Senor Vorpal Kickass'o invented an innovative method to encrypt integer sequences of length n. To encrypt a sequence, one has to choose a secret sequence , that acts as a key.
Read more…(31 words)
[LCPCP2] Johnny Learns Modular exponentiationby Juan Vargas
DescriptionAfter Johnny solved problem A in LCPC2012 practice contest he decided to read more about modulo operation so he read the following article.
Read more…(23 words)
10699 - Count the factorsby Juan Vargas
Write a program, that computes the number of different prime factors in a positive integer
Read more…(15 words)
460 -Overlapping Rectanglesby Juan Vargas
When displaying a collection of rectangular windows on a SUN screen, a critical step is determining whether two windows overlap, and, if so, where on the screen the overlapping region lies. Write a program to perform this function. Your program will accept as input the coordinates of two rectangular windows. If the windows do not overlap, your program should produce a message to that effect. If they do overlap, you should compute the coordinates of the overlapping region (which must itself be a rectangle). All coordinates are expressed in “pixel numbers”, integer values ranging from 0 to 9999. A rectangle will be described by two pairs of (X, Y ) coordinates. The first pair gives the coordinates of the lower left-hand corner (XLL, YLL). The second pair gives the coordinates of the upper right-hand coordinates (XUR, YUR). You are guaranteed that XLL < XUR and YLL < YUR.