« 博客园首页

hdu 1003 Max Sum

ion(s): 42082 Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,
lucky_少哖 2015-08-23 浏览(22)
http://www.cnblogs.com/pshw/p/4752326.html

all unicode

0xA462 42082 YI SYLLABLE XIEX ꑢ 0xA463 42083 YI SYLLABLE XIE ꑣ 0xA464 42084 YI SYLLABLE XIEP ꑤ 0xA465 42085 YI SYLLABLE XUOX ꑥ 0xA466 42086 YI SYLLABLE
bit祝威 2017-04-13 浏览(54)
http://www.cnblogs.com/bitzhuwei/p/all-unicode.html

MSSQL 版本全国地名数据库

ALUES ('42082', '乘马岗镇', '41910'); INSERT INTO area VALUES ('42083', '顺河镇', '41910'); INSERT INTO area VALUES ('42084', '铁门岗乡', '41910'); INSERT INTO area VALUES
拂髯客 2017-04-04 浏览(5)
http://www.cnblogs.com/Frank99/p/6664322.html

MySQL 版本全国地名数据库 ---- 转自网络

ALUES ('42082', '乘马岗镇', '41910'); INSERT INTO `area` VALUES ('42083', '顺河镇', '41910'); INSERT INTO `area` VALUES ('42084', '铁门岗乡', '41910'); INSERT INTO `area`
拂髯客 2017-04-04 浏览(2)
http://www.cnblogs.com/Frank99/p/6664326.html