Responsive image

问题 2334 --高精度除法

2334: 高精度除法

时间限制: 1 Sec  内存限制: 128 MB
提交: 0  解决: 1
[提交][状态][讨论版][命题人:]

题目描述

输入n表示n组数据
下面n行输入a,b
对于每一组输入输出a/b的商和余数

样例输入

5
1111111111111111 12
123456789987654321 3216654
123456789101112131415161718192021222324252627282930 114514
100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129 130
786153123862148645313232151654654649874531216845123 12348615648656486564865648656485648

样例输出

92592592592592 7
38380500354 1958805
1078093413042179396538080218942847357740124589 98184
770008477716185423893131600839308547016254723962431670139377847085554793262500970208677 119
63663259609807443 5807171603549231965719800843767059


来源

[提交][状态]
ACM算法攻关部
  • Anything about this OnlineJudge, Please Contact Administrator. Click add QQ

    OJ system based on HUSTOJ Project , UI based on Twitter Bootstrap

    Copyright 2016 ACM算法攻关部
    关于网站改版