제출 #500042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500042		kappa	Cezar (COCI17_cezar)	C++14	0 / 50	1 ms	204 KiB

cezar

#include <bits/stdc++.h>

using namespace std;

int n, sum, need, a, b;

map<int,int> create()
{
  map<int,int> m;
  m[1] = 4, m[2] = 4, m[3] = 4, m[4] = 4, m[5] = 4, m[6] = 4, m[7] = 4, m[8] = 4, m[9] = 4, m[10] = 16, m[11] = 4;
  return m;
}

map<int, int> m = create();

int main(){
    cin >> n;

    for (int i = 0; i < n; i++)
    {
        int temp;
        cin >> temp;
        sum += temp;
        m[temp]--;
    }

    need = 21 - sum;

    for (int i = 1; i <= 11; i++)
    {
        if(i <= need){
            a += m[i];
        }
        else{
            b += m[i];
        }
    }

    for (int i = 1; i <= 11; i++)
    {
        cout << "i " << i << " map " << m[i] << "\n"; 
    }

    cout << "a " << a << " b " << b << "\n";

    a > b ? cout << "VUCI" : cout << "DOSTA";
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5