题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2552
解题思路:
完全数学公式推导:
tan(a + b) = (tan(a) + tan(b)) / (1 - tan(a) * tan(b)) ;
tan( atan(x) ) = x;
tan(atan(1/s)) = tan( atan(1/u) + atan(1/ v));
1/s = tan( atan(1 / u) + atan(1 / v) ) = (1 / u + 1/ v ) / (1 - 1/u * 1/ v) ;
u * v = s * u + s * v + 1;
f = u * v - s * u - s * v = 1。
所以最后只要输出1即可。
完整代码:
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;
/** Constant List .. **/ //{
const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;
int main()
{
#ifdef DoubleQ
freopen("in.txt","r",stdin);
#endif
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int T;
cin >> T;
while(T--)
{
int s , u;
cin >> s >> u;
cout << "1" << endl;
}
}