国产99久久精品_欧美日本韩国一区二区_激情小说综合网_欧美一级二级视频_午夜av电影_日本久久精品视频

最新文章專題視頻專題問答1問答10問答100問答1000問答2000關(guān)鍵字專題1關(guān)鍵字專題50關(guān)鍵字專題500關(guān)鍵字專題1500TAG最新視頻文章推薦1 推薦3 推薦5 推薦7 推薦9 推薦11 推薦13 推薦15 推薦17 推薦19 推薦21 推薦23 推薦25 推薦27 推薦29 推薦31 推薦33 推薦35 推薦37視頻文章20視頻文章30視頻文章40視頻文章50視頻文章60 視頻文章70視頻文章80視頻文章90視頻文章100視頻文章120視頻文章140 視頻2關(guān)鍵字專題關(guān)鍵字專題tag2tag3文章專題文章專題2文章索引1文章索引2文章索引3文章索引4文章索引5123456789101112131415文章專題3
問答文章1 問答文章501 問答文章1001 問答文章1501 問答文章2001 問答文章2501 問答文章3001 問答文章3501 問答文章4001 問答文章4501 問答文章5001 問答文章5501 問答文章6001 問答文章6501 問答文章7001 問答文章7501 問答文章8001 問答文章8501 問答文章9001 問答文章9501
當前位置: 首頁 - 科技 - 知識百科 - 正文

CodeforcesRound#275(Div.2)BFriendsandPresents_html/css

來源:懂視網(wǎng) 責編:小采 時間:2020-11-27 15:57:01
文檔

CodeforcesRound#275(Div.2)BFriendsandPresents_html/css

CodeforcesRound#275(Div.2)BFriendsandPresents_html/css_WEB-ITnose:題目鏈接:Friends and Presents Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outpu
推薦度:
導讀CodeforcesRound#275(Div.2)BFriendsandPresents_html/css_WEB-ITnose:題目鏈接:Friends and Presents Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outpu

題目鏈接:Friends and Presents



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 andcnt2 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?

Output

Print a single integer ? the answer to the problem.

Sample test(s)

input

3 1 2 3

output

input

1 3 2 3

output

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.





大致題意:A有兩個朋友B和C,B和C都很喜歡數(shù)字,現(xiàn)在A要送給他們各自一些不同的數(shù)字來做禮物,但是B不喜歡素數(shù)x,所以不能送給他x的倍數(shù);同樣如此,C不喜歡素數(shù)y,也不能送給他y的倍數(shù)。現(xiàn)在的任務(wù)是從找到一個最小的數(shù)v,使得從1~v里面可以滿足A的要求,分別送給B和C。



解題思路:最開始寫的時候,用的是暴力枚舉,但是結(jié)果老是在一個樣例上錯,可能我的想法不對吧,得不到正確答案。后來看給出的官方解法是用二分。。想了半天,也沒想太明白,關(guān)鍵是想不好怎么用二分呀,該對誰二分,寫了這題,又漲姿勢了,原來可以從1到無窮大二分,感覺好神奇呀。二分,就要找好二分區(qū)間時的條件,根據(jù)題目要求,又想了想,才艱難的把這題給搞了。。



AC代碼:

#include #include using namespace std;int main(){//	freopen("in.txt", "r", stdin);	int n, m, x, y;	while(scanf("%d%d%d%d", &n, &m, &x, &y) == 4){	int l = 1, r = 2e9; //枚舉區(qū)間端點	while(l < r){ //二分	int mid = l + (r - l)/2;	if( n <= (mid - mid/x) && m <= (mid - mid/y) && n+m <= mid - mid/(x*y)) //劃分區(qū)間的條件	r = mid;	else	 	l = mid + 1;	}	printf("%d\n", r);	}	return 0;}

聲明:本網(wǎng)頁內(nèi)容旨在傳播知識,若有侵權(quán)等問題請及時與本網(wǎng)聯(lián)系,我們將在第一時間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com

文檔

CodeforcesRound#275(Div.2)BFriendsandPresents_html/css

CodeforcesRound#275(Div.2)BFriendsandPresents_html/css_WEB-ITnose:題目鏈接:Friends and Presents Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outpu
推薦度:
標簽: css div2 #275
  • 熱門焦點

最新推薦

猜你喜歡

熱門推薦

專題
Top
主站蜘蛛池模板: 激情一区二区三区成人 | 国产日韩欧美第一页 | 在线免费一区 | 欧美极品第一页 | 亚洲欧美日韩国产综合 | 精品一区二区久久久久久久网精 | 国产亚洲一区二区三区不卡 | 国产精品视频播放 | 国产一区二区三区不卡免费观看 | 午夜看一级特黄a大片黑 | 日韩资源在线 | 国内一级一级毛片a免费 | 久久久视| 国产精品网站在线进入 | 91中文字幕| xxxwww欧美性| 欧美夜夜 | 国产一级高清免费观看 | 国产一区二区三区在线 | 91aaa在线观看 | 免费一看一级毛片 | 精品在线一区 | 日韩午夜视频在线观看 | 欧美精品免费在线观看 | 亚洲v欧美v日韩v国产v | 国产91久久久久久久免费 | 久久精品国产999久久久 | 91精品久久久久 | 中文字幕亚洲天堂 | 亚洲入口 | 国产在线观看入口 | 国产日韩在线观看视频网站 | 亚洲欧美日韩中文v在线 | 国产精品视频一区麻豆 | 亚洲精品高清国产一久久 | 波多野吉衣在线观看 | 国产精品视频大全 | 国产欧美一区二区 | 亚洲精品乱码久久久久久v 亚洲精品免费观看 | 亚洲第一页在线观看 | 欧美日韩在线观看一区二区 |