sicily 1020. Big Integer

1020. Big Integer

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

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

2

3
2 3 5
10

4
2 3 5 7
13


Sample Output

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

题目分析

同余定理


#include <stdio.h>
#include <memory.h>

int main()
{
  int test;
  scanf("%d", &test);
  while (test--) {
    int num;
    scanf("%d", &num);
    int basis[num];
    for (int c = 0; c < num; ++c)
      scanf("%d", &basis[c]);
    char VeryLongInteger[400];
    scanf("%s", VeryLongInteger);

    int ans[num];
    memset(ans, 0, sizeof(ans));

    int temp;
    for (int c = 0; c < strlen(VeryLongInteger); ++c) {
      temp = VeryLongInteger[c] - '0';
      for (int d = 0; d < num; ++d) {
        ans[d] = (ans[d] * 10 + temp) % basis[d]; 
      }
    }

    for (int c = 0; c < num; ++c)
      if (c == 0)
        printf("(%d", ans[c]);
      else if (c == num - 1)
        printf(",%d)\n", ans[c]);
      else
        printf(",%d", ans[c]);
  }
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/huangjq36SYSU/article/details/49888745
个人分类: sicily
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

sicily 1020. Big Integer

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