Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- int main()
- {
- vector<vector<int>> a(300, vector<int>(300, 0));
- int x = 150;
- int y = 150;
- int n = 5;
- int k = 5;
- for(int z = 0; z < 5; ++z){
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- --x;
- }
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- ++y;
- }
- n += k;
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- ++x;
- }
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- --y;
- }
- n += k;
- }
- x = 161;
- y = 161;
- int res = 0;
- int counter = 0;
- for(int k = 1; k <= 5; ++k){
- int ans = 0;
- n = k;
- for(int z = 0; z < 5; ++z){
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- --x;
- }
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- ++y;
- }
- n += k;
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- ++x;
- }
- for(int i = 0; i < n; ++i){
- a[x][y] = 1;
- --y;
- }
- n += k;
- }
- if(ans > counter){
- counter = ans;
- res = k;
- }
- }
- cout << res << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement