select cast(round(12.5,2) as numeric(5,2))

【select cast(round(12.5,2) as numeric(5,2))】的更多相关文章

select cast(round(12.5,2) as numeric(5,2))

http://www.jb51.net/article/74284.htm 解释: round()函数,是四舍五入用,第一个参数是我们要被操作的数据,第二个参数是设置小数四舍五入的精度. )--32.700 numeric函数,保留小数点后有效数.2个参数,第一个表示数据长度,第二个参数表示小数点后位数. cast as numeric(5,2)函数,转换数据类型,在是为了四舍五入之后的数字能确保显示小数点. 它包括用AS关键字分隔的源值和目标数据类型将这个值转换为numeric类型 …

SELECT CAST(GETDATE() AS VARCHAR(10)) 显示不同格式的原因

开发人员测试时,发现生产服务器与测试服务器执行SELECT CAST(GETDATE() AS VARCHAR(10))语句显示的格式不一样.如下所示 Server A Server B 其实出现这个问题,是因为登录名(login)的语言不一致所致,如下所示可以使用下面SQL语句来检查对应的默认语言 SELECT @@LANGUAGE 或 SELECT loginname,name, language FROM sys.syslogins 上面出现不一致是因为同一登录名的默认语言在服务…

“玲珑杯”ACM比赛 Round #12题解&源码

我能说我比较傻么!就只能做一道签到题,没办法,我就先写下A题的题解&源码吧,日后补上剩余题的题解&源码吧! A -- Niro plays Galaxy Note 7 Time Limit:1s Memory Limit:128MByte DESCRIPTION Niro, a lovely girl, has bought a Galaxy Note 7 and wants to…

Codeforces Beta Round #12 (Div 2 Only)

Codeforces Beta Round #12 (Div 2 Only) http://codeforces.com/contest/12 A 水题 #include<bits/stdc++.h> using namespace std; #define lson l,mid,rt<<1 #define rson mid+1,r,rt<<1|1 #define sqr(x) ((x)*(x)) #define maxn 1000010 typedef long lo…

BestCoder Round #12 War(计算几何)

War Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 81 Accepted Submission(s): 23 Special Judge Problem Description Long long ago there are two countrys in the universe. Each country haves i…

CAST 变类型，如 SELECT CAST('12' AS int)

select distinct CAST(value as signed) valueprice,CAST(value as signed) valueid from app_coupon…

Codeforces Beta Round #12 (Div 2 Only) D. Ball sort/map

D. Ball Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/problemset/problem/12/D Description N ladies attend the ball in the King's palace. Every lady can be described with three values: beauty, intellect and richness. King's Master…

hdu 5101 Select(Bestcoder Round #17)

Select Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 285 Accepted Subm…

Educational Codeforces Round 12 F. Four Divisors 求小于x的素数个数（待解决）

F. Four Divisors 题目连接: http://www.codeforces.com/contest/665/problem/F Description If an integer a is divisible by another integer b, then b is called the divisor of a. For example: 12 has positive 6 divisors. They are 1, 2, 3, 4, 6 and 12. Let's def…

Codeforces Beta Round #12 (Div 2 Only) D. Ball 树状数组查询后缀、最值

http://codeforces.com/problemset/problem/12/D 这里的BIT查询,指的是查询[1, R]或者[R, maxn]之间的最值,这样就够用了. 设三个权值分别是b[1], b[2], b[2]; 首先,先把b[1]值离散化,离散成一个个id,那么只能是在id比较大的地方找了.然后把b[2]排序,倒序查询,也就是先查询最大的,当然它是没可能自杀的,因为它已经最大了,然后查询完后,把它压进bit后,以后在bit查询,就不需要管b[2]了,因为在bit里面的b[2…