UVA 202 迴圈小數_uva

來源:互聯網
上載者:User

看不懂,先立個Flag吧

import java.util.Arrays;import java.util.Scanner;public class Main {static int[] r = new int[3003];static int[] u = new int[3003];static int[] s = new int[3003];public static void main(String[] args){Scanner scan = new Scanner(System.in);int t;while(scan.hasNext()){int n = scan.nextInt();int m = scan.nextInt();t = n;Arrays.fill(r, 0);Arrays.fill(u, 0);int count = 0;r[count++] = n/m;n = n%m;while(u[n]==0&&n!=0){u[n] = count;s[count] = n;r[count++] = 10*n/m;n = 10*n%m;}System.out.printf("%d/%d = %d.",t,m,r[0]);for(int i=1;i<count&&i<=50;++i){if(n!=0&&s[i]==n)System.out.printf("(");System.out.printf("%d",r[i]);}if(n==0)System.out.printf("(0");if(count>50)System.out.printf("...");System.out.printf(")\n");System.out.printf("   %d = number of digits in repeating cycle\n\n",n==0?1:count-u[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.