BOJ algorithm study with C++

This repo with my answer codes written in C++ Since 2022 summer

may have some typo with question number

Code

the code below here is just template for me because writing int main again and again is sucks.

#include <iostream>
#include <string>
// https://www.acmicpc.net/problem/...

using namespace std;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);

    return 0;

}

P.S. 늦었다고 생각할 때가 가장 빠른게 아닐까...?