Q

@qazsxc2

11003 최솟값 찾기

C++
3 months ago
#include <iostream> #include <string> #include <deque> #include <algorithm> using namespace std; int n,l; int main() { ios::sync_with_stdio(0);

5430 AC

C++
3 months ago
#include <iostream> #include <string> #include <deque> #include <algorithm> using namespace std; int n; // [1,2,3,4] 이렇게 출력 void print_res(deque<int> &q) { cout << '[';

1021 회전하는 큐

C++
3 months ago
#include <iostream> #include <string> #include <deque> #include <algorithm> using namespace std; int n,m; int main() { ios::sync_with_stdio(0);

10866 덱

C++
3 months ago
#include <iostream> #include <string> #include <deque> #include <algorithm> using namespace std; int n; int main() { ios::sync_with_stdio(0); cin.tie(0);

2164 카드 2

C++
3 months ago
#include <iostream> #include <string> #include <queue> #include <algorithm> using namespace std; int n; int main() { ios::sync_with_stdio(0); cin.tie(0);

1874 스택 수열

C++
3 months ago
#include <iostream> #include <stack> #include <vector> #include <algorithm> using namespace std; int n; stack <int> num; vector<char> res; int now_num=1;

10773 제로

C++
3 months ago
#include <iostream> #include <stack> #include <algorithm> using namespace std; int n; stack <int> num; int idx=0; int main() { ios::sync_with_stdio(0);

1253 좋다

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n,cnt=0; long long num[2005]; int main() { ios::sync_with_stdio(0); cin.tie(0);

2512 예산

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n; long long total; int res=0; int x[10005]; int main() {

3151 합이 0

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n; int man[10005]; long long res=0; int main() {

2467 용액

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n; long long x[100005]; int main() { ios::sync_with_stdio(0);

14921 용액 합성하기

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n; long long x[100005]; int main() { ios::sync_with_stdio(0);

18869 멀티버스 Ⅱ

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int m,n; vector<vector<int>> space; int main() { ios::sync_with_stdio(0); cin.tie(0);

2110 공유기 설치

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n,m; long long x[200005]; int main() { ios::sync_with_stdio(0); cin.tie(0);

1654 랜선자르기

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n,m; long long lan[10005]; int main() { ios::sync_with_stdio(0); cin.tie(0);

16401 과자 나눠주기

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int n,m,snack[1000005]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m;

2805 나무자르기

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0);

2295 세 수의 합

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int x[1005]; int main() { ios::sync_with_stdio(0); cin.tie(0);

좌표압축

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int x[1000005]; int main() { ios::sync_with_stdio(0); cin.tie(0);

1920 수 찾기

C++
3 months ago
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0);