码迷,mamicode.com
首页 >  
搜索关键字:digit recongnizer    ( 1477个结果
Letter Combinations of a Phone Number leetcode java
题目:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the tele....
分类:编程语言   时间:2014-07-31 05:22:05    阅读次数:307
UVa 1583 Digit Generator(数)
For a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we call N a generator of M . For example, the digit-sum of 245 is 256 (...
分类:其他好文   时间:2014-07-29 21:53:12    阅读次数:284
POSIX字符类
文字数学字符[:alnum:]文字字符[:alpha:]数学字符[:digit:]非空字符(非空格,控制字符)[:graph:]大写字符[:upper:]小写字符[:lower:]控制字符[:xntrl:]非空字符,包括空格[:print:]标点符号[:punct:]所有空白字符(新行,空格,制表符)[:space:]十六进制数字(0-9a-fA-F)[:xd..
分类:其他好文   时间:2014-07-29 15:53:10    阅读次数:197
杭电 1060
Leftmost Digit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12947    Accepted Submission(s): 4953 Problem Description Given a positi...
分类:其他好文   时间:2014-07-29 15:04:40    阅读次数:196
HDU - 1061 Rightmost Digit
Description Given a positive integer N, you should output the most right digit of N^N.   Input The input contains several test cases. The first line of the input is a single integer...
分类:Web程序   时间:2014-07-29 14:47:28    阅读次数:270
HDU 1060 Leftmost Digit
Leftmost Digit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12985    Accepted Submission(s): 4973 Problem Description Given a po...
分类:其他好文   时间:2014-07-29 14:29:19    阅读次数:160
快速幂
快速幂 Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Given a positive integer N, you should output the most right digit of N^N. Input...
分类:其他好文   时间:2014-07-28 15:49:53    阅读次数:262
Open the Lock
Problem Description Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you can add or minus 1 to any d...
分类:其他好文   时间:2014-07-26 15:24:12    阅读次数:280
UVa1225,Digit Counting
#include #include int main(){ int n; scanf("%d", &n); char s[100]; while(n--) { scanf("%s", s); int len = strlen(s); ...
分类:其他好文   时间:2014-07-26 01:47:36    阅读次数:147
LeetCode——Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st...
分类:其他好文   时间:2014-07-21 16:44:12    阅读次数:191
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!