摘要：
题目描述 Description 将m进制数n转化成一个十进制数 m<=16 题目保证转换后的十进制数<=100 题目描述 Description 将m进制数n转化成一个十进制数 m<=16 题目保证转换后的十进制数<=100 将m进制数n转化成一个十进制数 m<=16 题目保证转换后的十进制数<= 阅读全文
摘要：
题目描述 Description 将十进制数n转换成m进制数 m<=16 n<=100 题目描述 Description 将十进制数n转换成m进制数 m<=16 n<=100 将十进制数n转换成m进制数 m<=16 n<=100 输入描述 Input Description 共一行 n和m 输入描述 阅读全文
摘要：
Description There are n cities in Bearland, numbered 1 through n. Cities are arranged in one long row. The distance between cities i and j is equal to 阅读全文
摘要：
Description A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer. Limak ca 阅读全文
摘要：
Description Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array 阅读全文
摘要：
Description After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first co 阅读全文
摘要：
最大公约数：能够同时被两个数整除的那个最大的数。 最小公倍数：两个整数公有的倍数成为他们的公倍数，其中一个最小的公倍数是他们的最小公倍数。 最小公倍数=两整数的乘积÷最大公约数 反之同理。 最大公约数算法： 1.GCD算法(欧几里得算法): 定理：两个整数的最大公约数等于其中较小的那个数和两数的相除 阅读全文
摘要：
Description Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321 阅读全文
摘要：
Description Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting p 阅读全文
摘要：
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone wit 阅读全文