文系独学プログラマーの仕訳帳

CodeQUEEN 2023 予選 (AtCoder Beginner Contest 308)

たびすけ — Sat, 01 Jul 2023 21:00:00 +0000

A. New Scheme

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = list(map(int, input().rstrip('\n').split()))
    for i in range(len(s)):
        if i != 0:
            if s[i] < s[i-1]:
                print("No")
                exit()
        if s[i] % 25 != 0:
            print("No")
            exit()
        if s[i] < 100 or 675 < s[i]:
            print("No")
            exit()
    print("Yes")


if __name__ == '__main__':
    solve()

B. Default Price

import sys
import collections


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, input().rstrip('\n').split()))
    c = list(map(str, input().rstrip('\n').split()))
    d = list(map(str, input().rstrip('\n').split()))
    p = list(map(int, input().rstrip('\n').split()))
    dt = collections.defaultdict(int)
    for i in range(m):
        dt[d[i]] = p[i + 1]
    ans = 0
    for i in range(n):
        if c[i] not in dt:
            ans += p[0]
        else:
            ans += dt[c[i]]
    print(ans)


if __name__ == '__main__':
    solve()

【GAS】連想配列（辞書型）の使い方一覧

たびすけ — Thu, 29 Jun 2023 09:02:38 +0000

ループ処理

全てのkeyについてループ処理を行うときは次のようなコードになります。

function loop(){
  d = {'1': 10, '2': 20, '3': 30}
  for(key in d){
    //keyを出力
    console.log(key)
    //valueを出力
    console.log(d[key])
  }
}

キーの存在チェック

連想配列にkeyが存在するかは次のようにして確認します。

function checkKey(){
  d = {}
  //コメントアウト解除してkey追加で結果が逆に
  //d['key'] = ''
  if('key' in d){
    console.log('keyが存在します')
  } 
  else{
    console.log('keyは存在しません')
  }
}

または次のようにしても確認できます。

function checkKey(){
  d = {}
  //コメントアウト解除してkey追加で結果が逆に
  //d['key'] = ''
  if(d['key'] === undefined){
    console.log('keyは存在しません')
  } 
  else{
    console.log('keyが存在します')
  }
}

GASでfreee会計にログインして「口座を同期する」ボタンを押下する

たびすけ — Thu, 29 Jun 2023 04:14:41 +0000

freee会計の機能で、銀行口座のデータを同期・取得することができます。

しかし、同期の頻度が不定期となっていて「（ほぼ）リアルタイムの情報を取得」というニーズには合致しません。

（ほぼ）リアルタイムの情報を取得するためにはデータ取得前にfreee会計画面にある「口座を同期」ボタンを押下する必要がありますが、この機能はfreee会計APIに実装されていません。

RPAやプログラムで「口座を同期」ボタンを押下する必要があり、前提条件として「定期実行が可能」で「サーバーレスな実行が可能」というものがありました。

そこで「GASの定期実行」で「口座を同期」ボタンを押下することにしました。

完成コード

