사용자 랭킹
| 랭킹 | 사용자 | 한마디 | 푼 문제↓ | 출제 | 답안 수 | 정답 비율 |
|---|---|---|---|---|---|---|
| 3524 | zzajangm | 12 | 0 | 49 | 13 (26%) | |
| 3822 | ac9831 | 11 | 0 | 20 | 11 (55%) | |
| 3822 | sth789 | 11 | 0 | 78 | 22 (28%) | |
| 3822 | yoonsun01091393901 | 11 | 0 | 50 | 12 (24%) | |
| 3822 | mjg11880 | 11 | 0 | 45 | 18 (40%) | |
| 3822 | hdseo | 11 | 0 | 92 | 26 (28%) | |
| 3822 | funkydj1 | 11 | 0 | 49 | 12 (24%) | |
| 3822 | shjohw12 | https://www.acmicpc.net/user/shjohw12 | 11 | 0 | 20 | 14 (70%) |
| 3822 | dsnight | 11 | 0 | 63 | 15 (23%) | |
| 3822 | InHongHan | 11 | 5 | 59 | 16 (27%) | |
| 3822 | Repil | 11 | 0 | 25 | 11 (44%) | |
| 3822 | bean0809 | 11 | 0 | 20 | 11 (55%) | |
| 3822 | kkk1234 | 11 | 0 | 39 | 21 (53%) | |
| 3822 | hdlee27 | 11 | 0 | 16 | 11 (68%) | |
| 3822 | soso0265 | 11 | 0 | 34 | 12 (35%) | |
| 3822 | 이상국 | 11 | 0 | 27 | 14 (51%) | |
| 3822 | 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%) |
| 3822 | pluruel | 11 | 0 | 62 | 13 (20%) | |
| 3822 | newenws | 11 | 0 | 23 | 13 (56%) | |
| 3822 | HTKIM | 11 | 0 | 24 | 11 (45%) |