HDU 4143 A Simple Problem (枚举暴力)
2014-03-27 13:16
309 查看
(y-x)(y+x)=n;
设k1=y-x k2=y+x
则 1 K2>K1
2 y=(k1+k2)/2 x=(k2-k1)/2
即 (k1+k2)%2==0 (k2-k1)%2==0;
设k1=y-x k2=y+x
则 1 K2>K1
2 y=(k1+k2)/2 x=(k2-k1)/2
即 (k1+k2)%2==0 (k2-k1)%2==0;
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main() { int t,n; cin>>t; while(t--) { cin>>n; int ans=-1,k1,k2; for(int i=sqrt((double)n);i>=1;i--) { if(n%i==0) { k1=i; k2=n/i; if(k1!=k2&&(k1+k2)%2==0&&(k2-k1)%2==0){ ans=(k2-k1)/2; break; } } } printf("%d\n",ans); } return 0; }
相关文章推荐
- HDU 4143 A Simple Problem(枚举)
- HDU 4143 A Simple Problem
- HDU_4978_A simple probability problem.(推导or精度枚举)
- HDU 3699 A hard Aoshu Problem(暴力枚举)(2010 Asia Fuzhou Regional Contest)
- hdu 4143 A Simple Problem
- HDU 4143 A Simple Problem(数论-水题)
- hdu 4143 A Simple Problem(数学)
- HDU-4143 A Simple Problem
- HDU 4143 A Simple Problem(数论-水题)
- HDU 4143 A Simple Problem
- hdu 4143 A Simple Problem
- HDU 4143 A Simple Problem
- HDU 4143 A Simple Problem
- HDU 4143 A Simple Problem
- hdu 4968(暴力枚举)
- hdu 4968 Improving the GPA(暴力枚举)
- HDU 1598 find the most comfortable road 【暴力枚举 + 并查集】
- HDU 4974 A simple water problem 模拟(水
- HDU 4973 A simple simulation problem. 线段树
- hdu 1757 A Simple Math Problem(矩阵优化DP)