//freeeへのログイン処理
function loginAndSync() {
  var today = new Date();
  var hours = today.getHours();
  //処理実施の時間帯を限定（夜間は実施しない）
  if(9 <= hours && hours <= 18){
    //ログインページ
    var response = UrlFetchApp.fetch('https://accounts.secure.freee.co.jp/login/accounting')
    var cookies = response.getAllHeaders()["Set-Cookie"];
    var c_freee_accounts_session = cookies[2]
    var token = Parser.data(response.getContentText("UTF-8")).from('name="authenticity_token" value="').to('" autocomplete').build()
    
    Utilities.sleep(1000)

    //ログイン処理
    headers = {
      'cookie': c_freee_accounts_session,
      'user-agent': 'Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_3) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36'
    }
    payload = {
      'authenticity_token': token,
      'email': 'ここにはログインID',
      //パスワードは暗号化されたもの
      'password': 'ここにはログインパスワード'
    }
    options = {
      'method': 'POST',
      'headers': headers,
      'payload': payload,
      'followRedirects': false
    }
    response = UrlFetchApp.fetch('https://accounts.secure.freee.co.jp/login/accounting', options)
    cookies = response.getAllHeaders()["Set-Cookie"];
    var c_n_auth_session_id = cookies[0]
    c_freee_accounts_session = cookies[2]

    Utilities.sleep(1000)

    //リダイレクト
    headers = {
      'cookie': c_n_auth_session_id,
      'user-agent': 'Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_3) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36',
    }
    options = {
      'method': 'GET',
      'headers': headers,
      'followRedirects': false,
    }
    response = UrlFetchApp.fetch('https://secure.freee.co.jp/users/after_login', options)
    cookies = response.getAllHeaders()["Set-Cookie"];

    Utilities.sleep(1000)

    //会計トップへ
    response = UrlFetchApp.fetch('https://secure.freee.co.jp', options)
    var c_session_id = response.getAllHeaders()["Set-Cookie"];
    var csrf_token = Parser.data(response.getContentText("UTF-8")).from('name="csrf-token" content="').to('" />').build()
    headers = {
      'cookie': c_n_auth_session_id + "; " + c_session_id,
      'user-agent': 'Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_3) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36',
      'X-Company-Id': 'ここには会社コードを入力',
      'X-Csrf-Token': csrf_token,
      'X-Xhr-From': 'request'
    }
    options = {
      'method': 'PUT',
      'headers': headers,
      'muteHttpExceptions': true
    }
    id = 'ここにはwalletableIDを入力'
    type = 'ここにはwalletableTypeを入力'
    response = UrlFetchApp.fetch('https://secure.freee.co.jp/api/p/walletables/' + id + '/sync?walletable_type=' + type +'', options)
  }
  else{
    return
  }
}

東京海上日動プログラミングコンテスト2023（AtCoder Beginner Contest 307）

たびすけ — Sat, 24 Jun 2023 21:00:00 +0000

A. Weekly Records

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    print(*[sum(a[i*7:(i+1)*7]) for i in range(n)])


if __name__ == '__main__':
    solve()

