showyou

select text, count(text) as cnt from tweet 
where 
  user='miyabiarts'
and
  (text like '%はじまります%' or text like '%はじまっています%' ) 
and 
  datetime >= '2019-01-01'
and
  not (text like 'ラブライブ！%' and datetime >= '2019-07-30')
and

showyou

#include <iostream>

int main(){
    int x = 1;
    int ans = 0;
    ans = std::max(x, ans);
    std::cout << ans << std::endl;
}

showyou

showyou

2019-06-18 12:24:38 +0900: Digdag v0.9.37
2019-06-18 12:24:41 +0900 [INFO] (main): Database migration started
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20151204221156
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160602123456
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160602184025
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160610154832
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160623123456
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160719172538
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160817123456
2019-06-18 12:24:41 +0900 [INFO] (main): Applying database migration:20160818043815

showyou

class Solution:
    def allCellsDistOrder(self, R: int, C: int, r0: int, c0: int) -> List[List[int]]:

showyou

import copy
T = int(input())

def calc_min_len(ws):
    min_len = 999999
    for w in ws:
        l = len(w)
        if l < min_len:
            min_len = l
    return min_len

showyou

import copy
T = int(input())


def find_warp(galaxy, y, x, R, C):
    #print("find_warp", y, x, galaxy)
    # pick up next warp which is
    # x != x2
    # y != y2
    # x - y != x2 - y2

showyou

T = int(input())
cnt = 1
for _ in range(T):
    size = int(input())
    L = input()
    result = ""
    for l in L:
        result += "S" if l == "E" else "E"

    print("Case #"+str(cnt)+":", result)

showyou

T = int(input())
Ns = [int(input()) for _ in range(T)]

A = 1
B = 1
cnt = 1

def check_four(i, keta):
    s = str(i)
    if s[-keta] == '4':

showyou

T = int(input())
cnt = 1

def gen_primes(x):
    if x < 2: return []

    primes = [i for i in range(x)]
    primes[1] = 0

    for prime in primes: