wasabili

                                                int
                                                  stk
                                                    [ 2                          <<   14
                                                     ];  int                    ps        = 0; int kofi(){char
                                                       a         [ 2 << 15 ]; int        c[                    2<<
                                                         15                             ];int                        n;
                                                              int                       s;char            d[             2<<
                                                            14                          ];int              p ;              int

wasabili

#include <cstdio>
#include <cstring>

int diffs[500001];
int a[500002];

main(){
	int n,power;
	
	scanf("%d%d",&n,&power);

wasabili

#include <cstdio>
#include <string>

using namespace std;

string make(char x, int n){
	string s;
	for(int i=0;i<n;i++) s+=x;
	return s;
}

wasabili

#include<cstdio>
#include<stack>
#include<queue>
#include<vector>

using namespace std;

typedef struct {
	int v;
	long long int n;

wasabili

#include<queue>
#include<cstdio>
#include<cstring>
#include<cstdlib>

using namespace std;

struct node{
  node *nodes[4];
  int exists;

wasabili

import java.net.*;
import java.io.*;
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import java.util.*;

public class Othello{
	public static final int WHITE=-1;
	public static final int BLACK=1;

wasabili

import java.net.*;
import java.io.*;
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import java.util.*;

public class NetOthello{

	Othello oth = null;

wasabili

import java.net.ServerSocket;
import java.net.Socket;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.*;


public class NetOthelloServ {

wasabili

#include<cstdio>
#include<cstring>
#include<algorithm>

#define max(x,y) ((x>y)?x:y)
#define N_MAX 100000

using namespace std;

int len[N_MAX];

wasabili

import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.event.*;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;

public class Test extends JPanel {