???
查看原帖
???
716006
Yamchip楼主2022/7/5 20:15
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,d,shang[10000005],yu,box[10000005],sum,wei;
int main(){
	scanf("%d%d",&n,&d);
	wei = n/d;
	printf("%d.",wei);
	if(wei==0)
		sum++;
	else
		while(wei>0){
			sum++;
			wei/=10;
		}
	if(n % d == 0){
		printf("0\n");
		return 0;
	}
	yu = n % d;
	for(int i = 1; ;i++){
		box[yu] = i;
		shang[i] = yu * 10 / d;
		yu = yu * 10 % d;
		if(yu == 0){
			for(int j = 1;j <= i;j++){
				sum++;
				if(sum%100==0){
					printf("\n");
					sum=0;
				}
				printf("%d",shang[j]);
			}
			return 0;
		}else
			if(box[yu] > 0){
				int j = box[yu];
				for(int k = 1;k <= j - 1;k++){
					sum++;
					printf("%d",shang[k]);
				}
				sum++;
				printf("(");
				for(int k = j;k <= i;k++){
					sum++;
				    if(sum%100==0){
						printf("\n");
						sum=0;
					}
					printf("%d",shang[k]);
				}
				printf(")");
				return 0;
			}
	}
	return 0;
}

2022/7/5 20:15
加载中...