사용자 랭킹
| 랭킹 | 사용자 | 한마디 | 푼 문제 | 출제↓ | 답안 수 | 정답 비율 |
|---|---|---|---|---|---|---|
| 21746 | jiwan214 | 0 | 0 | 3 | 0 (0%) | |
| 9264 | kjkpoi | 3 | 0 | 13 | 3 (23%) | |
| 6156 | choi101104 | 6 | 0 | 15 | 6 (40%) | |
| 14621 | Keiren | 1 | 0 | 6 | 1 (16%) | |
| 3738 | kilo32 | 11 | 0 | 44 | 12 (27%) | |
| 177 | xesmaster | 77 | 0 | 308 | 124 (40%) | |
| 496 | Apple_Cplus | 48 | 0 | 181 | 61 (33%) | |
| 21746 | speedwall | 0 | 0 | 5 | 0 (0%) | |
| 3738 | includex | //CONCERT #include <stdio.h> #include <string.h> #include <vector> using namespace std; int getLastV(vector<int>& vlist, int _nVMax, int _nV, int _Vpos){ int nP = _nV + vlist[_Vpos]; int nM = _nV - vlist[_Vpos]; if(nP <= _nVMax){ if(vlist.size() > _Vpos + 1){ nP = getLastV(vlist, _nVMax, nP, _Vpos + 1); } }else{ nP = -1; } if(nM >= 0){ if(vlist.size() > _Vpos + 1){ nM = getLastV(vlist, _nVMax, nM, _Vpos + 1); } }else{ nM = -1; } if(nP > nM){ return nP; }else{ return nM; } return -1; } int main(){ char dumy[64]; int nCase = 0; scanf("%d", &nCase); gets(dumy); for(int i = 0; i < nCase; i++){ unsigned int nVCount = 0; unsigned int nVStart = 0; unsigned int nVMax = 0; scanf("%d %d %d", &nVCount, &nVStart, &nVMax); gets(dumy); vector<int> vlist; unsigned int nV = 0; for(int iV = 0; iV < nVCount; iV++){ scanf("%d", &nV); vlist.push_back(nV); } gets(dumy); printf("%d\n", getLastV(vlist, nVMax, nVStart, 0)); } return 0; } | 11 | 0 | 41 | 12 (29%) |
| 11166 | gargamel | 2 | 0 | 4 | 3 (75%) | |
| 8002 | gargamel99 | 4 | 0 | 36 | 6 (16%) | |
| 21746 | MrSon | 0 | 0 | 1 | 0 (0%) | |
| 239 | nonblock | 69 | 0 | 134 | 83 (61%) | |
| 1229 | tail41 | 28 | 0 | 52 | 31 (59%) | |
| 529 | Alinfty | 46 | 0 | 172 | 60 (34%) | |
| 21746 | susin1125 | 0 | 0 | 1 | 0 (0%) | |
| 8002 | makesource | 4 | 0 | 21 | 4 (19%) | |
| 21746 | comicos | 0 | 0 | 30 | 0 (0%) | |
| 8002 | besth | 4 | 0 | 42 | 4 (9%) | |
| 9264 | bdh92 | 3 | 0 | 17 | 3 (17%) |