Advertisement
artemgf

Фракталы

Apr 6th, 2018
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.30 KB | None | 0 0
  1. #define _USE_MATH_DEFINES
  2. #define _CRT_SECURE_NO_WARNINGS
  3. #include <iostream>
  4. #include <string>
  5. #include <map>
  6. #include <set>
  7. #include <algorithm>
  8. #include <vector>
  9. #include <stdio.h>
  10. #include <cmath>
  11. #include <math.h>
  12. #include <queue>
  13. #include <stack>
  14. #include <climits>
  15. #include <deque>
  16. #include <ctime>
  17. #include <iomanip>
  18.  
  19. using namespace std;
  20.  
  21. typedef long long ll;
  22. typedef unsigned long long ull;
  23. typedef unsigned int ui;
  24. typedef long double ld;
  25.  
  26. int main()
  27. {
  28.   ios_base::sync_with_stdio(0);
  29.   freopen("input.txt", "rt", stdin);
  30.   freopen("output.txt", "wt", stdout);
  31.   ll n;
  32.   ll k;
  33.   cin » n » k;
  34.   ll m = pow(n, k);
  35.   vector<string> ans(m + 1);
  36.   vector<string> op(n + 1);
  37.   for (int i = 1; i <= n; i++)
  38.   {
  39.     cin » op[i];
  40.     op[i] = " " + op[i];
  41.   }
  42.   for (int i = 1; i <= m; i++)
  43.   {
  44.     ans[i].push_back(' ');
  45.     for (int j = 1; j <= m; j++)
  46.       ans[i].push_back('.');
  47.   }
  48.   ll o = m;
  49.   for (; k >= 1; k--)
  50.   {
  51.     o /= n;
  52.     for (int i = 1; i <= m; i++)
  53.     {
  54.       for (int j = 1; j <= m; j++)
  55.       {
  56.         if (op[(((i-1) / o)%n)+1][(((j-1) / o)%n)+1] == '*')
  57.           ans[i][j] = '*';
  58.       }
  59.     }
  60.   }
  61.   for (int i = 1;i<=m; i++)
  62.   {
  63.     for (int j = 1; j <ans[i].size() ; j++)
  64.       cout « ans[i][j];
  65.       cout « endl;;
  66.   }
  67.  
  68. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement