• <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>
            voip
            風的方向
            厚德致遠,博學敦行!
            posts - 52,comments - 21,trackbacks - 0
                           有時候失去的總比得到的多!

            Description

            The Double Seventh Festival, on the 7th day of the 7th lunar month, is a traditional festival full of romance. On that day, the God of the Love came to the digital kingdom, and annunciated to the people:

            Notification


            Do you want to know who is your fere? You can find him or her by this means:
            Please add all the factors of your ID-Card-Number, and you can find this is your fere's
            ID-Card-Number.


            The factors of a numer N is the numbers,they being small than the number N ,and can being divided exactly by the number N.
            For example, the number 12 has the factors, such as 1,2,3,4,6.

             

            Input

            The fist line is the number T (1 <= T <= 500000), indicated the number of the test cases.
            The next T lines, each line has one integer N( 1 <= N <= 500000), meaning the ID-Card-Number.

            Output

            For each test case, you should output the fere's ID-Card-Number on a line.

            Sample Input

            3
            2
            10
            20
            

             

            Sample Output

            1
            8
            22
                  這個題目在我剛開始接觸ACM的時候做出來最有成就的一個!求各因子之和!
            代碼如下:
            #include<cstdio>
            int main()
            {
                
            int i,j,n,m,sum;
                scanf(
            "%d",&n);
                
            for(i=0;i<n;i++)
                
            {
                    sum
            =0;
                    scanf(
            "%d",&m);
                    
            for(j=1;j*j<=m;j++)
                    
            {
                        
            if(m%j==0)
                        
            {
                            sum
            =sum+j+m/j;
                        }

                        
            if(j*j==m)
                            sum
            -=j;
                    }

                    printf(
            "%d\n",sum-m);
                }

                
            return 0;
            }

            posted on 2010-09-06 09:34 jince 閱讀(1050) 評論(0)  編輯 收藏 引用 所屬分類: Questions
            哈哈哈哈哈哈
            国产成人无码精品久久久久免费| 国产精品久久久久久| 青青青青久久精品国产| 久久精品国产精品青草| 免费一级做a爰片久久毛片潮| 无码8090精品久久一区| 国产精品久久久久久福利69堂| 伊人久久大香线蕉影院95| 久久久久AV综合网成人 | 久久精品无码专区免费东京热| 狠狠色丁香久久婷婷综合五月| 亚洲v国产v天堂a无码久久| 亚洲精品无码成人片久久| 久久久久久国产a免费观看不卡| 久久综合精品国产二区无码| 伊人久久一区二区三区无码| 国产高潮久久免费观看| 欧美日韩精品久久久免费观看| 久久综合狠狠色综合伊人| 怡红院日本一道日本久久 | 欧美亚洲另类久久综合婷婷| 久久久久亚洲AV成人片| 亚洲人成网站999久久久综合| 亚洲成色999久久网站| 日韩精品久久无码中文字幕| 亚洲一区精品伊人久久伊人| 草草久久久无码国产专区| 国产成年无码久久久久毛片| 亚洲乱码中文字幕久久孕妇黑人| 日本亚洲色大成网站WWW久久 | 精品久久久久久无码专区不卡| 免费精品国产日韩热久久| 香蕉久久AⅤ一区二区三区| 久久91这里精品国产2020| 欧美伊人久久大香线蕉综合69| 热久久国产精品| 国产A级毛片久久久精品毛片| 久久青青草原国产精品免费| 欧美久久综合性欧美| 99久久精品无码一区二区毛片| 国产一区二区精品久久岳|