oj.uz

답안 #23057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23057 2017-05-02T14:33:50 Z model_code Go (COCI16_go) C++11
50 / 50
 0 ms 2020 KB 
#include <iostream>

using namespace std;
const int MAX_POKEMON = 70;

struct Pokemon{
    string name;
    int candyReq;
    int candyNo;
};

int n;
int maks, maksi;
int totalEvolution;
int evolutionNo[MAX_POKEMON];
Pokemon p[MAX_POKEMON];

int main (void){

    cin >> n;
    for (int i=0;i<n;i++){
        
        cin >> p[i].name;
        cin >> p[i].candyReq >> p[i].candyNo;
        
        while ( p[i].candyNo >= p[i].candyReq ){
            p[i].candyNo -= p[i].candyReq;
            p[i].candyNo += 2;
            evolutionNo[i]++;
            totalEvolution++;
        }

        if ( evolutionNo[i] > maks ){
            maks=evolutionNo[i];
            maksi=i;
        }

    }

    cout << totalEvolution << endl;
    cout << p[maksi].name << endl;

    return 0;

}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 0 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 0 ms 2020 KB Output is correct
8 Correct 0 ms 2020 KB Output is correct
9 Correct 0 ms 2020 KB Output is correct
10 Correct 0 ms 2020 KB Output is correct
11 Correct 0 ms 2020 KB Output is correct
12 Correct 0 ms 2020 KB Output is correct
13 Correct 0 ms 2020 KB Output is correct
14 Correct 0 ms 2020 KB Output is correct
15 Correct 0 ms 2020 KB Output is correct
16 Correct 0 ms 2020 KB Output is correct
17 Correct 0 ms 2020 KB Output is correct
18 Correct 0 ms 2020 KB Output is correct
19 Correct 0 ms 2020 KB Output is correct
20 Correct 0 ms 2020 KB Output is correct
21 Correct 0 ms 2020 KB Output is correct
22 Correct 0 ms 2020 KB Output is correct
23 Correct 0 ms 2020 KB Output is correct
24 Correct 0 ms 2020 KB Output is correct
25 Correct 0 ms 2020 KB Output is correct