Submission #152945

# Submission time Handle Problem Language Result Execution time Memory
152945 2019-09-10T16:01:13 Z ionanghelina COCI17_cezar (COCI17_cezar) C++14
45 / 50
2 ms 380 KB
#include<bits/stdc++.h>
using namespace std;

int n,f[20],lft,sum,x,good;

int main()
{
    scanf("%d",&n);

    for(int i=1;i<=9;i++)
        f[i]=4;
    f[10]=16;
    f[11]=4;
    lft=52;

    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        lft--;
        sum+=x;
        f[x]--;
    }

    int diff=21-sum;

    //cerr<<diff<<'\n';
    for(int i=1;i<=diff;i++)
        good+=f[i];

    if(good>=(lft-good)) printf("VUCI\n");
        else printf("DOSTA\n");


    return 0;
}

Compilation message

cezar.cpp: In function 'int main()':
cezar.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
cezar.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
         ~~~~~^~~~~~~~~
# 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 380 KB Output is correct
# 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 252 KB Output is correct
# 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
# 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
# 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 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
# 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
# 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
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 256 KB Output is correct