Notice
Recent Posts
Recent Comments
Link
목록전체 글 (159)
할껀하고놀자
[알고리즘] C++ split() 하는 초간단한 방법
#include #include #include using namespace std; int main() { char str[] = "00:12:34"; int cnt = 0; char *context = NULL; char *token = strtok_s(str, ":", &context); while (token) { cout
[IT]/알고리즘
2019. 6. 7. 17:04
[SWEA] 7272번 안경이 없어!
#include #include using namespace std; char arr[] = { 'A','D','O','P','Q','R' }; int main() { int n; cin >> n; for (int i = 1; i > n1 >> n2; if (n1.size() != n2.size()) { cout
[IT]/SWEA
2019. 6. 3. 17:33
[SWEA] 6853번 직사각형과 점
#include #include #include #include using namespace std; int main() { int tc; cin >> tc; for (int t = 0; t > x1 >> y1 >> x2 >> y2 >> N; vector v; for (int i = 0; i > x >> y; v.push_back(make_pair(x, y)); } sort(v.begin(), v.end()); int out, line, in; tie(out, line, in) = make_tuple(0, 0, 0); for (int i = 0; i < v.size(); i++) { ..
[IT]/SWEA
2019. 6. 3. 16:55