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:
Replicating Processes
ELCA
Sieve of Eratosthenes Having Linear Time Complexity
Long Beautiful Integer
Closest Equals
Deleting from a data structure in $O(T(n)\log n)$
Make It One
Little Artem
Bonus Distribution
Fenwick Tree
Array Shrinking
Weird Game
Wrong Answer on Test 233 (Hard Version)
Finding the Eulerian path in $O(M)$
Kuroni and Impossible Calculation
Om Nom and Necklace
Hilbert's Hotel
Mysterious Crime
Cow and Snacks
Bear and Two Paths
Two Teams Composing
Palindrome
A Game on Strings
Rock Is Push
Oriented area of a triangle
Elections
The Inclusion-Exclusion Principle
Unsolvable
Helga Hufflepuff's Cup
Another One Bites The Dust
NEKO's Maze Game
Bingo!