zoukankan      html  css  js  c++  java
  • c# 一段生成6位不重复的随机数字码存8万个

    static void Main(string[] args)
    {
    ArrayList al = new ArrayList();
    Random rd = new Random();
    int count = 0;
    bool sign = true;
    while (sign)
    {

    int end = 999999;
    int begin = 100000;
    Int64 k = rd.Next(begin, end);
    Int64 i = k + 99;
    if (!al.Contains(i))
    {
    count++;
    al.Add(i);
    // Console.WriteLine(i.ToString());
    Write(i.ToString());
    }
    if (count == 80000)
    { sign = false; }
    }
    Console.WriteLine(al.Count.ToString());
    Console.ReadKey();


    // GenerateRandomCode(6);
    }
    public static void Write(string text)
    {
    FileStream fs = new FileStream(@"log.txt", FileMode.Append);
    StreamWriter sw = new StreamWriter(fs, Encoding.Default);
    sw.WriteLine(text);
    sw.Close();
    fs.Close();
    }
    /// <summary>
    ///生成制定位数的随机码(数字)
    /// </summary>
    /// <param name="length"></param>
    /// <returns></returns>
    public static string GenerateRandomCode(int length)
    {
    var result = new StringBuilder();
    for (var i = 0; i < length; i++)
    {
    var r = new Random(Guid.NewGuid().GetHashCode());
    result.Append(r.Next(0, 10));
    }
    return result.ToString();
    }

    技术交流qq群:143280841
  • 相关阅读:
    poj2388-Who's in the Middle(排序)
    poj1543-Perfect Cubes(暴力)
    poj1664-放苹果(递归)
    快速幂
    poj2389-Bull Math(大整数乘法)
    HDU2608-0 or 1(数论+找规律)
    poj1131-Octal Fractions(进制转换)
    [noip2011 d1t2]选择客栈
    [周记]8.7~8.16
    [noip2012d1t2] 国王游戏
  • 原文地址:https://www.cnblogs.com/zuochanzi/p/15428635.html
Copyright © 2011-2022 走看看