题目链接

https://www.patest.cn/contests/gplt/L1-037

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;

typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

int main()
{
    int a, b;
    cin >> a >> b;
    printf("%d/", a);
    if (b < 0)
        printf("(%d)=", b);
    else 
        printf("%d=", b);
    if (b == 0)
        printf("Error\n");
    else
        printf("%.2lf\n", a * 1.0 / b);
}

相关文章:

  • 2022-01-27
  • 2021-12-09
  • 2022-01-31
  • 2021-11-03
  • 2021-05-31
  • 2021-06-09
猜你喜欢
  • 2021-10-23
  • 2021-12-24
  • 2021-08-15
  • 2021-06-29
  • 2022-02-25
相关资源
相似解决方案