算法学习【2】 - 1020. Big Integer

最新推荐文章于 2019-06-20 14:23:48 发布

原创最新推荐文章于 2019-06-20 14:23:48 发布 · 1.5k 阅读

2 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#integer #算法 #properties #output #input

Sicily 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种使用特定正整数集合作为计算机基础来存储BigInteger的方法。通过一组不超过1000且两两互质的正整数，文章详细阐述了如何将非负BigInteger转换为这些基数对应的余数序列。

题目：http://soj.me/1020

1020. Big Integer

Description

Long long ago, there was a super computer that could deal with VeryLongIntegers(no VeryLongInteger will be negative). Do you know how this computer stores the VeryLongIntegers? This computer has a set of n positive integers: b1,b2,...,bn, which is called a basis for the computer.

The basis satisfies two properties:
1) 1 < bi <= 1000 (1 <= i <= n),
2) gcd(bi,bj) = 1 (1 <= i,j <= n, i ≠ j).

Let M = b1*b2*...*bn

Given an integer x, which is nonegative and less than M, the ordered n-tuples (x mod b1, x mod b2, ..., x mod bn), which is called the representation of x, will be put into the computer.

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains three lines.
The first line contains an integer n(<=100).
The second line contains n integers: b1,b2,...,bn, which is the basis of the computer.
The third line contains a single VeryLongInteger x.

Each VeryLongInteger will be 400 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

Output

For each test case, print exactly one line -- the representation of x.
The output format is:(r1,r2,...,rn)

Sample Input

Sample Output

(0,1,0)
(1,1,3,6)

Problem Source

ZSUACM Team Member

思路：这个，数学不太好，对模运算的一些特性不了解。模运算有如下公式：

(a+b)mod n = ((a mod n)+ (b mod n))mod n
(a-b) mod n = ((a mod n )- (b mod n)+n)mod n
ab mod n = (a mod n) (b mod n) mod n

本题，利用第一个公式即可。

代码：

#include <stdio.h>
#include <string.h>

int main()
{
	int i;
	int j;
	int length;

	int size;
	int n;
	int basis[100];
	int representation[100];
	char bigInt[401];

	scanf("%d", &size);
	while (size--)
	{
		scanf("%d", &n);
		for (i = 0; i < n; i++)
		{
			scanf("%d", &basis[i]);
		}

		scanf("%s", bigInt);
		length = strlen(bigInt);

		for (i = 0; i < n; i++)
		{
			representation[i] = 0;
			for (j = 0; j < length; j++)
			{
				representation[i] = (representation[i] * 10 + bigInt[j] - '0') % basis[i];
			}
		}

		printf("(%d", representation[0]);
		for (i = 1; i < n; i++)
		{
			printf(",%d", representation[i]);
		}
		printf(")\n");
	}

	return 0;
}