摘要：
1. A + B 1 #include<bits/stdc++.h> 2 using namespace std; 3 4 typedef unsigned long long L; 5 6 int main() 7 { 8 L n, m; cin >> n >> m; 9 cout << n+m; 阅读全文
摘要：
Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0, 9] except 1. The (n+1)s 阅读全文
摘要：
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number 阅读全文
摘要：
Consider a positive integer N written in standard notation with k+1 digits ai as ak⋯a1a0 with 0 for all i and ak>0. Then N is palindrom 阅读全文
摘要：
Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, th 阅读全文
摘要：
Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six". (Quoted from http://mathworld.wolfram.com/Sexy 阅读全文
摘要：
"Let's C" is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of th 阅读全文
摘要：
British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an "Eddington number", E -- tha 阅读全文
摘要：
Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 2469135 阅读全文
摘要：
3.5 进制转换 P进制转换为10进制 // y 为要求的 10进制数 // x 为 P 进制数，循环中每次取一位 // product 在循环中不断乘 P，得到 P 的幂次 int y = 0, product = 1; while (x != 0){ y = y + (x % 10) * pro 阅读全文