Submission

Status:

PP-PPPPPPP

Subtask/Task Score:

90/100

Score: 90

User: Jxricho

Problemset: เลขดวง

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-16 13:03:55

#include<bits/stdc++.h>
using namespace std;
main(){
	int d1,d2,d3;
	cin>>d1>>d2>>d3;
	int n[10][10]={},m=1;
	for(int i=0;i<10&&m<=d1;i++){
		for(int j=1;j<=7&&m<=d1;j++){
			if(i==0&&j<d2) continue;
			n[i][j]=m;
			m++;
		}
	}
	int x=0,y=0;
	for(int i=0;i<10;i++){
		for(int j=1;j<=7;j++){
			if(n[i][j]==d3){
				x=i;
				y=j;break;
			}
		}
		if(x>0||y>0) break;
	}
	int cnt=0;
	if(x>0&&n[x-1][y]>0){
		cnt+=n[x-1][y];
	}
	if(x>0&&n[x+1][y]>0){
		cnt+=n[x+1][y];
	}
	if(x>0&&n[x][y-1]>0){
		cnt+=n[x][y-1];
	}
	if(x>0&&n[x][y+1]>0){
		cnt+=n[x][y+1];
	}
	cout<<cnt;
}