그랬었습니다

123456789101112131415161718#include #include using namespace std; int main() { int N; cin >> N; int* arr = new int[N]; for (int i = 0; i > arr[i]; sort(arr, arr + N); int time = 0; for (int i = 0; i

1234567891011121314151617181920#include using namespace std; int main() { int T, n; cin >> T; int arr[11][3] = { 0, }; arr[1][0] = 1; for (int i = 1; i n; cout

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include bool isFilled(int** arr, int x, int y, int size, int color) { for (int i = 0; i

1234567891011121314151617181920212223242526#include #include #include using namespace std; int main() { cin.tie(NULL); ios::sync_with_stdio(false); unordered_map map; int N, M; cin >> N >> M; for (int i = 0; i > site >> pass; map.insert({ site, pass }); } for (int i = 0; i > site; cout

12345678910111213141516171819202122232425262728293031#include #include #include #include using namespace std; int main() { set n_set; list dup; int N, M; cin >> N >> M; for (int i = 0; i > str; n_set.insert(str); } for (int i = 0; i > str; if (n_set.find(str) != n_set.end()) dup.push_back(str); } dup.sort(); cout

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 #include #include #include using namespace std; int main() { string str; cin >> str; while (str.compare("0")) { string clone; clone += str; reverse(clone.begin(), clone.end()); if (!str.compare(clone.c_str())) cout

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include #include #include using namespace std; bool is_front(pair pair1, pair pair2) { for (size_t i = 0; i pair2.first[i]) return false; else if (pair1.first[i]

12345678910111213141516#include using namespace std; int main(){ int n, tmp = 1; cin >> n; int* arr = new int[n + 1] {0, }; for (size_t i = 1; i = j * j; j++) arr[i] = arr[i] > arr[i - j * j] + 1 ? arr[i - j * j] + 1 : arr[i]; } cout

12345678910111213141516#include using namespace std; int main(){ int n, tmp = 1; cin >> n; int* arr = new int[n + 1] {0, }; for (size_t i = 1; i = j * j; j++) arr[i] = arr[i] > arr[i - j * j] + 1 ? arr[i - j * j] + 1 : arr[i]; } cout

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263#include #include using namespace std; int main(){ int T; cin >> T; for (size_t i = 0; i > command >> n >> element; string tmp; deque deq; for (size_t j = 0; j 0) deq.push_back(tmp); tmp.clear(); } else { tmp.append(1, element[j]); } } bool order = true, error = false; for (size_t..