<Sicily>Greatest Common Divisors
一、题目描述
A common divisor for two positive numbers is a number which both numbers are divisible by. It’s easy to calculate the greatest common divisor between tow numbers. But your teacher wants to give you a harder task, in this task you have to find the greatest common divisor d between two integers a and b that is in a given range from low to high (inclusive), i.e. low<=d<=high. It is possible that there is no common divisor in the given range.
二、输入
The first line contains an integer T (1<=T<=10)- indicating the number of test cases.
For each case, there are four integers a, b, low, high (1<=a,b<=1000,1<=low<=high<=1000) in one line.
三、输出
For each case, print the greatest common divisor between a and b in given range, if there is no common divisor in given range, you should print “No answer”(without quotes).
Sample Input
四、解题思路
题意:从low到high之间找出既能被a整除,又能被b整除的数,如果没有输出No answer
思路:这道题没什么好讲,就是遍历从high到low开始找一个既能被a整除又能被b整除就行了。
五、代码
#include<iostream>
using namespace std;
int main()
{
int times;
cin >> times;
while(times--)
{
int a, b, low, high;
cin >> a >> b >> low >> high;
bool result;
int divisor;
for(divisor = high; divisor >= low; divisor--)
{
if(a % divisor == 0 && b % divisor == 0) {result = true; break;}
result = false;
}
if(result) cout << divisor << endl;
else cout << "No answer" << endl;
}
return 0;
}
最新文章
- 前端Javascript框架收集
- Uva 11248 网络扩容
- VS.Net 2015 Update3 学习(1) 支持Webpack
- python之路——面向对象(进阶篇)
- 创建和导出SVG的技巧(转载)
- windows系统上安装与使用Android NDK r5 (转)
- Linux 笔记总览
- UITableView动态存放、重用机制
- shell自动计算脚本
- 【服务器环境搭建-Centos】tmpfs,【转载】
- java之yield(),sleep(),wait()区别详解-备忘笔记
- DataSet中取值(转)
- Runloop -------iOS
- HDU - 2147 kiki's game 巴什博弈
- day 03 数据类型
- qt: 打不开png图像以及opencv加载中文路径问题;
- echarts2 饼图处理标签文字过长使之达到指定字数换行的目的
- Hanoi问题 算法
- android webservice 成功版(帅哥)
- python的新特性