杭電--N!(大數)

來源:互聯網
上載者:User

標籤:

N!

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 64556    Accepted Submission(s): 18431


Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N! 

 

InputOne N in one line, process to the end of file. 

 

OutputFor each N, output N! in one line. 

 

Sample Input
1 2 3

 

 

 

Sample Output
1 2 6

 

 

 

AuthorJGShining(極光炫影)  
 1 #include <stdio.h> 2 int num[100100] ; 3 int main() 4 { 5     int n ; 6     while(~scanf("%d", &n)) 7     {  8         num[1] = 1 ;                // n = 0  ; 9         int i, j, temp, d=1, c=0, sum ;10         for(i=1; i<=n; i++)11         {12             for(j=1; j<=d; j++)     //一位位乘,取餘儲存,取整進位,d表示結果位元 ; 13             {14                 temp = num[j] * i + c ;15                 num[j] = temp % 10 ;16                 c= temp / 10 ;17             }18             while(c)19             {20                 num[++d] = c % 10 ;21                 c /= 10 ;22             }23         }24         for(i=d; i>=1; i--)25         printf("%d", num[i]) ;26         printf("\n") ;27     }28     return 0 ;29 } 

 

杭電--N!(大數)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.