UVA 202 循环小数

最新推荐文章于 2022-01-04 17:22:29 发布

时间杀手Time

最新推荐文章于 2022-01-04 17:22:29 发布

阅读量366

点赞数

分类专栏： uva

本文链接：https://blog.csdn.net/jiaomenglei/article/details/57075108

版权

uva 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

看不懂，先立个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]);
		}
	}
	
	
}