diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-10 20:07:08 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-10 20:07:08 +0200 |
| commit | 4fd337e701294a8d8c45dbfec600ca24b14aae8a (patch) | |
| tree | 1c197b654a252167df4f13084c4d90d1464524ac | |
| parent | 3c1d12ac165f1ff1cb154f8200aaeb37f74586d9 (diff) | |
| download | competitive-programming-4fd337e701294a8d8c45dbfec600ca24b14aae8a.tar.xz competitive-programming-4fd337e701294a8d8c45dbfec600ca24b14aae8a.zip | |
Solved FallDown from codeforces
| -rw-r--r-- | FallDown.cpp | 36 |
1 files changed, 36 insertions, 0 deletions
diff --git a/FallDown.cpp b/FallDown.cpp new file mode 100644 index 0000000..718dcb3 --- /dev/null +++ b/FallDown.cpp @@ -0,0 +1,36 @@ +#include<bits/stdc++.h> +using namespace std; +int main() { + int tt; + cin >> tt; + while(tt--) { + int r, c; + cin >> r >> c; + vector<string> grid(r); + for(auto &s : grid) { + cin >> s; + } + for(int i = grid.size() - 2; i >= 0; i--) { + for(int j = 0; j < grid[i].size(); j++) { + int t = i; + if(grid[i][j] == '*'){ + while(t < r - 1 && grid[t+1][j] == '.'){ + grid[t+1][j] = '*'; + grid[t][j] = '.'; + t++; + } + } + } + } + for(auto s : grid) { + cout << s << endl; + } + } + } + + + + + + + |
