uenoku

#include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
template <class T>
class segtree
{
public:
    lli n;

uenoku

#http://www.cl.ecei.tohoku.ac.jp/nlp100/
from collections import defaultdict
import string


def p0(s):
    return s[::-1]


def p1(s):

uenoku

Section hoge.
Variable P Q R S T : Prop.
Lemma id_p : P -> P.
Proof.
intro a.
assumption.
Qed.

Lemma id_pp : (P-> P) -> (P-> P).
Proof.

uenoku

#include "math.h"
#include <algorithm>
#include <set>
#include <complex>
#include <stack>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>

uenoku

//https://titech-is-cs115.github.io/lecture/assignments/lx00a
#include <iostream>
#include <map>
int out(int x)
{
    return int(x <= 0 || x > 3);
}
int main()
{
    for (int i = 0; i < 10; i++) {

uenoku

#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)

uenoku

#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define pb push_back

uenoku

#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

uenoku

http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2069085#1
#include "math.h"
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>