# HDU-6576 Worker

Worker
HDU-6576

Problem Description

Avin meets a rich customer today. He will earn 1 million dollars if he can solve a hard problem. There are n warehouses and m workers. Any worker in the i-th warehouse can handle ai orders per day. The customer wonders whether there exists one worker assignment method satisfying that every warehouse handles the same number of orders every day. Note that each worker should be assigned to exactly one warehouse and no worker is lazy when working.

In put

The first line contains two integers n (1 ≤ n ≤ 1, 000), m (1 ≤ m ≤ 1018). The second line contains n integers. The i-th integer ai (1 ≤ ai ≤ 10) represents one worker in the i-th warehouse can handle ai orders per day.

Out put
If there is a feasible assignment method, print “Yes” in the first line. Then, in the second line, print n integers with the i-th integer representing the number of workers assigned to the i-th warehouse.
Otherwise, print “No” in one line. If there are multiple solutions, any solution is accepted.

Sample Input
2 6
1 2
2 5
1 2

Sample Output
Yes
4 2
No

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll gcd1(ll a,ll b)
{
if(b==0)
{
return a;
}
else return gcd1(b,a%b);
}
int main()
{
ll n,m,a[2000],b[2000],c[2000];
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
for(int i=1;i<=n;i++)
{
if(i!=1)
{
b[i]=b[i-1]/gcd1(b[i-1],a[i])*a[i];
}
else
{
b[i]=a[i];
}
}
ll sum=0;
for(int i=1;i<=n;i++)
{
c[i]=b[n]/a[i];
sum+=c[i];
}
if(m%sum!=0)
{
printf("NO\n");
}
else
{
printf("Yes\n");
for(int i=1;i<=n;i++)
{
if(i==1)
{
printf("%lld",m/sum*c[i]);
}
else
{
printf(" %lld",m/sum*c[i]);
}
}
printf("\n");
}
return 0;
}

• 点赞
• 评论
• 分享
x

海报分享

扫一扫，分享海报

• 收藏
• 打赏

打赏

没事刷一道

你的鼓励将是我创作的最大动力

C币 余额
2C币 4C币 6C币 10C币 20C币 50C币
• 举报
• 一键三连

点赞Mark关注该博主, 随时了解TA的最新博文

11-11 90

11-10 166
07-22 146
11-18 160
07-22 74
07-27 42
11-16 73
05-17 372
07-22 190
09-17 388
07-28
01-21 3610