• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 14,  comments - 11,  trackbacks - 0
            Problem Description
            RSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:

            > choose two large prime integer p, q
            > calculate n = p × q, calculate F(n) = (p - 1) × (q - 1)
            > choose an integer e(1 < e < F(n)), making gcd(e, F(n)) = 1, e will be the public key
            > calculate d, making d × e mod F(n) = 1 mod F(n), and d will be the private key

            You can encrypt data with this method :

            C = E(m) = me mod n

            When you want to decrypt data, use this method :

            M = D(c) = cd mod n

            Here, c is an integer ASCII value of a letter of cryptograph and m is an integer ASCII value of a letter of plain text.

            Now given p, q, e and some cryptograph, your task is to "translate" the cryptograph into plain text.
             

            Input
            Each case will begin with four integers p, q, e, l followed by a line of cryptograph. The integers p, q, e, l will be in the range of 32-bit integer. The cryptograph consists of l integers separated by blanks.
             

            Output
            For each case, output the plain text in a single line. You may assume that the correct result of plain text are visual ASCII letters, you should output them as visualable letters with no blank between them.
             

            Sample Input
            101 103 7 11 7716 7746 7497 126 8486 4708 7746 623 7298 7357 3239
             

            Sample Output
            I-LOVE-ACM.
            以為要數組,想想,不是那么回事!

            挺簡單的~~
             1 #include<iostream>
             2 using namespace std;
             3 int main(){
             4     int p,q,e,t;
             5     while (cin>>p>>q>>e>>t)
             6     {
             7            int n = p*q,fn = (p-1)*(q-1);
             8            int d =1;
             9            while ((d*e)%fn!=1)d++;
            10           int c;
            11           for (int i=0;i<t;i++)
            12           {
            13                  cin>>c;
            14                  int temp=1;
            15                  for (int j=1;j<=d;j++)
            16                  {
            17                      temp*=c;
            18                      temp%=n;
            19                   }
            20                 cout<<char(temp); 
            21                  }
            22            cout<<endl;
            23            }    
            24     return 0;
            25     }
            posted on 2010-06-26 18:59 路修遠 閱讀(467) 評論(0)  編輯 收藏 引用
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            轉載,請標明出處!謝謝~~

            常用鏈接

            留言簿(1)

            隨筆分類

            隨筆檔案

            文章檔案

            搜索

            •  

            最新評論

            • 1.?re: HDU 2433 最短路
            • @test
              的確這組數據應該輸出20的
            • --YueYueZha
            • 2.?re: HDU 2433 最短路
            • 這方法應該不對。 看下面這組數據
              4 4
              1 2
              2 3
              3 4
              2 4

              畫個圖,刪去最后一條邊 2 4 后的結果應該是20,但是此方法的輸出是19
            • --test
            • 3.?re: HDU 2433 最短路
            • ans = ans + sum_u + sum_v - sum[u] - sum[v],
              這個公式不是很理解啊,不知道博主怎么想的啊,謝謝咯
            • --姜
            • 4.?re: HDU 2433 最短路
            • @attacker
              the i-th line is the new SUM after the i-th road is destroyed
            • --路修遠
            • 5.?re: HDU 2433 最短路
            • 你這樣可以AC????刪除<U,V>不僅改變 u,v最短路啊、、、求解
            • --attacker

            閱讀排行榜

            評論排行榜

            色成年激情久久综合| 欧美亚洲国产精品久久久久| 久久精品国产亚洲av瑜伽| 国内精品久久久久久不卡影院 | 久久久久久九九99精品| 国产日产久久高清欧美一区| 国产精品伊人久久伊人电影| 久久亚洲精品无码VA大香大香| 狠狠色丁香婷综合久久| 久久强奷乱码老熟女网站| 新狼窝色AV性久久久久久| 伊人久久大香线蕉影院95| 久久久久久久精品成人热色戒| 久久伊人精品青青草原高清| 久久伊人五月丁香狠狠色| 久久r热这里有精品视频| 久久亚洲AV成人无码软件| 国产成人精品久久亚洲高清不卡 | 久久久久亚洲AV无码观看| 91久久成人免费| 精品综合久久久久久888蜜芽| 欧美与黑人午夜性猛交久久久| 久久香蕉国产线看观看99| 亚洲国产精品无码久久一区二区| 久久亚洲高清综合| 999久久久免费国产精品播放| 久久婷婷激情综合色综合俺也去| 亚洲AV伊人久久青青草原| 国产伊人久久| 精品国产91久久久久久久a | 色诱久久av| 久久免费香蕉视频| 久久精品中文字幕有码| 精品久久久久一区二区三区| 欧美精品一区二区精品久久| 久久精品www| 国产99久久久国产精品~~牛| 91精品免费久久久久久久久| 久久精品国产亚洲欧美| a级毛片无码兔费真人久久| 97超级碰碰碰碰久久久久|