HDU2522 A simple problem 【類比】

來源:互聯網
上載者:User

標籤:hdu2522

A simple problemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3133    Accepted Submission(s): 1144

Problem DescriptionZty很癡迷數學問題.。一天,yifenfei出了個數學題想難倒他,讓他回答1 / n。但Zty卻回答不了^_^. 請大家編程協助他.
 
Input第一行整數T,表示測試組數。後面T行,每行一個整數 n (1<=|n|<=10^5). 
Output輸出1/n. (是迴圈小數的,只輸出第一個迴圈節). 
Sample Input
4237168
 
Sample Output
0.50.30.1428570.005952380
 
Authoryifenfei 
SourceHDU 2008-10 Programming Contest 

#include <stdio.h>#include <string.h>#define maxn 100002bool vis[maxn];int main(){    int n, i, t, m;    scanf("%d", &t);    while(t--){        scanf("%d", &n);        if(n < 0){            printf("-"); n = -n;        }        if(n == 1){            printf("1\n"); continue;        }                memset(vis, 0, sizeof(bool) * n);        printf("0."); m = 1; vis[0] = 1;        while(!vis[m]){            vis[m] = 1; m *= 10;            printf("%d", m / n);            m %= n;        }        printf("\n");    }    return 0;}


HDU2522 A simple problem 【類比】

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.