日韩av黄I国产麻豆传媒I国产91av视频在线观看I日韩一区二区三区在线看I美女国产在线I麻豆视频国产在线观看I成人黄色短片

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 >

A Simple Math Problem HDU - 5974

發布時間:2025/4/16 35 豆豆
生活随笔 收集整理的這篇文章主要介紹了 A Simple Math Problem HDU - 5974 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
Given two positive integers a and b,find suitable X and Y to meet the conditions:X+Y=aLeast Common Multiple (X, Y) =b
Input
Input includes multiple sets of test data.Each test data occupies one line,including two positive integers a(1≤a≤2*10^4),b(1≤b≤10^9),and their meanings are shown in the description.Contains most of the 12W test cases.
Output
For each set of input data,output a line of two integers,representing X, Y.If you cannot find such X and Y,output one line of "No Solution"(without quotation).
Sample Input
6 8 798 10780

Sample Output

No Solution
308 490

輸入兩個整數a,b,知否可以找到兩個整數x,y.使其滿足x+y=a,lcm(x,y)=b 如果找不到輸出No Solution 否則輸出x y(x<=y)

gcd(x,y)=gcd(a,b);

可以記住一個結論:a和b兩個數,可以分解成x,y使得x+y=a,x和y的最小公倍數是b,(lcm(x,y)=b, 那么有gcd(a,b)=gcd(x,y);

#include <iostream> #include <math.h> using namespace std; int gcd(int x,int y) {if(y==0)return x;elsereturn gcd(y,x%y); } int main() {int a,b,temp,k,d;while(cin>>a>>b){temp=gcd(a,b);b*=temp;k=a*a-4*b;d=sqrt(k);if(k<0||d*d!=k||(a+d)%2!=0){cout<<"No Solution"<<endl;continue;}d=(a+d)/2;k=a-d;if(d<=k)cout<<d<<' '<<k<<endl;elsecout<<k<<' '<<d<<endl;}return 0; }

總結

以上是生活随笔為你收集整理的A Simple Math Problem HDU - 5974的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。