B. Friends and Presents
time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have two friends. You want to present each of them several positive integers. You want to present
cnt1 numbers to the first friend and
cnt2 numbers to the second friend. Moreover, you want all presented numbers to be distinct, that also means that no number should be presented to both friends.

In addition, the first friend does not like the numbers that are divisible without remainder by prime number
x. The second one does not like the numbers that are divisible without remainder by prime number
y. Of course, you're not going to present your friends numbers they don't like.

Your task is to find such minimum number v, that you can form presents using numbers from a set
1, 2, ..., v. Of course you may choose not to present some numbers at all.

A positive integer number greater than 1 is called
prime if it has no positive divisors other than 1 and itself.

Input

The only line contains four positive integers cnt1,
cnt2,
x, y (1 ≤ cnt1, cnt2 < 109;
cnt1 + cnt2 ≤ 109;
2 ≤ x < y ≤ 3·104) — the numbers that are described in the statement. It is guaranteed that numbers
x, y are prime.

Output

Print a single integer — the answer to the problem.

Sample test(s)
Input
3 1 2 3
Output
5
Input
1 3 2 3
Output
4
Note

In the first sample you give the set of numbers {1, 3, 5} to the first friend and the set of numbers
{2} to the second friend. Note that if you give set
{1, 3, 5} to the first friend, then we cannot give any of the numbers
1, 3,
5 to the second friend.

In the second sample you give the set of numbers {3} to the first friend, and the set of numbers
{1, 2, 4} to the second friend. Thus, the answer to the problem is
4.

题意:求出数字v ,使得能在1——v之间。分别选择cnt1不能被x整除 和 cnt2个数不能被y整除,而且cnt1和cnt2两组数中不能有同样的。

思路:二分加容斥原理

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#define ll __int64
#define N 2000000000
//容斥原理加二分。。 using namespace std;
ll cnt1,cnt2,x,y;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
} ll check(ll n)
{
ll t1,t2,t3,temp1,temp2,temp3; t1=n/x;//被x整除的个数
t2=n/y;//被y整除的个数
t3=n/(x*y/gcd(x,y));//被x和y最小公倍数整除的个数 if(n-t1>=cnt1&&n-t2>=cnt2&&n>=cnt1+cnt2+t3)
return true;
else
return false;
} int main()
{ while(~scanf("%I64d%I64d%I64d%I64d",&cnt1,&cnt2,&x,&y))
{
ll ri=N,le=1;
ll mid;
ll ans=0;
while(le<ri)
{
mid=(ri+le)/2;
if(check(mid))
{
ans=mid;
ri=mid;
}
else
le=mid+1;
}
cout<<ans<<endl;
}
return 0;
}

codefoeces B. Friends and Presents的更多相关文章

  1. CodeForces 483B Friends and Presents

     Friends and Presents Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I ...

  2. B. Friends and Presents(Codeforces Round #275(div2)

    B. Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input stand ...

  3. Codeforces483B. Friends and Presents(二分+容斥原理)

    题目链接:传送门 题目: B. Friends and Presents time limit per test second memory limit per test megabytes inpu ...

  4. Codeforces 483B - Friends and Presents(二分+容斥)

    483B - Friends and Presents 思路:这个博客写的不错:http://www.cnblogs.com/windysai/p/4058235.html 代码: #include& ...

  5. CF 483B. Friends and Presents 数学 (二分) 难度:1

    B. Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input stand ...

  6. Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) A. Little Artem and Presents 水题

    A. Little Artem and Presents 题目连接: http://www.codeforces.com/contest/669/problem/A Description Littl ...

  7. Codefoeces 734F. Anton and School 数学

    Codefoeces 734F 题目大意: 给定两个正整数序列\(b,c\)构造一个正整数序列\(a\)使其满足 \[ \left\{ \begin{array}{} b_i=(a_i\text{ a ...

  8. codeforces 669A A. Little Artem and Presents(水题)

    题目链接: A. Little Artem and Presents time limit per test 2 seconds memory limit per test 256 megabytes ...

  9. Codeforces Round #275 (Div. 2) B. Friends and Presents 二分+数学

    8493833                 2014-10-31 08:41:26     njczy2010     B - Friends and Presents             G ...

随机推荐

  1. jQuery效果show()方法

    $("button").click(function(){ $("p").show(); }); Syntax $(selector).show(speed,e ...

  2. 【Luogu】U16325小奇的花园(树链剖分)

    题目链接 学了学动态开点的树链剖分,其实跟动态开点的线段树差不多啦 查询的时候别ssbb地动态开点,如果没这个点果断返回0就行 只要注意花的种类能到intmax就行qwq!!!! #include&l ...

  3. css3制作扇形菜单

    工作中网页中有一个扇形的导航菜单,以前没有接触过,参考了http://www.w3cplus.com/css3/building-a-circular-navigation-with-css-tran ...

  4. Agile工作方法

    [工具] Slack https://slack.com/ 看板 https://trello.com/ 其他TBC

  5. [暑假集训--数位dp]hdu5787 K-wolf Number

    Alice thinks an integer x is a K-wolf number, if every K adjacent digits in decimal representation o ...

  6. Xode 8 的那些坑

    刚发布完Xcode的8.0果断更新了,发现用起来非常容易闪退,关键是我编辑项目时默认使用Xcode8打开,导致我用Xcode7打开Xib是报错: This version does not suppo ...

  7. hdu 4400 离散化+二分+BFS(暴搜剪枝还超时的时候可以借鉴一下)

    Mines Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Subm ...

  8. FZOJ 2102 Solve equation

                                                                                                        ...

  9. poj 2492 A Bug's Life 二分图染色 || 种类并查集

    题目链接 题意 有一种\(bug\),所有的交往只在异性间发生.现给出所有的交往列表,问是否有可疑的\(bug\)(进行同性交往). 思路 法一:种类并查集 参考:https://www.2cto.c ...

  10. 标准C程序设计七---37

    Linux应用             编程深入            语言编程 标准C程序设计七---经典C11程序设计    以下内容为阅读:    <标准C程序设计>(第7版) 作者 ...