zoukankan      html  css  js  c++  java
  • 自己写的加密方式

    const string sNil = "'(&.&!'%&$"'&)" ",&)$(%#$-$#$$" ";    //'''(&.&!''%&$"''&)" ",&)$(%#$-$#$$" ' ;
            const string sTemp = " !"#$%&'()*+,-./";                      // ' !"#$%&''()*+,-./';
            /// <summary>
            /// 
            /// </summary>
            /// <param name="xUserID"></param>
            /// <returns></returns>
            public static string EncodeUserID(string xUserID)
            {
                char[] sUserID = xUserID.ToCharArray();
                string sResult = sNil.Substring((sUserID.Length - 1) * 2, 30 - (sUserID.Length - 1) * 2);   //DS-〉&.&!'%&$"'&)" ",&)$(%#$-
                int k = 0, j = 0, l = 0;
                for (int i = sUserID.Length - 1; i >= 0; i--)
                {
                    l = Convert.ToInt32(sUserID[i]);
                    k = (l - 32) % 16;
                    j = ((l - 32) / 16) + 1;
    
                    sResult = sResult + Convert.ToChar(32 + j + 1) + sTemp[k];
                }
                return sResult;
            }
            /// <summary>
            /// 
            /// </summary>
            /// <param name="xUserID"></param>
            /// <returns></returns>
            public static string DecodeUserID(string xUserID)
            {
                string resultStr = string.Empty, sResult = string.Empty;
                for (var i = xUserID.Length - 1; i >= 0; )
                {
                    int x = sTemp.IndexOf(xUserID[i]);
                    int y = Convert.ToInt32(xUserID[i - 1]) - 33;
                    int l = ((y - 1) * 16) + 32 + x;
                    resultStr += Convert.ToChar(l);
                    sResult = sNil.Substring((resultStr.Length - 1) * 2, 30 - (resultStr.Length - 1) * 2);
                    string tmpStr = xUserID.Substring(0, i - 1);
                    if (sResult == tmpStr)
                    {
                        break;
                    }
                    i -= 2;
                }
                return resultStr;
            } 
    

      

  • 相关阅读:
    P1587 [NOI2016]循环之美 杜教筛
    【学习笔记】省选动态规划类型选讲
    【模板】结构体重载高精度
    SP1716 GSS3
    SP1043 GSS1
    P1890 gcd区间 线段树
    【模板】(最小费用)最大流
    【模板】矩阵乘法
    P1073 最优贸易 DFS
    【2019.8.14】2019QB学堂DP图论班第一次考试 Problem C
  • 原文地址:https://www.cnblogs.com/kingkoo/p/3880394.html
Copyright © 2011-2022 走看看