hdoj 2522 A simple problem 【模拟】

#include <stdio.h>
#include <string.h>
#define M 100005
bool vis[M];
int main(){
	int t, n;
	scanf("%d", &t);
	while(t --){
		scanf("%d", &n);
		if(n == 1||n == -1){
			printf("%d", n); continue;
		}
		if(n < 0){
			n = -n;
			printf("-");
		}
		memset(vis, 0, sizeof(vis));
		int cur = 1;
		printf("0.");
		vis[1] = 1;
		while(cur){
			cur *= 10;
			printf("%d", cur/n);
			cur %= n;
			if(vis[cur]) break;
			else vis[cur] = 1;
		}
		puts("");
	}
	return 0;
}