• <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 - 74,  comments - 33,  trackbacks - 0
            The Embarrassed Cryptographer
            Time Limit: 2000MS Memory Limit: 65536K
            Total Submissions: 4062 Accepted: 804

            Description

            The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the product of two primes, and are believed to be secure because there is no known method for factoring such a product effectively.
            What Odd Even did not think of, was that both factors in a key should be large, not just their product. It is now possible that some of the users of the system have weak keys. In a desperate attempt not to be fired, Odd Even secretly goes through all the users keys, to check if they are strong enough. He uses his very poweful Atari, and is especially careful when checking his boss' key.

            Input

            The input consists of no more than 20 test cases. Each test case is a line with the integers 4 <= K <= 10100 and 2 <= L <= 106. K is the key itself, a product of two primes. L is the wanted minimum size of the factors in the key. The input set is terminated by a case where K = 0 and L = 0.

            Output

            For each number K, if one of its factors are strictly less than the required L, your program should output "BAD p", where p is the smallest factor in K. Otherwise, it should output "GOOD". Cases should be separated by a line-break.

            Sample Input

            143 10
            143 20
            667 20
            667 30
            2573 30
            2573 40
            0 0

            Sample Output

            GOOD
            BAD 11
            GOOD
            BAD 23
            GOOD
            BAD 31
             
            題目的大意是:給一個很大的數K,和一個普通的整數L,問K有沒有小于L的質因子,有則輸出“BAD 那個因子”,否則輸出“GOOD”。
            首先,明顯當然要打一個素數表了。
            接下來就是關鍵部分了,讀入K,把K轉成千進制。把數字往大進制轉換能夠加快運算效率。千進制的性質與十進制相似。例如,1234567890轉成千進制,就變成了:[1][234][567][890]。

            然后再從小到大枚舉每一個素數,并對其進行高精度求余就行了。
            下面是關鍵部分的一些代碼:
            int divide(int div) //高精度求余。 
            {
                int i,ans=0;
                for(i=la-1;i>=0;i--)
                    ans=(ans*1000+a[i])%div;
                return ans;    
            }

            void makeprime() //建立素數表。 
            {
                int i,j,isprime,k,p=3;
                for(i=6;i<N;i++)
                {
                    isprime=1;
                    k=(int)sqrt(i);    
                    for(j=0;j<p;j++)
                    {
                        if(prime[j]>k+1)
                            break;
                        if(i%prime[j]==0)
                        {
                            isprime=0;
                            break;
                        }    
                    }
                    if(isprime) prime[p++]=i;    
                }    
            }

                    len=strlen(s);
                    for(i=0;i<len;i++) //轉化為千進制。 
                    {
                        t=(len-i+2)/3-1;
                        a[t]=a[t]*10+s[i]-'0';
                    }
                    la=(len+2)/3;
            posted on 2008-12-24 21:51 KNIGHT 閱讀(335) 評論(0)  編輯 收藏 引用
            <2009年4月>
            2930311234
            567891011
            12131415161718
            19202122232425
            262728293012
            3456789

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久综合色区| 人妻无码αv中文字幕久久| 久久亚洲AV成人无码软件| 午夜精品久久久久久| 亚洲AV无码一区东京热久久 | 日本久久久久亚洲中字幕 | 国产叼嘿久久精品久久| A级毛片无码久久精品免费| 国产精品内射久久久久欢欢| 一97日本道伊人久久综合影院| 国内精品久久久久久不卡影院| 欧美大香线蕉线伊人久久| 中文字幕一区二区三区久久网站| 久久综合国产乱子伦精品免费| 成人久久综合网| 久久亚洲精品中文字幕| 久久久久国产成人精品亚洲午夜| 亚洲精品高清国产一久久| 少妇无套内谢久久久久| 国产精品亚洲美女久久久| 国产精品久久久久久吹潮| 东京热TOKYO综合久久精品| 久久最新免费视频| 国内精品久久久久影院网站 | 久久久av波多野一区二区| 国产精品九九九久久九九| 99精品国产99久久久久久97| 伊人久久大香线蕉综合5g| 欧美日韩精品久久久免费观看| 伊人久久免费视频| 久久亚洲国产午夜精品理论片| 97精品伊人久久久大香线蕉| 久久精品国产亚洲AV高清热| 久久久久久亚洲Av无码精品专口| 亚洲国产精品久久久天堂| 国色天香久久久久久久小说| 狠狠色狠狠色综合久久| 狼狼综合久久久久综合网| 久久精品人人槡人妻人人玩AV | 久久久久人妻精品一区二区三区| 久久免费的精品国产V∧|