150172025-02-11 10:43:57ercseferencA sárkány feladványa (50)cpp17Wrong answer 0/501ms388 KiB
#include <bits/stdc++.h>
long long lkkt(int a, int b){
    int m=a,n=b,c=a%b;
    while(c!=0){m=n; n=c; c=m%n;}
    return a*b/n;}
int szj(long long n){
    int s=0;
    while(n!=0){s++; n=n/10;}
    return s;}
using namespace std;
int main()
{
    int a,b,n; cin>>a>>b>>n;
    int S=szj(lkkt(a,b));
    if(S>n)cout<<-1;
    else{cout<<lkkt(a,b);
        for(int i=0; i<n-S; i++){cout<<0;}}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/31ms328 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms388 KiB
13Wrong answer0/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Wrong answer0/41ms316 KiB
16Wrong answer0/41ms316 KiB
17Wrong answer0/41ms316 KiB