B. racecar

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = [str(input().rstrip('\n')) for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if i != j:
                ts = s[i] + s[j]
                is_ok = True
                for k in range(len(ts)):
                    if ts[k] != ts[-k-1]:
                        is_ok = False
                        break
                if is_ok:
                    print("Yes")
                    exit()
    print("No")



if __name__ == '__main__':
    solve()

東京海上日動プログラミングコンテスト2023（AtCoder Beginner Contest 307）

たびすけ — Sat, 24 Jun 2023 12:00:00 +0000

A. Weekly Records

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    print(*[sum(a[i*7:(i+1)*7]) for i in range(n)])


if __name__ == '__main__':
    solve()

B. racecar

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = [str(input().rstrip('\n')) for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if i != j:
                ts = s[i] + s[j]
                is_ok = True
                for k in range(len(ts)):
                    if ts[k] != ts[-k-1]:
                        is_ok = False
                        break
                if is_ok:
                    print("Yes")
                    exit()
    print("No")



if __name__ == '__main__':
    solve()

トヨタ自動車プログラミングコンテスト2023#3(AtCoder Beginner Contest 306)

たびすけ — Sat, 17 Jun 2023 21:00:00 +0000

A. Echo

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    print("".join([v * 2 for v in s]))


if __name__ == '__main__':
    solve()

B. Base 2

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    ans = 0
    a = list(map(int, input().rstrip('\n').split()))
    for i in range(len(a)):
        ans += pow(2, i) * a[i]
    print(ans)


if __name__ == '__main__':
    solve()

C. Centers

import sys
import collections


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    ls = []
    d = collections.defaultdict(int)
    for i in range(3 * n):
        if a[i] not in d:
            d[a[i]] += 1
        elif d[a[i]] == 1:
            ls.append([i, a[i]])
            d[a[i]] += 1
    ls.sort()
    print(*[ls[i][1] for i in range(n)])


if __name__ == '__main__':
    solve()

D. Poisonous Full-Course

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    dp = [[-pow(10, 30)] * 2 for _ in range(n)]
    for i in range(n):
        x, y = list(map(int, input().rstrip('\n').split()))
        if i == 0:
            if x == 0:
                dp[i][0] = max(0, y)
                dp[i][1] = 0
            else:
                dp[i][1] = max(0, y)
                dp[i][0] = 0
        else:
            if x == 0:
                dp[i][0] = max(dp[i-1][0], dp[i-1][0] + y, dp[i-1][1] + y)
                dp[i][1] = dp[i-1][1]
            else:
                dp[i][1] = max(dp[i-1][1], dp[i-1][0] + y)
                dp[i][0] = dp[i-1][0]
    print(max(dp[-1]))


if __name__ == '__main__':
    solve()

京セラプログラミングコンテスト2023(AtCoder Beginner Contest 305)

たびすけ — Sat, 10 Jun 2023 21:00:00 +0000

A. Water Station

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    ls = []
    for i in range(0, 101, 5):
        ls.append([abs(i-n), i])
    ls.sort()
    print(ls[0][1])


if __name__ == '__main__':
    solve()

B. ABCDEFG

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    d = {"A": 0, "B": 3, "C": 4, "D": 8, "E": 9, "F": 14, "G": 23}
    p, q = list(map(str, input().rstrip('\n').split()))

    print(abs(d[p] - d[q]))


if __name__ == '__main__':
    solve()

C. Snuke the Cookie Picker

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    h, w = list(map(int, input().rstrip('\n').split()))
    s = [list(str(input().rstrip('\n'))) for _ in range(h)]
    mxx, mxy = 0, 0
    mnx, mny = pow(10, 30), pow(10, 30)
    for i in range(h):
        for j in range(w):
            if s[i][j] == "#":
                mxx = max(i, mxx)
                mxy = max(j, mxy)
                mnx = min(i, mnx)
                mny = min(j, mny)
    for i in range(mnx, mxx + 1):
        for j in range(mny, mxy + 1):
            if s[i][j] != "#":
                print(i + 1, j + 1)


if __name__ == '__main__':
    solve()

D. Sleep Log

import sys
import bisect


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    total = 0
    time = []
    for i in range(n):
        if i == 0:
            time.append(total)
        else:
            if i % 2 == 0:
                total += a[i] - a[i-1]
            time.append(total)
    q = int(input().rstrip('\n'))
    for i in range(q):
        l, r = list(map(int, input().rstrip('\n').split()))
        l_pos = bisect.bisect_right(a, l)
        r_pos = bisect.bisect_left(a, r)
        ans = time[r_pos] - time[l_pos]
        if r_pos % 2 == 0:
            ans -= a[r_pos] - r
        if l_pos % 2 == 0:
            ans += a[l_pos] - l
        print(ans)


if __name__ == '__main__':
    solve()

E. Art Gallery on Graph

import sys
import collections


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m, k = list(map(int, input().rstrip('\n').split()))
    tmd = collections.defaultdict(list)
    for i in range(m):
        tma, tmb = list(map(int, input().rstrip('\n').split()))
        tmd[tma-1] += [tmb-1]
        tmd[tmb-1] += [tma-1]

    fq = collections.defaultdict(int)
    ph = sorted([list(map(int, input().rstrip('\n').split())) for _ in range(k)], key=lambda x: x[1], reverse=True)
    for p, h in ph:
        if len(fq) == n:
            break
        ql = [[h, p-1]]
        ql = collections.deque(ql)
        fq[p-1] = h
        while True:
            if len(ql) != 0:
                cost, tmp = ql.popleft()
                for tmv in tmd[tmp]:
                    if fq[tmv] < cost - 1:
                        ql.append([cost - 1, tmv])
                        fq[tmv] = cost - 1
            else:
                break
    print(len(fq))
    print(*sorted([k + 1 for k in fq.keys()]))


if __name__ == '__main__':
    solve()

東京海上日動プログラミングコンテスト2023（AtCoder Beginner Contest 304）

たびすけ — Sat, 03 Jun 2023 12:00:00 +0000

A. First Player

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    al = []
    sl = []
    for i in range(n):
        s, a = list(map(str, str(input().rstrip('\n')).split()))
        al.append(int(a))
        sl.append(s)
    st = al.index(min(al))
    for i in range(n):
        print(sl[(i+st) % n])


if __name__ == '__main__':
    solve()

B. Subscribers

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = list(str(input().rstrip('\n')))
    for i in range(3, len(n)):
        n[i] = "0"
    print("".join(n))


if __name__ == '__main__':
    solve()

C. Virus

import sys
import collections


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, d = list(map(int, input().rstrip('\n').split()))
    xy = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
    dq = collections.deque([0])
    fq = collections.defaultdict(int)
    fq[0]
    while len(dq):
        t = dq.popleft()
        for i in range(n):
            if i != t:
                u = pow(pow(xy[t][0] - xy[i][0], 2) + pow(xy[t][1] - xy[i][1], 2), 0.5)
                if u <= d:
                    if i not in fq:
                        dq.append(i)
                        fq[i]
    for i in range(n):
        if i in fq:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    solve()

D. A Piece of Cake

import collections
import sys
import bisect


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    w, h = list(map(int, input().rstrip('\n').split()))
    n = int(input().rstrip('\n'))
    pq = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
    a = int(input().rstrip('\n'))
    al = list(map(int, input().rstrip('\n').split()))
    b = int(input().rstrip('\n'))
    bl = list(map(int, input().rstrip('\n').split()))
    d = collections.defaultdict(int)
    for i in range(n):
        p, q = pq[i]
        a_pos = bisect.bisect_left(al, p)
        b_pos = bisect.bisect_left(bl, q)
        d[a_pos, b_pos] += 1
    mx = 0
    mn = pow(10, 30)
    for k, v in d.items():
        mx = max(mx, v)
        mn = min(mn, v)
    mn = 0 if len(d) != (a + 1) * (b + 1) else mn
    print(mn, mx)


if __name__ == '__main__':
    solve()

E. Good Graph

import sys
import collections


class AlgUnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, input().rstrip('\n').split()))
    uf = AlgUnionFind(n)
    for i in range(m):
        v1, v2 = list(map(int, input().rstrip('\n').split()))
        uf.union(v1-1, v2-1)
    k = int(input().rstrip('\n'))
    d = collections.defaultdict(int)
    for i in range(k):
        x, y = list(map(int, input().rstrip('\n').split()))
        x, y = uf.find(x-1), uf.find(y-1)
        if x > y:
            x, y = y, x
        d[x, y]
    q = int(input().rstrip('\n'))
    for i in range(q):
        p, q = list(map(int, input().rstrip('\n').split()))
        p, q = uf.find(p-1), uf.find(q-1)
        if p > q:
            p, q = q, p
        if (p, q) in d:
            print("No")
        else:
            print("Yes")


