Gym - 101350C

最新推荐文章于 2019-03-12 23:39:07 发布

原创最新推荐文章于 2019-03-12 23:39:07 发布 · 600 阅读

0 ·

CC 4.0 BY-SA版权

多校专栏收录该内容

63 篇文章

订阅专栏

一群袋鼠去印度餐厅就餐，每只袋鼠需要吃一定量的食物。为节省费用，袋鼠们决定订购相同大小的餐盘，并尽可能多地利用餐盘容量。此问题旨在寻找最小花费及对应的最大餐盘尺寸。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There are N kangaroos going out to eat at an Indian restaurant. The i^th kangaroo wants to eat exactly x_i food. The kangaroos all want to order the same size of plates, but each one can order more than one plate for themselves if they need to. If the kangaroo orders more than he needs, he can simply hide the leftovers in his pouch.

At this Indian restaurant, the cost of the plate is the same as its size. Since Karl the Kangaroo is paying and is low on money, he wants to know what is the minimum cost to feed all N kangaroos and what is the largest possible size of the plates that satisfies this minimum cost?

Input

The first line of input is T – the number of test cases.

The first line of each test case is an integer N (1 ≤ N ≤ 10⁵).

The second line contains N space-separated integers x_i (1 ≤ x_i ≤ 10⁹).

Output

For each test case, output a line containing two space-separated integers – the minimum cost and the maximum plate size that corresponds to when the total cost is minimized.

Example

Input

Output

5 5
6 2
思维题，最小总量一定是总和，然后再找所有值得最大公约数
ac代码：
#include <iostream>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int gcd(int a,int b)
{
    return b?gcd(b,a%b):a;
}
int main()
{
    int t,n,y;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        long long sum=0;
        scanf("%d",&y);
        sum+=y;
        int k=y;
        for(int i=1;i<n;i++)
        {
            scanf("%d",&y);
            sum+=y;
            if(y%k!=0)
            {
                k=gcd(k,y);
            }
        }
        printf("%lld %d\n",sum,k);
    }
    return 0;
}