oj.uz

답안 #473922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473922 2021-09-16T12:05:31 Z SaraMostafa Euklid (COCI20_euklid) C++14
35 / 110
 1000 ms 312 KB 
#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=1e9+7;
const double PI=acos(-1);
// 1 2 3 --> 1,2,3 ...1,2..1,3..1..2,3..2..3..none (2 power number of elements)
//1 2 3 --> 2--> 1,2..1,3..2,3..(!n/(r!(n-r)!)) aka:ncr
// 1 2 3 -->2-->1,2..2,1..1,3..3,1..2,3..3,2..(n!/(n-r)!) aka:npr
//1 2 3--> 1..1,2..1,2,3..2..2,3..3  number of subarrays -->(n*(n+1))/2 "sum of numbers from 1 to n."
/*
ll power(ll x,ll y)
{
    if(y==0)
        return 1;
    else if(y==1)
        return x%mod;
    ll  r=power(x%mod,((y%mod)/2)%mod);
    if(y%2==0)
        return ((r%mod)*(r%mod));
    else
        return ((r%mod)*(r%mod)*(x%mod));
}

ll inverse(ll md,ll x)
{
    return power(x%mod,mod-2);
}

*/
ll r(ll a,ll b)
{
    while(a>1 && b>1)
    {
        if(a<b)
            swap(a,b);
        a/=b;

    }
    if(a==1)
        return b;
    else
        return a;
}
int main()
{
    //freopen("input.in","r",stdin);

    Sara
    int t;
    cin>>t;
    while(t--)
    {
        ll h,g;
        cin>>g>>h;
        ll ans1=-1,ans2=-1;
        for(int i=1; i<=10000; i++)
        {
            ll a=g*i;
            for(int j=i; j<=10000; j++)
            {
                ll b=g*j;
                if(__gcd(a,b)==g && r(a,b)==h)
                {
                    ans1=a;
                    ans2=b;
                    break;
                }
            }
            if(ans1!=-1)
                break;
        }
        cout<<ans1<<' '<<ans2<<endl;
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 204 KB Output is correct
2 Correct 45 ms 288 KB Output is correct
3 Correct 24 ms 304 KB Output is correct
4 Correct 18 ms 312 KB Output is correct
5 Correct 13 ms 312 KB Output is correct
6 Correct 12 ms 304 KB Output is correct
7 Correct 11 ms 308 KB Output is correct
8 Correct 11 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 11 ms 204 KB Output is correct

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 204 KB Output is correct
2 Correct 45 ms 288 KB Output is correct
3 Correct 24 ms 304 KB Output is correct
4 Correct 18 ms 312 KB Output is correct
5 Correct 13 ms 312 KB Output is correct
6 Correct 12 ms 304 KB Output is correct
7 Correct 11 ms 308 KB Output is correct
8 Correct 11 ms 204 KB Output is correct
9 Correct 10 ms 204 KB Output is correct
10 Correct 11 ms 204 KB Output is correct
11 Correct 16 ms 204 KB Output is correct
12 Execution timed out 1082 ms 204 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 45 ms 204 KB Output is correct
24 Correct 45 ms 288 KB Output is correct
25 Correct 24 ms 304 KB Output is correct
26 Correct 18 ms 312 KB Output is correct
27 Correct 13 ms 312 KB Output is correct
28 Correct 12 ms 304 KB Output is correct
29 Correct 11 ms 308 KB Output is correct
30 Correct 11 ms 204 KB Output is correct
31 Correct 10 ms 204 KB Output is correct
32 Correct 11 ms 204 KB Output is correct
33 Correct 16 ms 204 KB Output is correct
34 Execution timed out 1082 ms 204 KB Time limit exceeded
35 Halted 0 ms 0 KB -