Submission #3679145


Source Code Expand

#include<iostream>
using namespace std;

typedef long long ll;

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

int main(){
    ll x, y;
    scanf("%lld/%lld", &x, &y);

    ll g = gcd(x, y);
    x /= g, y /= g;

    ll k = (4*x-2*y)/y/y;
    if(k*k*y*y+2*k*y-4*k*x < 0) k++;

    bool imp = true;
    for(;k*k*y*y-2*k*y-4*k*x <= 0;k++){
        if( (k*y)%2 == 0 && (k*k*y*y+2*k*y-4*k*x)%8 == 0 ){
            ll n = (k*y)/2, m = (k*k*y*y+2*k*y-4*k*x)/8;
            if(n == 0 || m == 0)    continue;
            imp = false;
            cout << n << " " << m << endl;
        }
    }

    if(imp) cout << "Impossible" << endl;
    
    return 0;
}

Submission Info

Submission Time
Task C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User face4
Language C++14 (GCC 5.4.1)
Score 100
Code Size 692 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld/%lld", &x, &y);
                               ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 60
Set Name Test Cases
All 00_killer.txt, 00_max.txt, 00_min.txt, 00_min2.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 03_smallrnd_00.txt, 03_smallrnd_01.txt, 03_smallrnd_02.txt, 03_smallrnd_03.txt, 03_smallrnd_04.txt, 03_smallrnd_05.txt, 03_smallrnd_06.txt, 03_smallrnd_07.txt, 03_smallrnd_08.txt, 03_smallrnd_09.txt, 04_primes_01.txt, 04_primes_02.txt
Case Name Status Exec Time Memory
00_killer.txt AC 1 ms 256 KB
00_max.txt AC 1 ms 256 KB
00_min.txt AC 1 ms 256 KB
00_min2.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt AC 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt AC 1 ms 256 KB
01_rnd_09.txt AC 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt AC 1 ms 256 KB
01_rnd_13.txt AC 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt AC 1 ms 256 KB
01_rnd_16.txt AC 1 ms 256 KB
01_rnd_17.txt AC 1 ms 256 KB
01_rnd_18.txt AC 1 ms 256 KB
01_rnd_19.txt AC 1 ms 256 KB
02_rnd2_00.txt AC 1 ms 256 KB
02_rnd2_01.txt AC 1 ms 256 KB
02_rnd2_02.txt AC 1 ms 256 KB
02_rnd2_03.txt AC 1 ms 256 KB
02_rnd2_04.txt AC 1 ms 256 KB
02_rnd2_05.txt AC 1 ms 256 KB
02_rnd2_06.txt AC 1 ms 256 KB
02_rnd2_07.txt AC 1 ms 256 KB
02_rnd2_08.txt AC 1 ms 256 KB
02_rnd2_09.txt AC 1 ms 256 KB
02_rnd2_10.txt AC 1 ms 256 KB
02_rnd2_11.txt AC 1 ms 256 KB
02_rnd2_12.txt AC 1 ms 256 KB
02_rnd2_13.txt AC 1 ms 256 KB
02_rnd2_14.txt AC 1 ms 256 KB
02_rnd2_15.txt AC 1 ms 256 KB
02_rnd2_16.txt AC 1 ms 256 KB
02_rnd2_17.txt AC 1 ms 256 KB
02_rnd2_18.txt AC 1 ms 256 KB
02_rnd2_19.txt AC 1 ms 256 KB
03_smallrnd_00.txt AC 1 ms 256 KB
03_smallrnd_01.txt AC 1 ms 256 KB
03_smallrnd_02.txt AC 1 ms 256 KB
03_smallrnd_03.txt AC 1 ms 256 KB
03_smallrnd_04.txt AC 1 ms 256 KB
03_smallrnd_05.txt AC 1 ms 256 KB
03_smallrnd_06.txt AC 1 ms 256 KB
03_smallrnd_07.txt AC 1 ms 256 KB
03_smallrnd_08.txt AC 1 ms 256 KB
03_smallrnd_09.txt AC 1 ms 256 KB
04_primes_01.txt AC 1 ms 256 KB
04_primes_02.txt AC 1 ms 256 KB