블루베리의 블로그

#include #include using namespace std;int Arr[21];int main(){ for(int i=1; i> a >> b; reverse(Arr+a, Arr+b+1); } for(int i=1; i

#include #include #include #include using namespace std;int N, L = 2;int Arr[101][101];bool Visit[101][101];int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};vector> V;int Ans = 1234567890;void land(int y, int x, int l){ queue> Q; Q.push({y, x}); Visit[y][x] = true; Arr[y][x] = l; while(Q.empty() == false){ int cy = Q.front().first; int cx = Q.front().second; ..

#include using namespace std;int main(){ string S; cin >> S; int a = 0, b = 0; for(int i=0; i

#include using namespace std;int main() { int T, N, M; cin >> T; while(T--){ cin >> N >> M; cout

#include using namespace std;int main(){ int N, M; cin >> N >> M; if(N == M){ cout M) { cout

#include using namespace std;int main(){ int A; int B = 0; cin >> A; if(A == 1010){ cout

#include #include #include using namespace std;int N;priority_queue P;priority_queue, greater> M;int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; int o = 0, z = 0; int inp; for(int i=0; i> inp; if(inp > 1){ P.push(inp); } else if(inp == 1){ o++; } else if(inp == 0){ ..

#include using namespace std;int main(){ long long A, B, C; cin >> A >> B >> C; if(A + B - 2 * C >= 0){ cout

#include using namespace std;int main(){ int A, B, C; cin >> A >> B >> C; cout

#include using namespace std;int main(){ int A, B, C; cin >> A >> B >> C; cout