1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55:
do #include do #include do #include do #include using namespace STD; struct StudentAttempt { distância do int; studentName da corda; }; cmpAttempts do bool (StudentAttempt deixado, direita de StudentAttempt) { se (left.distance < right.distance) { do retorno retificar; } mais se (== right.distance de left.distance) { se (left.studentName < right.studentName) { do retorno retificar; } mais falso do retorno; } mais falso do retorno; } bool isDistEqual (StudentAttempt deixado, direita de StudentAttempt) { retornar (== right.distance de left.distance && left.studentName! = right.studentName); } cano principal do int () { throwDist de StudentAttempt [] = { {50, “A”}, {22, “A”}, {16, “B”}, {44, “C”}, {33, “D”}, {34, “E”}, {22, “F”}, {21, “G”}, {49, “A”}, {5, “B”}, {2, “C”}, {22, “A”}, {33, “B”}, {22, “C”}, {22, “D”}, {44, “E”}, }; int len = sizeof) (do throwDist/sizeof (throwDist [0]); dist do vetor (o throwDist, throwDist + len); vetor:: iterator ele = dist.begin (); sorte (dist.begin (), dist.end (), cmpAttempts); para (; ele! = dist.end (); it++) { cout << setw (2) << (*it) .distance << “pés: ” << (*it) .studentName << endl; } ele = adjacent_find (dist.begin (), dist.end (), isDistEqual); }
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: 75: 76: 77: 78: 79: 80: 81: 82: 83: 84: 85: 86: 87: 88: 89: 90: 91: 92: 93: 94: 95: 96: 97:
#include #include #include #include #include #include #include using namespace STD; struct StudentAttempt { distância do int; studentName da corda; }; cmpDist do bool (StudentAttempt deixado, direita de StudentAttempt) { se (== right.distance de left.distance) { do retorno retificar; } retornar falso; } cmpAttempts do bool (StudentAttempt deixado, direita de StudentAttempt) { se (left.distance < right="">& v, StudentAttempt& sa do const, stringstream& ss) { vetor:: const_iterator i = v.begin (); size_t SZ = 0; quando (i! = v.end ()) { se (isDistEqual (*i, sa)) { studentName <>dos ss; ++sz; } ++i; } SZ do retorno; } cano principal do int () { throwDist de StudentAttempt [] = { {50, “A”}, {22, “A”}, {16, “B”}, {44, “C”}, {33, “D”}, {34, “E”}, {22, “F”}, {21, “G”}, {49, “A”}, {5, “B”}, {2, “C”}, {22, “A”}, {33, “B”}, {22, “C”}, {22, “D”}, {44, “E”}, }; o jogo segurou; int len = sizeof) (do throwDist/sizeof (throwDist [0]); dist do vetor (o throwDist, throwDist + len); vetor:: iterator ele = dist.begin (); sorte (dist.begin (), dist.end (), cmpAttempts); //unique (dist.begin (), dist.end (), cmpDist); para (; ele! = dist.end (); it++) { stringstream ss; pares:: iterator, bool> p = handled.insert (it->distance); se (! p.second) continuam; // já segurou se (0 < printAllEqual="">