Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <algorithm>
- using namespace std;
- ifstream fin ("balcon.in");
- ofstream fout ("balcon.out");
- int b[2505], a[52][52], n, i, j, nr, x, li, ls, k;
- int main()
- {
- fin >> n;
- for(i=1; i<=n*n; i++)
- fin >> b[i];
- sort(b+1, b+n*n+1);
- nr = (n+1)/2;
- li = 1;
- ls = n;
- x = 1;
- for(k=1; k<=nr; k++)
- {
- for(j=li; j<=ls; j++)
- a[li][j] = b[x++];
- for(i=li+1; i<=ls; i++)
- a[i][ls] = b[x++];
- for(j=ls-1; j>=li; j--)
- a[ls][j] = b[x++];
- for(i=ls-1; i>=li+1; i--)
- a[i][li] = b[x++];
- li ++;
- ls--;
- }
- for(i=1; i<=n; i++)
- {
- for(j=1; j<=n; j++)
- fout << a[i][j] << " ";
- fout << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement