oj.uz

Submission #473941

# Submission time Handle Problem Language Result Execution time Memory
473941 2021-09-16T12:37:11 Z AbdoMo Euklid (COCI20_euklid) C++17
4 / 110
 1000 ms 316 KB 
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
    if(a.size()==b.size())
    {
        return a<b;
    }
    return a.size()<b.size();
}
int rcd(int a,int b)
{
    if(a<b)swap(a,b);
    if(a>=b && b>1)
    {
        return rcd(a/b,b);
    }
    if(b == 1)return a;
}
void solve(){
    int g,r;
    cin>>g>>r;
    int a=g,b=r;
    while(a<b && g!=1)
    {
        a+=g;
    }
    if(g == 1)
    {
        cout<<1<<" "<<r<<endl;
        return;
    }
    if(g == r)
    {
        cout<<g<<" "<<r<<endl;
        return;
    }
    if(g*g == r)
    {
        cout<<g<<" "<<r<<endl;
        return;
    }
    for(int i=g;i<=1000000;i++)
    {
        for(int j=r;j<=10000;j++)
        {
            if(__gcd(i,j) == g && rcd(i,j)==r)
            {
               // cout<<"loop1: ";
                cout<<i<<" "<<j<<endl;
                return;
                //goto x;
            }
        }
    }
    /*x:
    for(int j=1;j<=10000000;j++)
    {
        if(__gcd(a,j) == g && rcd(a,j)==r)
        {
            cout<<a<<" "<<j<<endl;
            return;
        }
    }


*/





}
int32_t main(){
	int t=1;
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>t;
	while(t--){solve();}
	return 0;
}

Compilation message

euklid.cpp: In function 'int rcd(int, int)':
euklid.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory 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 216 KB Output is correct
5 Correct 1 ms 316 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Execution timed out 1072 ms 204 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory 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 216 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Execution timed out 1072 ms 204 KB Time limit exceeded
9 Halted 0 ms 0 KB -