• <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
             
            題目的大意是:給一個很大的數(shù)K,和一個普通的整數(shù)L,問K有沒有小于L的質(zhì)因子,有則輸出“BAD 那個因子”,否則輸出“GOOD”。
            首先,明顯當(dāng)然要打一個素數(shù)表了。
            接下來就是關(guān)鍵部分了,讀入K,把K轉(zhuǎn)成千進(jìn)制。把數(shù)字往大進(jìn)制轉(zhuǎn)換能夠加快運(yùn)算效率。千進(jìn)制的性質(zhì)與十進(jìn)制相似。例如,1234567890轉(zhuǎn)成千進(jìn)制,就變成了:[1][234][567][890]。

            然后再從小到大枚舉每一個素數(shù),并對其進(jìn)行高精度求余就行了。
            下面是關(guān)鍵部分的一些代碼:
            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() //建立素數(shù)表。 
            {
                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++) //轉(zhuǎn)化為千進(jìn)制。 
                    {
                        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 閱讀(333) 評論(0)  編輯 收藏 引用

            只有注冊用戶登錄后才能發(fā)表評論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2025年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久久久人妻精品一区二区三区 | 无码国产69精品久久久久网站| 精品国产乱码久久久久久浪潮| 精品久久人人爽天天玩人人妻| 91超碰碰碰碰久久久久久综合| 久久久久久国产精品无码超碰| 亚洲午夜久久久影院伊人| 久久久精品久久久久久| 日本道色综合久久影院| 国产福利电影一区二区三区久久久久成人精品综合 | 久久亚洲欧洲国产综合| 99久久99久久| 色综合色天天久久婷婷基地| 久久精品成人国产午夜| 免费国产99久久久香蕉| 久久精品国产WWW456C0M| 久久强奷乱码老熟女| 欧美精品乱码99久久蜜桃| 亚洲精品无码久久一线| 国产精品禁18久久久夂久| 久久精品国产精品亚洲精品| 国内精品久久久久久久亚洲| 狠狠色丁香婷婷久久综合| 久久99国产综合精品女同| 99精品伊人久久久大香线蕉| 久久夜色精品国产www| 无码日韩人妻精品久久蜜桃| 伊人久久免费视频| 99久久夜色精品国产网站| 国产午夜精品理论片久久影视| 久久久久99精品成人片牛牛影视| 少妇无套内谢久久久久| 国内精品久久久人妻中文字幕| 日韩精品久久久久久| 狠狠色丁香婷婷久久综合| av无码久久久久不卡免费网站 | 人妻无码久久一区二区三区免费| 久久香蕉一级毛片| 国产精品久久久香蕉| 久久er国产精品免费观看2| 久久综合亚洲色一区二区三区|