CF987B High School: Become Human 数学-CFANZ编程社区

题意翻译

题目大意

输入一个 CF987B High School: Become Human 数学_#define

输入输出格式

输入格式

一行，两个整数 CF987B High School: Become Human 数学_#define_02

输出格式

若 CF987B High School: Become Human 数学_#define_03

感谢@二元长天笑提供的翻译

题目描述

Year 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids have to go to school to be able to solve creative tasks. Just like humans before.

It turns out that high school struggles are not gone. If someone is not like others, he is bullied. Vasya-8800 is an economy-class android which is produced by a little-known company. His design is not perfect, his characteristics also could be better. So he is bullied by other androids.

One of the popular pranks on Vasya is to force him to compare CF987B High School: Become Human 数学_#define_04

Please help Vasya! Write a fast program to compare CF987B High School: Become Human 数学_#include_05

输入输出格式

输入格式：

On the only line of input there are two integers CF987B High School: Become Human 数学_android_06

输出格式：

If CF987B High School: Become Human 数学_#define_07

输入输出样例

输入样例#1：

复制

5 8

输出样例#1： 复制

输入样例#2： 复制

10 3

输出样例#2： 复制

输入样例#3： 复制

6 6

输出样例#3： 复制

说明

In the first example CF987B High School: Become Human 数学_#include_08

In the second example CF987B High School: Become Human 数学_#define_09

In the third example CF987B High School: Become Human 数学_#define_10

$注意用 long double；$

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
//#include
//#pragma GCC optimize(2)
using namespace std;
#define maxn 900005
#define inf 0x7fffffff
//#define INF 1e18
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
typedef long long  ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const long long int mod = 1e9 + 7;
#define Mod 1000000000
#define sq(x) (x)*(x)
#define eps 1e-4
typedef pair pii;
#define pi acos(-1.0)
//const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef pair pii;
inline ll rd() {
    ll x = 0;
    char c = getchar();
    bool f = false;
    while (!isdigit(c)) {
        if (c == '-') f = true;
        c = getchar();
    }
    while (isdigit(c)) {
        x = (x << 1) + (x << 3) + (c ^ 48);
        c = getchar();
    }
    return f ? -x : x;
}

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a%b);
}
int sqr(int x) { return x * x; }


/*ll ans;
ll exgcd(ll a, ll b, ll &x, ll &y) {
    if (!b) {
        x = 1; y = 0; return a;
    }
    ans = exgcd(b, a%b, x, y);
    ll t = x; x = y; y = t - a / b * y;
    return ans;
}
*/

int x, y;
long double ans1, ans2;

int main() {
    //ios::sync_with_stdio(0);
    cin >> x >> y;
    ans1 = (long double)y*log(x)*1.0;
    ans2 = (long double)x*log(y)*1.0;
    if (ans1 > ans2)cout << ">" << endl;
    else if (ans2 > ans1)cout << "<" << endl;
    else if (fabs(ans1 - ans2) <= eps)cout << "=" << endl;
    return 0;
}

EPFL - Fighting