Warehouse

http://codeforces.com/problemset/problem/118/A Problem - 118A - Codeforces codeforces.com Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: deletes all the vowels, inserts a character "." before each consonant, replaces..

http://codeforces.com/problemset/problem/1/A Problem - 1A - Codeforces codeforces.com Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a. What is the least number of flagstones needed to pave the Squa..

http://codeforces.com/problemset/problem/59/A Problem - 59A - Codeforces codeforces.com Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase o..

What is GCD? GCDis Greatest Common Divisor 한국어로 최대공약수입니다. 최대공약수라고 하면 초등학교 과정에서 배우는 기초수학, 아주 간단한 개념입니다. 어느 두 변수인, a와 b의 약수 중에 서로 중복면서 가장 큰 약수를 최대공약수라고 합니다. 예시) a = 100, b = 20 a의 약수 = 1, 2, 4, 5, 10, 20, 25, 50, 100 b의 약수 = 1, 2, 4, 5, 10, 20 서로 중복이 됨과 동시에 가장 큰 수인 20이 최대공약수입니다. How to get GCD by using C/C++ 보통 우리가 최대공약수를 구할 때 이런식으로 표를 만들어 구합니다. 하지만 이것을 프로그래밍 언어로 구현하기란 쉽지않습니다. 일단 해결하고자 하는 문제를 컴퓨터로..