if __name__ == '__main__':
    print(pow(3, 2023) * pow(7, 604))
    solve()

日鉄ソリューションズプログラミングコンテスト2023（AtCoder Beginner Contest 303）

たびすけ — Sat, 27 May 2023 12:00:00 +0000

A. Similar String

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n')).replace("1", "l").replace("0", "o")
    t = str(input().rstrip('\n')).replace("1", "l").replace("0", "o")
    print("Yes" if s == t else "No")


if __name__ == '__main__':
    solve()

B. Discord

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, input().rstrip('\n').split()))
    a = [list(map(int, input().rstrip('\n').split())) for _ in range(m)]
    ls = [[False] * n for _ in range(n)]
    for i in range(n):
        ls[i][i] = True
    for i in range(m):
        for j in range(1, n):
            ls[a[i][j]-1][a[i][j-1]-1] = True
            ls[a[i][j-1]-1][a[i][j]-1] = True
    cnt = 0
    for i in range(n):
        for j in range(n):
            cnt += 1 if not ls[i][j] else 0
    print(cnt // 2)


if __name__ == '__main__':
    solve()

C. Dash

import sys
import collections


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m, h, k = list(map(int, input().rstrip('\n').split()))
    s = str(input().rstrip('\n'))
    d = collections.defaultdict(int)
    for i in range(m):
        x, y = list(map(int, input().rstrip('\n').split()))
        d[x, y] = 1
    x, y = 0, 0
    for i in range(n):
        h -= 1
        if h < 0:
            print("No")
            exit()
        if s[i] == "R":
            x += 1
        if s[i] == "L":
            x -= 1
        if s[i] == "U":
            y += 1
        if s[i] == "D":
            y -= 1
        if d[x, y] == 1:
            if h < k:
                d[x, y] -= 1
                h = k
    print("Yes")


if __name__ == '__main__':
    solve()

D. Shift vs. CapsLock

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    x, y, z = list(map(int, input().rstrip('\n').split()))
    s = str(input().rstrip('\n'))
    dp = [[pow(10, 30)] * (len(s) + 1) for _ in range(2)]
    dp[0][0] = 0
    for i in range(len(s)):
        if s[i] == "a":
            dp[0][i+1] = min(dp[0][i+1], dp[0][i] + x, dp[1][i] + z + x)
            dp[1][i+1] = min(dp[1][i+1], dp[1][i] + y, dp[0][i] + z + y)
        else:
            dp[0][i+1] = min(dp[0][i+1], dp[0][i] + y, dp[1][i] + z + y)
            dp[1][i+1] = min(dp[1][i+1], dp[1][i] + x, dp[0][i] + z + x)
    print(min(dp[0][-1], dp[1][-1]))


if __name__ == '__main__':
    solve()

トヨタ自動車プログラミングコンテスト2023#2(AtCoder Beginner Contest 302)

たびすけ — Sat, 20 May 2023 12:00:00 +0000

A. Attack

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    a, b = list(map(int, input().rstrip('\n').split()))
    print((a + b - 1) // b)


if __name__ == '__main__':
    solve()

B. Find snuke

import sys
import itertools


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, input().rstrip('\n').split()))
    s = [str(input().rstrip('\n')) for _ in range(n)]
    for v in itertools.permutations(s, n):
        is_ok = True
        for i in range(1, n):
            cnt = 0
            for j in range(m):
                if v[i][j] != v[i-1][j]:
                    cnt += 1
            if cnt != 1:
                is_ok = False
        if is_ok:
            print("Yes")
            exit()
    print("No")


