QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#96677#5490. Smallest Calculated Valuemonkedluffy#AC ✓2ms3420kbC++231.1kb2023-04-15 01:43:122023-04-15 01:43:16

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-15 01:43:16]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3420kb
  • [2023-04-15 01:43:12]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define ll long long

void solve(){
    ll a, b, c;
    cin >> a >> b >> c;

    vector<ll> v;
    v.push_back(a + b + c);
    v.push_back(a + b - c);
    v.push_back((a + b) * c);
    if((a + b)%c == 0) v.push_back((a + b) / c);

    v.push_back(a - b - c);
    v.push_back(a - b + c);
    v.push_back((a - b) * c);
    if(abs(a-b)%c == 0) v.push_back((a - b) / c);

    v.push_back((a * b) + c);
    v.push_back((a * b) - c);
    v.push_back(a * b * c);
    if((a*b)%c == 0) v.push_back((a * b) / c);

    if(a%b == 0) v.push_back((a / b) + c);
    if(a%b == 0) v.push_back((a / b) - c);
    if(a%b == 0) v.push_back((a / b) * c);
    if(a%b == 0 && (a/b)%c == 0) v.push_back((a / b) / c);
    
    sort(v.begin(), v.end());

    for(ll i = 0; i < (ll)v.size(); i++){
        if(v[i] >= 0){
            cout << v[i];
            break;
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    //cin >> t;
    while(t--){
        cout << fixed << setprecision(15);
        solve();
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3408kb

input:

2 3 5

output:

0

result:

ok single line: '0'

Test #2:

score: 0
Accepted
time: 1ms
memory: 3276kb

input:

9 9 9

output:

0

result:

ok single line: '0'

Test #3:

score: 0
Accepted
time: 2ms
memory: 3344kb

input:

5 7 3

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 2ms
memory: 3416kb

input:

406 21 18

output:

367

result:

ok single line: '367'

Test #5:

score: 0
Accepted
time: 2ms
memory: 3368kb

input:

250 750 1000

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3368kb

input:

774 261 747

output:

288

result:

ok single line: '288'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3320kb

input:

893 407 5

output:

260

result:

ok single line: '260'

Test #8:

score: 0
Accepted
time: 1ms
memory: 3336kb

input:

949 949 595

output:

0

result:

ok single line: '0'

Test #9:

score: 0
Accepted
time: 2ms
memory: 3420kb

input:

52 10 474

output:

46

result:

ok single line: '46'

Test #10:

score: 0
Accepted
time: 2ms
memory: 3292kb

input:

730 10 913

output:

986

result:

ok single line: '986'

Test #11:

score: 0
Accepted
time: 2ms
memory: 3420kb

input:

700 40 250

output:

112

result:

ok single line: '112'

Test #12:

score: 0
Accepted
time: 2ms
memory: 3372kb

input:

808 360 28

output:

16

result:

ok single line: '16'

Test #13:

score: 0
Accepted
time: 2ms
memory: 3340kb

input:

936 2 31

output:

437

result:

ok single line: '437'

Test #14:

score: 0
Accepted
time: 2ms
memory: 3316kb

input:

900 3 5

output:

60

result:

ok single line: '60'

Test #15:

score: 0
Accepted
time: 2ms
memory: 3328kb

input:

1 1 1

output:

0

result:

ok single line: '0'

Test #16:

score: 0
Accepted
time: 2ms
memory: 3328kb

input:

1000 1 1

output:

998

result:

ok single line: '998'

Test #17:

score: 0
Accepted
time: 2ms
memory: 3336kb

input:

1 1000 1

output:

999

result:

ok single line: '999'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3384kb

input:

1000 1000 1

output:

0

result:

ok single line: '0'

Test #19:

score: 0
Accepted
time: 2ms
memory: 3416kb

input:

1 1 1000

output:

0

result:

ok single line: '0'

Test #20:

score: 0
Accepted
time: 2ms
memory: 3404kb

input:

1000 1 1000

output:

0

result:

ok single line: '0'

Test #21:

score: 0
Accepted
time: 2ms
memory: 3292kb

input:

1 1000 1000

output:

0

result:

ok single line: '0'

Test #22:

score: 0
Accepted
time: 2ms
memory: 3284kb

input:

1000 1000 1000

output:

0

result:

ok single line: '0'

Test #23:

score: 0
Accepted
time: 2ms
memory: 3292kb

input:

497 773 206

output:

1064

result:

ok single line: '1064'

Test #24:

score: 0
Accepted
time: 0ms
memory: 3408kb

input:

592 446 188

output:

334

result:

ok single line: '334'

Test #25:

score: 0
Accepted
time: 2ms
memory: 3388kb

input:

935 401 173

output:

361

result:

ok single line: '361'

Test #26:

score: 0
Accepted
time: 2ms
memory: 3400kb

input:

326 747 928

output:

145

result:

ok single line: '145'

Test #27:

score: 0
Accepted
time: 0ms
memory: 3320kb

input:

129 905 221

output:

813

result:

ok single line: '813'

Test #28:

score: 0
Accepted
time: 0ms
memory: 3344kb

input:

522 227 296

output:

453

result:

ok single line: '453'

Test #29:

score: 0
Accepted
time: 2ms
memory: 3328kb

input:

447 699 94

output:

1052

result:

ok single line: '1052'

Test #30:

score: 0
Accepted
time: 0ms
memory: 3420kb

input:

903 846 435

output:

492

result:

ok single line: '492'

Test #31:

score: 0
Accepted
time: 0ms
memory: 3340kb

input:

526 651 138

output:

13

result:

ok single line: '13'

Test #32:

score: 0
Accepted
time: 2ms
memory: 3396kb

input:

387 317 879

output:

949

result:

ok single line: '949'

Test #33:

score: 0
Accepted
time: 2ms
memory: 3368kb

input:

1000 20 6

output:

44

result:

ok single line: '44'

Test #34:

score: 0
Accepted
time: 2ms
memory: 3336kb

input:

1000 11 10

output:

979

result:

ok single line: '979'