na-o-ys

#include <bits/stdc++.h>
 
#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()

using namespace std;
using ll = long long;
const ll MOD = 1000000007;

class ThePermutationGame

na-o-ys

#include <bits/stdc++.h>
 
#define all(v) v.begin(),v.end()

using namespace std;
using ll = long long;

int main()
{
    int n;

na-o-ys

#include <iostream>
#include <stack>
#include <vector>

using namespace std;

int main_calc(int n, int m, stack<int> **tray);

int main(int argc, char const* argv[])
{

na-o-ys

require './rsa_math.rb'

class RSA
  class << self

    PUBLIC_EXPONENT = 65537

    def gen_key(bits)
      e = PUBLIC_EXPONENT
      p = RSAMath.gen_prime(bits/2)

na-o-ys

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
 
#define loop(n, i) for(int i=0;i<n;i++)
#define from_to(from, to, i) for(int i=from;i<=to;i++)

using namespace std;

na-o-ys

a1,X,90,0,start
a2,X,90,180
a3,I,270,90
a4,I,180,180
a5,X,180,0
a6,X,180,90
a7,X,270,180
a8,T,90,90
a9,T,90,0
a10,X,180,0

na-o-ys

package main

import (
  "fmt"
  "math"
)

type Vertex struct {
  X, Y float64
}