标签:难度 panel 表示 tar ext i++ icon hid ble
一个数N(1 <= N <= 10^9)
共K行:每行2个数,i j,表示N = i^2 + j^2(0 <= i <= j)。
如果无法分解为2个数的平方和,则输出No Solution
130
3 11
7 9
题解:水题
1 #include <iostream> 2 #include <cmath> 3 using namespace std; 4 int n; 5 int main() 6 { 7 cin>>n; 8 int j=(int)sqrt(double(n))+1; 9 int i=0; 10 int flag=0; 11 while(i<=j) 12 { 13 if(i*i+j*j>n) 14 j--; 15 else if(i*i+j*j<n) 16 i++; 17 else if(i*i+j*j==n) 18 { 19 flag=1; 20 cout<<i<<" "<<j<<endl; 21 i++; 22 j--; 23 } 24 25 } 26 if(!flag) 27 cout<<"No Solution"<<endl; 28 return 0; 29 }
标签:难度 panel 表示 tar ext i++ icon hid ble
原文地址:http://www.cnblogs.com/onlyli/p/7252545.html