sicily 1020. Big Integer

原创 2015年11月17日 16:00:56

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]);
  }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Sicily1020——Big Integer

1020. Big Integer Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Long long a...

Sicily 1020 Big Integer

1020. Big Integer Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Long long a...

[sicily] 1020. Big Integer

1020. Big IntegerConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionLong long ago, there w...

sicily 1020 Big Integer

1020. Big Integer Sample Input 2 3 2 3 5 10 4 2 3 5 7 13 Sample Output (0,1,0) (1,1,3,6) ...

1020. Big Integer

一直没写过技术博客,此博客到大三才开实在是晚。 此题为“算法分析与设计”的作业第一题,是sicily题库里的编号为1020的题目。 早上老师课上刚说分治法,看题目要求是大数求模,估计用int之类的...
  • Er_mu
  • Er_mu
  • 2014年09月23日 17:58
  • 370

1020. Big Integer(高精度运算)

Big Integer Total: 11039 Accepted: 3632 Rating: 2.7/5.0(43 votes) Time Limit: 1sec Mem...

1020. Big Integer 回归了 高精度模运算 ans = (ans*10 + (b[j]-'0')) % a[i]

1020. Big Integer Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description ...

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

题目:http://soj.me/1020 1020. Big Integer Description Long long ago, there was a su...
  • BetaBin
  • BetaBin
  • 2012年03月15日 13:39
  • 1125

big integer

  • 2009年07月26日 21:00
  • 39KB
  • 下载

Printing big integer,简单python程序

  • 2014年02月19日 11:09
  • 31KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:sicily 1020. Big Integer
举报原因:
原因补充:

(最多只允许输入30个字)