codeforces 805A - Fake NP
2017-05-22 09:47
525 查看
题意:给定一个区间,从区间所有整数中,包含边界l,r,找出他们共同约数出现次数最多的数,将其打印
思路:lr区间中一定有偶数,否则l,r相等,任意输出一个即使,偶数都有约数2,而奇数没,所有答案为2 =_=
#include<cstdio>
int main()
{
int l,r;
while(~scanf("%d%d",&l,&r))
{
if(l==r)
printf("%d\n",l);
else
printf("2\n");
}
}
思路:lr区间中一定有偶数,否则l,r相等,任意输出一个即使,偶数都有约数2,而奇数没,所有答案为2 =_=
#include<cstdio>
int main()
{
int l,r;
while(~scanf("%d%d",&l,&r))
{
if(l==r)
printf("%d\n",l);
else
printf("2\n");
}
}
相关文章推荐
- 【codeforces 805A】Fake NP
- Fake NP (Codeforces - 805A)
- codeforces 411div2-fake NP
- Codeforces 805A(数学)
- Codeforces 478B Random Teams(组合数学)
- CodeForces 461A Appleman and Toastman
- Cell Not Under Attack(Codeforces 701B)(Codeforces Round#364 Div2 B)
- CodeForces - 462B Appleman and Card Game
- codeforces 776C - Molly's Chemicals 前缀和
- CodeForces 37 D.Lesson Timetable(组合数学+dp)
- codeforces-#479A. Expression
- Codeforces 616C The Labyrinth
- CodeForces 633A之Ebony and Ivory
- CodeForces - 586D Phillip and Trains
- codeforces 621A Wet Shark and Odd and Even
- codeforces 546e Soldier and Traveling
- codeforces 283C
- Codeforces 614 D Skills
- Codeforces 701C They Are Everywhere(尺取/双指针)
- Codeforces 755C-PolandBall and Forest