zoukankan
html css js c++ java
产生62位内任意数字大小写字母的随机数
vb.net版
Private
Shared
constant
As
Char
()
=
{
"
0
"
,
"
1
"
,
"
2
"
,
"
3
"
,
"
4
"
,
"
5
"
,
"
6
"
,
"
7
"
,
"
8
"
,
"
9
"
,
"
a
"
,
"
b
"
,
"
c
"
,
"
d
"
,
"
e
"
,
"
f
"
,
"
g
"
,
"
h
"
,
"
i
"
,
"
j
"
,
"
k
"
,
"
l
"
,
"
m
"
,
"
n
"
,
"
o
"
,
"
p
"
,
"
q
"
,
"
r
"
,
"
s
"
,
"
t
"
,
"
u
"
,
"
v
"
,
"
w
"
,
"
x
"
,
"
y
"
,
"
z
"
,
"
A
"
,
"
B
"
,
"
C
"
,
"
D
"
,
"
E
"
,
"
F
"
,
"
G
"
,
"
H
"
,
"
I
"
,
"
J
"
,
"
K
"
,
"
L
"
,
"
M
"
,
"
N
"
,
"
O
"
,
"
P
"
,
"
Q
"
,
"
R
"
,
"
S
"
,
"
T
"
,
"
U
"
,
"
V
"
,
"
W
"
,
"
X
"
,
"
Y
"
,
"
Z
"
}
Public
Shared
Function GenerateRandom()
Function
GenerateRandom()
Function GenerateRandom()
Function
GenerateRandom(
ByVal
Length
As
Integer
)
As
String
Dim
newRandom
As
System.Text.StringBuilder
=
New
System.Text.StringBuilder(
62
)
Dim
rd
As
Random
=
New
Random
Dim
i
As
Integer
=
0
While
i
<
Length
newRandom.Append(constant(rd.Next(
62
)))
System.Math.Min(System.Threading.Interlocked.Increment(i),i
-
1
)
End
While
Return
newRandom.ToString
End Function
C#版
private
static
char
[] constant
=
{
'
0
'
,
'
1
'
,
'
2
'
,
'
3
'
,
'
4
'
,
'
5
'
,
'
6
'
,
'
7
'
,
'
8
'
,
'
9
'
,
'
a
'
,
'
b
'
,
'
c
'
,
'
d
'
,
'
e
'
,
'
f
'
,
'
g
'
,
'
h
'
,
'
i
'
,
'
j
'
,
'
k
'
,
'
l
'
,
'
m
'
,
'
n
'
,
'
o
'
,
'
p
'
,
'
q
'
,
'
r
'
,
'
s
'
,
'
t
'
,
'
u
'
,
'
v
'
,
'
w
'
,
'
x
'
,
'
y
'
,
'
z
'
,
'
A
'
,
'
B
'
,
'
C
'
,
'
D
'
,
'
E
'
,
'
F
'
,
'
G
'
,
'
H
'
,
'
I
'
,
'
J
'
,
'
K
'
,
'
L
'
,
'
M
'
,
'
N
'
,
'
O
'
,
'
P
'
,
'
Q
'
,
'
R
'
,
'
S
'
,
'
T
'
,
'
U
'
,
'
V
'
,
'
W
'
,
'
X
'
,
'
Y
'
,
'
Z
'
}
;
public
static
string
GenerateRandom(
int
Length)
{
System.Text.StringBuilder newRandom
=
new
System.Text.StringBuilder(
62
);
Random rd
=
new
Random();
for
(
int
i
=
0
;i
<
Length;i
++
)
{
newRandom.Append(constant[rd.Next(
62
)]);
}
return
newRandom.ToString();
}
调用
string
str
=
GenerateRandom(
6
);
//
参数表示需要产生随机数的数目
查看全文
相关阅读:
BZOJ.3990.[SDOI2015]排序(DFS)
BZOJ.1040.[ZJOI2008]骑士(树形DP)
BZOJ.2246.[SDOI2011]迷宫探险(DP 记忆化搜索 概率)
BZOJ.3209.花神的数论题(数位DP)
UVA.1640.The Counting Problem / BZOJ.1833.[ZJOI2010]数字计数(数位DP)
HDU.3652.B-number(数位DP)
BZOJ.4514.[SDOI2016]数字配对(费用流SPFA 二分图)
BZOJ.4832.[Lydsy1704月赛]抵制克苏恩(期望DP)
BZOJ.1025.[SCOI2009]游戏(背包DP)
BZOJ.3257.树的难题(树形DP)
原文地址:https://www.cnblogs.com/studio313/p/298963.html
最新文章
linux 常用命令
AcWing202 最幸运的数字
HDU1698 Just a Hook
HDU1199 Color the Ball (线段树合并+离散化经典)
HDU1166 敌兵布阵(线段树模板)
AcWing352 闇の連鎖(树上差分+lca)
HDU4374 One hundred layer (单调队列dp)
HDU3530 Subsequence (单调队列)
HDU3401 Trade (单调队列优化dp)
Codeforces Round #627题解
热门文章
POJ3926 Parade (单调队列dp)
BZOJ.1951.[SDOI2010]古代猪文(费马小定理 Lucas CRT)
BZOJ.3944.Sum(杜教筛)
BZOJ.2820.YY的GCD(莫比乌斯反演)
BZOJ.4516.[SDOI2016]生成魔咒(后缀数组 RMQ)
BZOJ.4517.[SDOI2016]排列计数(错位排列 逆元)
BZOJ.3144.[HNOI2013]切糕(最小割)
2018.1.21 数论笔记
BZOJ.2440.[中山市选2011]完全平方数(莫比乌斯函数 二分)
BZOJ.4072.[SDOI2016]征途(DP 斜率优化)
Copyright © 2011-2022 走看看