
Input
The input contains a single floating-point number x with exactly 6 decimal places (0 < x < 5).
Output
Output two integers separated by a single space. Each integer should be between 1 and 10, inclusive. If several solutions exist, output any of them. Solution will exist for all tests.
Examples
input
1.200000
output
3 2
input
2.572479
output
10 3
input
4.024922
output
9 9
Solution:
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
int main() {
double x;
scanf("%lf", &x);
double diff = 12345;
int da = -1, db = -1;
for (int a = 1; a <= 10; a++)
for (int b = 1; b <= 10; b++) {
double u = (a * b) / sqrt(4 * a * a + b * b);
u = fabs(u - x);
if (u < diff) {
diff = u;
da = b;
db = a;
}
}
printf("%d %d\n", da, db);
return 0;
}
Related posts:
Third Month Insanity
A Trivial Problem
New Year Transportation
Huffman Coding on Segment
New Year and Forgotten Tree
Finding common tangents to two circles
Nikita and stack
Processing Queries
Om Nom and Necklace
Floyd-Warshall - finding all shortest paths
Kuroni and Simple Strings
Sherlock and his girlfriend
Cards
Kuhn's Algorithm for Maximum Bipartite Matching
Let's Play Osu!
Dima and Game
New Year and Conference
Banners
Maximum Distance
Dima and Figure
Make Good
Read Time
Hidden Bipartite Graph
Game with Powers
New Year and the Acquaintance Estimation
Bash Plays with Functions
K-Complete Word
Petr and Permutations
Pick's Theorem - area of lattice polygons
Dreamoon Likes Strings
Businessmen Problems
Train Hard, Win Easy