/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 1ms 532.0 KiB
#4 Wrong Answer 1ms 532.0 KiB
#5 Wrong Answer 1ms 324.0 KiB
#6 Wrong Answer 1ms 532.0 KiB
#7 Wrong Answer 1ms 320.0 KiB
#8 Wrong Answer 1ms 532.0 KiB
#9 Wrong Answer 1ms 496.0 KiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{
    int n;
    while(cin >> n) {
        vector<long double>ans(n+1);
        vector<string>g(n+1);
        for(int i=1;i<=n;i++) {
            long double a,b;
            cin >> a >> b;
            ans[i] = b/a;
            g[i] = to_string((int)b) + " / " + to_string((int)a);
        }


        for(int i=1;i<=n;i++) {
            if(ans[i] == 0.0) {
                cout << "0 / 1" << endl;
            }
            else {
                cout << g[i] << endl;
            }
        }
    }
}
int32_t main()
{   ios::sync_with_stdio(false);

    //TC
    s();


}




Information

Submit By
Type
Submission
Problem
P1001 Achievement-Unlocked
Contest
Beta Round #1
Language
C++17 (G++ 13.2.0)
Submit At
2023-11-29 16:38:40
Judged At
2024-10-03 14:10:57
Judged By
Score
0
Total Time
1ms
Peak Memory
532.0 KiB