Submission #49925055

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
#define int long long
const int mod=998244353ll;
char g[110][110];
int dir[4][2]={-1,0,0,1,1,0,0,-1};
void solve(){
    int n,m,cnt;cin>>n>>m>>cnt;
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)g[i][j]='.';
    int pos=0,nowx=0,nowy=0;
    while(cnt--){
        if(g[nowx][nowy]=='.'){
            g[nowx][nowy]='#';
            pos=(pos+1)%4;
        }else{
            g[nowx][nowy]='.';
            pos=(pos-1+4)%4;
        }
        nowx+=dir[pos][0],nowy+=dir[pos][1];
        nowx=(nowx+n)%n;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
#define int long long
const int mod=998244353ll;
char g[110][110];
int dir[4][2]={-1,0,0,1,1,0,0,-1};
void solve(){
    int n,m,cnt;cin>>n>>m>>cnt;
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)g[i][j]='.';
    int pos=0,nowx=0,nowy=0;
    while(cnt--){
        if(g[nowx][nowy]=='.'){
            g[nowx][nowy]='#';
            pos=(pos+1)%4;
        }else{
            g[nowx][nowy]='.';
            pos=(pos-1+4)%4;
        }
        nowx+=dir[pos][0],nowy+=dir[pos][1];
        nowx=(nowx+n)%n;
        nowy=(nowy+m)%m;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cout<<g[i][j];
        }cout<<'\n';
    }
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    // int t;cin>>t;while(t--)
        solve();
}

Submission Info

Judge Result