DescriptionSome days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number ...
分类:
其他好文 时间:
2015-04-17 13:30:32
阅读次数:
132
题目A vampire number has an even number of digits and is formed by multiplying apair of numbers containing half the number of digits of the result. Thed...
分类:
编程语言 时间:
2015-04-17 13:28:17
阅读次数:
194
表结构表数据SQL如下with lmenu as( select name,id,1 as lv,cast(Name as nvarchar(max)) as name1, cast(ROW_NUMBER()over(order by getdate()) as nvarchar(10)) as o...
分类:
数据库 时间:
2015-04-17 13:24:35
阅读次数:
161
I -The Number of setTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 3006Appoint description:DescriptionGiven...
分类:
其他好文 时间:
2015-04-17 13:15:15
阅读次数:
156
TOYSTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11293Accepted: 5439DescriptionCalculate the number of toys that land in each bin of a par...
分类:
其他好文 时间:
2015-04-17 13:08:24
阅读次数:
124
KiKi's K-Number
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU
2852
Appoint description:
leolin (2011-08-22)System Crawler (2015-0...
分类:
其他好文 时间:
2015-04-17 11:42:50
阅读次数:
94
D. R2D2 and Droid Army
An army of n droids is lined up in one row. Each droid is described by m integers a1,?a2,?...,?am,
where ai is
the number of details of thei-th type in this droid's m...
分类:
其他好文 时间:
2015-04-17 11:39:56
阅读次数:
154
看上去像是回文串自动机的模板题,就来了一发
The Number of Palindromes
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1992 Accepted Submission(s): 694...
分类:
其他好文 时间:
2015-04-17 11:26:22
阅读次数:
160
declare jobno number;begin sys.dbms_job.submit(jobno,'PKG_ZJBI_SJTB.PROC_ZJBI_SJTB;', sysdate + 1 / (24 * 60), 'sysdate + 1 / (24 * 60)',f...
分类:
数据库 时间:
2015-04-17 11:13:47
阅读次数:
185
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font ...
分类:
其他好文 时间:
2015-04-17 10:51:01
阅读次数:
97