oj.uz

Submission #138285

# Submission time Handle Problem Language Result Execution time Memory
138285 2019-07-29T16:48:53 Z mariadinca COCI17_cezar (COCI17_cezar) C++14
50 / 50
 2 ms 396 KB 
#include <iostream>

using namespace std;

int n, i, f[14], s, a, nrmic, nrmare, x;

int main(){
    for(i=2;i<=9;i++)
        f[i] = 4;
    f[10] = 12;
    f[11] = 4;
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a;
        f[a]--;
        s += a;
    }
    if(s > 21){
        cout<<"DOSTA";
        return 0;
    }
    x = 21 - s;
    for(i=2;i<=11;i++)
        if(i<=x)
            nrmic+=f[i];
        else
            nrmare+=f[i];
    if(nrmare < nrmic)
        cout<<"VUCI";
    else
        cout<<"DOSTA";
    return 0;
}
/// Everybody knows that you don’t draw a card if the number of the remaining cards
/// in the deck whose value is greater than X is greater than or equal to the number of the
/// remaining cards in the deck whose value is less than or equal to X.

/// nu mai tragi alta carte daca numarul de carti ramase in pachet cu valoarea mai mare decat x
/// e mai mare sau egal cu numarul de carti ramase in pachet cu valoarea mai mica decat x,
/// x fiind diferenta dintre 21 si cat ai deja in mana

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 396 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct