Untitled
unknown
plain_text
2 years ago
1.1 kB
4
Indexable
#pragma GCC optimize("O2,no-stack-protector,unroll-loops")
#define ll long long
#define pb push_back
#define ipar(arr, n) vector<ll> arr(n); for(int i=0;i<n;i++) cin>>arr[i];
#include <cmath>
#include <bits/stdc++.h>
#define pii pair<int, int>;
#define pll pair<ll, ll>;
using namespace std;
void solve(){
ll h,w,n; cin>>h>>w>>n;
vector<vector<char>>grid(h,vector<char>(w,'.'));
vector<vector<ll>>dir={{-1,0},{0,1},{1,0},{0,-1}}; //up,right,down left
ll ind=0,x=0,y=0;
for(int i=0;i<n;i++){
if(grid[x][y]=='.'){
grid[x][y]='#';
ind+=1;
}else{
grid[x][y]='.';
ind-=1;
}
ind=(ind+4)%4;
/* if(grid[x][y]='#') grid[x][y]='.';
else grid[x][y]='#'; */
x+=dir[ind][0];
y+=dir[ind][1];
x=(x+h)%h;
y=(y+w)%w;
}
for(int i=0;i<h;i++){
string o="";
for(int j=0;j<w;j++){
o+=grid[i][j];
}
cout<<o<<"\n";
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t=1;
while(t--) solve();
}
Editor is loading...
Leave a Comment