본문 바로가기

algospot6

Algospot : ENCRYPT Algospot : ENCRYPT https://algospot.com/judge/problem/read/ENCRYPT #include #include using namespace std; int main(void) { int num_cases = 0; cin >> num_cases; for (int n = 0; n < num_cases; ++n) { string str; cin >> str; string left_str, right_str; for (int i = 0; i < str.size(); ++i) { if (i % 2 == 0) left_str += str.at(i); else right_str += str.at(i); } cout 2014. 12. 15.
Algospot : LECTURE https://algospot.com/judge/problem/read/LECTURE #include #include #include #include using namespace std; int main(void) { int num_cases = 0; cin >> num_cases; for (int i = 0; i < num_cases; ++i) { vector vec_string; string in_str, str_result; cin >> in_str; int half_size = in_str.length() / 2; for (int j = 0; j < half_size; ++j) { vec_string.push_back(in_str.substr(j * 2, 2)); } sort(vec_string... 2014. 12. 12.
Algospot : DRAWRECT https://algospot.com/judge/problem/read/DRAWRECT #include using namespace std; int GetDifferent(int a, int b, int c) { return (a == b) ? c : (b == c) ? a : b; } int main() { int num_cases = 0; cin >> num_cases; for (int i = 0; i < num_cases; ++i) { int x[3] = { 0, }; int y[3] = { 0, }; for (int j = 0; j < 3; ++j) { cin >> x[j] >> y[j]; } cout 2014. 12. 11.
Algospot : ENDIANS https://algospot.com/judge/problem/read/ENDIANS #include #include using namespace std; int main() { int num_edian = 0; vector v; cin >> num_edian; for (int i = 0; i < num_edian; ++i) { unsigned int i_temp; cin >> i_temp; v.push_back(i_temp); } for (auto i = v.begin(); i != v.end(); ++i) { unsigned char uc_temp; uc_temp = *((unsigned char*)&(*i) + 3); *((unsigned char*)&(*i) + 3) = *((unsigned ch.. 2014. 12. 11.
Algospot : MERCY https://algospot.com/judge/problem/read/MERCY #include #include using namespace std; int main() { int cases; cin >> cases; if ((0 < cases) && (cases 2014. 12. 11.
Algospot : Hello World! https://algospot.com/judge/problem/read/HELLOWORLD #include #include using namespace std; int main() { int cases; cin >> cases; while (cases--) { string name; cin >> name; cout 2014. 12. 11.