147382025-01-31 10:12:09antiA sárkány feladványa (50)cpp17Wrong answer 30/501ms548 KiB
#include <iostream>
#include <cmath>

using namespace std;

int main()
{
    long long int meg[3];
    for(int i=0; i<3; i++){
        int a, b, n;
        cin >> a >> b >> n;
        long long int Min = pow(10, n-1), Max = pow(10, n) - 1;
        long long int A = Min/a*a;
        long long int B = Min/b*b;
        if(A != Min)
            A+=a;
        if(B != Min)
            B+=b;
        bool kesz = false;
        while(kesz == false){
            if(A == B){
                kesz = true;
                meg[i] = A;
            }else if(A < B){
                A+=a;
            }else if(B < A){
                B+=b;
            }
            if(B>Max || A>Max){
                kesz = true;
                meg[i] = -1;
            }
        }
    }
    for(int i=0; i<3; i++){
        cout << meg[i] << endl;
    }
}
SubtaskSumTestVerdictTimeMemory
base30/50
1Wrong answer0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms508 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms352 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Wrong answer0/41ms316 KiB
14Wrong answer0/41ms548 KiB
15Wrong answer0/41ms316 KiB
16Wrong answer0/41ms316 KiB
17Wrong answer0/41ms316 KiB