Codeforces 55D Beautiful Number a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. Input The first l
分类：
其他好文 时间：
2016-01-29 21:07:27
阅读次数：
196
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single
分类：
其他好文 时间：
2016-01-29 19:39:15
阅读次数：
133
IdentifierAnidentifieris an arbitrarily long sequence of digits, underscores, lowercase and uppercase Latin letters, and most Unicode characters (disa...
分类：
其他好文 时间：
2016-01-26 16:32:20
阅读次数：
282
The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions ma...
分类：
其他好文 时间：
2016-01-25 06:33:39
阅读次数：
265
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You m...
分类：
其他好文 时间：
2016-01-24 23:45:43
阅读次数：
192
// hdu 5564// 考虑dp，令d(i,j,k)表示长度为i第i位为j余数为k的方案数// 则d(1,j,j%7) = 1, 0using namespace std;typedef long long ll;const ll MOD = 1000000007;typedef vector ...
分类：
其他好文 时间：
2016-01-23 21:05:15
阅读次数：
205
题目描述：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit ...
分类：
编程语言 时间：
2016-01-22 00:04:33
阅读次数：
213
题目：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a sing...
分类：
其他好文 时间：
2016-01-21 00:31:42
阅读次数：
274
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which...
分类：
其他好文 时间：
2016-01-18 11:57:22
阅读次数：
177
1 class Solution {2 public:3 int addDigits(int num) {4 if(num == 0 ) return num;5 else return num % 9 == 0 ? 9 : num % 9;6 }7 ...
分类：
其他好文 时间：
2016-01-15 14:27:57
阅读次数：
134
