Submission #869771

#TimeUsernameProblemLanguageResultExecution timeMemory
869771ElenaBMGo (COCI16_go)C++17
50 / 50
1 ms360 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, totans = 0; cin>> n; vector<string>name(n); vector<int>ev(n), tot (n); pair<string, int> ans({"a", 0}); for (int i = 0; i <n; ++i) cin>> name[i] >> ev[i] >> tot[i]; for (int i = 0; i <n; ++i){ int act = 0; //veces que se puede evolucionar en este caso while (tot[i] >= ev[i]){ //dividir el total por las chuches necesarias para evolcionar, sumar 2*cociente al resto int coc = tot[i]/ev[i]; int res = tot[i] - coc*ev[i]; act += coc; tot[i] = res + 2*coc; } if (act > ans.second){ ans.first = name[i]; ans.second = act; } totans += act; } cout<< totans<< '\n'; cout<< ans.first << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...