블루베리의 블로그

#include using namespace std;int main(){ int N; cin >> N; while(true){ int inp; cin >> inp; if(inp==0){ break; } if(inp%N==0){ cout

#include #include using namespace std;int R, C, T;bool goal;char Arr[51][51];bool QC[51][51];bool WC[51][51];int Dir[4][2] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};queue> Q;queue> W;void water(){ int sz = W.size(); while(sz--){ int y = W.front().first; int x = W.front().second; W.pop(); for(int d=0; d= R || nx >= C) continue; if(Arr[ny][nx] == 'X' || Arr[..

#include using namespace std;int N;int Arr[3];int Max[2][3];int Min[2][3];int main(){ cin >> N; cin >> Arr[0] >> Arr[1] >> Arr[2]; Max[0][0] = Min[0][0] = Arr[0]; Max[0][1] = Min[0][1] = Arr[1]; Max[0][2] = Min[0][2] = Arr[2]; for(int i=1; i> Arr[0] >> Arr[1] >> Arr[2]; Max[1][0] = max(Max[0][0], Max[0][1]) + Arr[0]; Max[1][1] = max(Max[0][0], max(Max[0][1], Max[0..

#include using namespace std;int T, S;int main(){ cin >> T >> S; if(12

#include #include using namespace std;int R, C, T;int V[51][51];int tmp[51][51];int Dir[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};int UY, DY;bool flag;void move(){ for(int i=0; i= R || x >= C || V[y][x] == -1) continue; tmp[y][x] += V[i][j] / 5; tmp[i][j] -= V[i][j] / 5; } } } for(int i=0; i0; i--){ V[i][0] = V[i-1][0]; ..

#include #include using namespace std;int N;int Arr[17][17];queue>> Q;int main(){ cin >> N; for(int i=0; i> Arr[i][j]; } } Q.push({0, {0, 1}}); int Ans = 0; while(Q.empty() == false){ int d = Q.front().first; int y = Q.front().second.first; int x = Q.front().second.second; Q.pop(); if(y == N - 1 && x == N - 1){ Ans++; ..

#include using namespace std;int main(){ int N; cin >> N; for(int i=1; i> x >> y; cout

#include using namespace std;int main(){ int N, M; cin >> N; for(int i=0; i> M; for(int j=0; j

#includeusing namespace std;int main(){ int N; string S; cin >> N; for(int i=0; i> S; if(S.length() >= 6 && S.length()

#include #include #include #include #include using namespace std;const double PI = acos(-1);typedef complex cpx;void FFT(vector &f, cpx w){ int n = f.size(); if(n == 1) return; vector even(n / 2), odd(n / 2); for(int i=0; i multiply(vector a, vector b){ int n = 1; while(n c(n); cpx w(cos(2 * PI / n), sin(2 * PI / n)); FFT(a, w); FFT(b, w); for(int i=0; i> A >> B; ..