if __name__ == '__main__':
    solve()

C. Almost Equal

import sys
import bisect


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m, d = list(map(int, input().rstrip('\n').split()))
    a = sorted(list(map(int, input().rstrip('\n').split())))
    b = sorted(list(map(int, input().rstrip('\n').split())))
    ans = -1
    for i in range(n):
        pos = bisect.bisect_right(b, a[i] + d)
        if pos != 0:
            if abs(b[pos-1] - a[i]) <= d:
                ans = max(ans, b[pos-1] + a[i])
    print(ans)


if __name__ == '__main__':
    solve()

D. Impartial Gift

import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    h, w = list(map(int, input().rstrip('\n').split()))
    s = [list(str(input().rstrip('\n'))) for _ in range(h)]
    for i in range(h):
        for j in range(w):
            if "".join([s[i+k][j] if 0 <= i + k < h else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i + k + 1, j + 1)
            if "".join([s[i][j+k] if 0 <= j + k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i + 1, j + k + 1)
            if "".join([s[i-k][j] if 0 <= i - k < h else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i - k + 1, j + 1)
            if "".join([s[i][j-k] if 0 <= j - k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i + 1, j - k + 1)
            if "".join([s[i+k][j+k] if 0 <= i + k < h and 0 <= j + k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i + k + 1, j + k + 1)
            if "".join([s[i-k][j-k] if 0 <= i - k < h and 0 <= j - k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i - k + 1, j - k + 1)
            if "".join([s[i-k][j+k] if 0 <= i - k < h and 0 <= j + k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i - k + 1, j + k + 1)
            if "".join([s[i+k][j-k] if 0 <= i + k < h and 0 <= j - k < w else "x" for k in range(5)]) == "snuke":
                for k in range(5):
                    print(i + k + 1, j - k + 1)


if __name__ == '__main__':
    solve()