akouryy

A = [
  ['6','千夜']
  ['7','シャロ']
  ['8','リゼ']
  ['9','ココア']
  ['0','チノ']
  []
  ['i','青山']
  ['o','マヤ']
  ['p','メグ']

akouryy

1 2 3 v 3 2 1 ^
2 3   v 3 2   ^
3     v 3     ^
N     > N     ^

akouryy

#include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>

akouryy

#define times(n, i)      for(auto i = remove_reference<decltype(  (n)  )>::type(0); i <  (n); i++)
#define upto(f, t, i)    for(auto i = remove_reference<decltype((t)-(f))>::type(f); i <= (t); i++)
#define downto(f, t, i)  for(auto i = remove_reference<decltype((t)-(f))>::type(f); i >= (t); i--)
#define uptil(f, t, i)   for(auto i = remove_reference<decltype((t)-(f))>::type(f); i <  (t); i++)
#define downtil(f, t, i) for(auto i = remove_reference<decltype((t)-(f))>::type(f); i >  (t); i--)

akouryy

* aa * b
     * c
     * d
* e  * f  * g
          * h
     * ii * j
          * k
* l

[bad]

akouryy

*{
    font-family: serif;
}

#top{
    display: table;
}

ul{
    display: inline;    

akouryy

+-+-+
|a|b|
| +-+-+
| |c|d|
| | +-+
| | |e|
+-+-+-+
f(a) → <tr><td rowspan>a</td>f(b)f(c)
f(b) → <td>b</td></tr>
f(c) → <tr><td rowspan>c</td>f(d)f(e)

akouryy

s=[];gets.split.each{|x|s<<(x=~/\d/?x.to_i: (a,b=s.pop 2;b.send x,a))};p s[0]

akouryy

#include <bits/stdc++.h>
using namespace std;

template<class T> class BIT{
private:
	/**
	 * [---------------------8]
	 * [---------4]
	 * [---2]      [---6]
	 * [1]   [3]   [5]   [7]   [9]

akouryy

#include <bits/stdc++.h>

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i <= _##i; i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i < _##i; i++)

using namespace std;

int main(){
    int A, B, C;