Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _USE_MATH_DEFINES
- #define _CRT_SECURE_NO_WARNINGS
- #include <iostream>
- #include <string>
- #include <map>
- #include <set>
- #include <algorithm>
- #include <vector>
- #include <stdio.h>
- #include <cmath>
- #include <math.h>
- #include <queue>
- #include <stack>
- #include <climits>
- #include <deque>
- #include <ctime>
- #include <iomanip>
- using namespace std;
- typedef long long ll;
- typedef unsigned long long ull;
- typedef unsigned int ui;
- typedef long double ld;
- int main()
- {
- ios_base::sync_with_stdio(0);
- freopen("input.txt", "rt", stdin);
- freopen("output.txt", "wt", stdout);
- ll n;
- ll k;
- cin » n » k;
- ll m = pow(n, k);
- vector<string> ans(m + 1);
- vector<string> op(n + 1);
- for (int i = 1; i <= n; i++)
- {
- cin » op[i];
- op[i] = " " + op[i];
- }
- for (int i = 1; i <= m; i++)
- {
- ans[i].push_back(' ');
- for (int j = 1; j <= m; j++)
- ans[i].push_back('.');
- }
- ll o = m;
- for (; k >= 1; k--)
- {
- o /= n;
- for (int i = 1; i <= m; i++)
- {
- for (int j = 1; j <= m; j++)
- {
- if (op[(((i-1) / o)%n)+1][(((j-1) / o)%n)+1] == '*')
- ans[i][j] = '*';
- }
- }
- }
- for (int i = 1;i<=m; i++)
- {
- for (int j = 1; j <ans[i].size() ; j++)
- cout « ans[i][j];
- cout « endl;;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement