分数拆分 时间限制:3000 ms | 内存限制:65535 KB 难度:1
-
描述
-
现在输入一个正整数k,找到所有的正整数x>=y,使得1/k=1/x+1/y.
-
输入
-
第一行输入一个整数n,代表有n组测试数据。
接下来n行每行输入一个正整数k
-
输出
-
按顺序输出对应每行的k找到所有满足条件1/k=1/x+1/y的组合
-
样例输入
-
2
2
12
-
样例输出
-
1/2=1/6+1/3
1/2=1/4+1/4
1/12=1/156+1/13
1/12=1/84+1/14
1/12=1/60+1/15
1/12=1/48+1/16
1/12=1/36+1/18
1/12=1/30+1/20
1/12=1/28+1/21
1/12=1/24+1/24
代码:
#include
int main()
{
int n,k,i;
scanf("%d",&n);
while(n--)
{
scanf("%d",&k);
for(i=k+1;i<=2*k;++i)
{
if(k*i%(i-k)==0)
printf("1/%d=1/%d+1/%d\n",k,k*i/(i-k),i);
}
}
return 0;
}
<script type="text/java script">
-
<script type="text/java script">BAIDU_CLB_fillSlot("771048");
-
点击复制链接 与好友分享!
回本站首页
<script>
function copyToClipBoard(){
var clipBoardContent=document.title + '\r\n' + document.location;
clipBoardContent+='\r\n';
window.clipboardData.setData("Text",clipBoardContent);
alert("恭喜您!复制成功");
}
<script>window._bd_share_config={"common":{"bdSnsKey":{},"bdText":"","bdMini":"2","bdMiniList":false,"bdPic":"","bdStyle":"0","bdSize":"24"},"share":{}};with(document)0[(getElementsByTagName('head')[0]||body).appendChild(createElement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new Date()/36e5)];
-
您对本文章有什么意见或着疑问吗?请到
论坛讨论您的关注和建议是我们前行的参考和动力??
-
上一篇:
NYOJ-小明的调查作业
-
下一篇:
ZOJ 3798 Abs Problem
-
相关文章
-
<script type="text/java script">BAIDU_CLB_fillSlot("182716");
-
<script type="text/java script">BAIDU_CLB_fillSlot("517916");
-
图文推荐
<script>
(function(){
var appid = 'cyrBEfE7C',
conf = 'prod_830794cf494da8b808afb2994cfe0fee';
var doc = document,
s = doc.createElement('script'),
h = doc.getElementsByTagName('head')[0] || doc.head || doc.documentElement;
s.type = 'text/java script';
s.charset = 'utf-8';
s.src = 'http://assets.changyan.sohu.com/upload/changyan.js?conf='+ conf +'&appid=' + appid;
h.insertBefore(s,h.firstChild);
window.SCS_NO_IFRAME = true;
})()
-
<script type="text/java script">BAIDU_CLB_fillSlot("771057");
|