Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Create 100819U_standard.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-08-15 21:27:47 +08:00 committed by GitHub
parent 33d04d818c
commit 6ad524fd45
1 changed files with 24 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
Codeforces/Gym/100819U_standard.cpp Normal file
View File

@ -0,0 +1,24 @@
#include<cstdio>
#include<set>
using namespace std;
int n, m, b;
int a[2][128][128];
set<int> s;
int dx[9]={-1,-1,-1,0,0,0,1,1,1};
int dy[9]={-1,0,1,-1,0,1,-1,0,1};
int main()
{
scanf("%d%d%d", &m, &n, &b);
for(int i=0;i<n;i++) for(int j=0;j<m;j++)
scanf("%d", &a[0][i][j]);
for(int k=1;k<=b;k++) for(int i=0;i<n;i++) for(int j=0;j<m;j++)
{
a[k&1][i][j] = 0;
for(int dir=0;dir<=8;dir++)
a[k&1][i][j] += a[!(k&1)][(i+dx[dir]+n)%n][(j+dy[dir]+m)%m];
}
for(int i=0;i<n;i++) for(int j=0;j<m;j++)
s.insert(a[b&1][i][j]);
printf("%d\n", (int)s.size());
return 0;
}