SOJ 1020
来源:互联网 发布:ch341a编程器教程 编辑:程序博客网 时间:2024/06/06 07:40
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
232 3 51042 3 5 713
Sample Output
(0,1,0)(1,1,3,6)
Problem Source
ZSUACM Team Member
这题要求输出一个大数对多个较小的数的取余结果,较小的数可以直接用int变量储存,大数只能用int数组来存储,最高位存储在int数组的0号位置,依此类推。然后从最高位开始对基底取余,模拟除法的过程最后就可以得到余数。
// Problem#: 1020// Submission#: 5045619// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include<iostream>using namespace std;int longInt[400],answer[100],basis[100];//分别用来存储大数,最后的答案和取余的基底 string longInteger;//先将大数作为字符串存储 int n,T;//n为基底的个数,T为例子的个数 void MOD(){ int temp; for(int i=0;i<longInteger.size();++i)//将字符串型的大数存入int数组,最高位存入longInt[0],次高位存入longInt[1],依此类推 longInt[i]=longInteger[i]-'0'; for(int i=0;i<n;++i)//用循环模拟列竖式做除法的过程 { temp=longInt[0]; for(int j=0;j<longInteger.size()-1;++j)//注意循环次数,小心数组越界 { temp=temp%basis[i]; temp=temp*10+longInt[j+1]; } temp=temp%basis[i]; answer[i]=temp; }}int main(){ cin>>T; for(int i=0;i<T;++i) { cin>>n; for(int j=0;j<n;++j) { cin>>basis[j]; } cin>>longInteger; MOD(); cout<<"("; for(int k=0;k<n-1;++k) { cout<<answer[k]<<','; } cout<<answer[n-1]<<")"<<endl; } return 0;}
- SOJ 1020
- soj
- SOJ-1020大数取模
- soj 1814
- SOJ-1012
- SOJ-1013
- SOJ-1015
- SOJ-1016
- SOJ-3327
- soj 3109
- { }soj.1206
- { }soj.2013
- SOJ-Dollars
- soj 1715
- soj 1681
- soj 6099
- soj 1050
- SOJ 13984
- C#---多线程
- 【UML】什么是UML
- bzoj1625
- MySql的基本知识储备之数据类型
- AFNetworking访问https出现"NSURLSession/NSURLConnection HTTP load failed (kCFStreamErrorDomainSSL, -9813"
- SOJ 1020
- 技术学习类网站手收集
- Java中String类的构造函数
- day 08 网络电视精灵
- JAVA学习笔记---类的继承
- Anroid中的事件处理Handler与事件分发机制举例子详细解释
- JAVA Web中【路径使用】总结
- linux 网络编程-基础篇
- Learn python the hard way_习题32_循环和列表