joaogui1

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

typedef long long ll;

ll vet[1000010], x, sm;
int t,n,j;
bool ok;

int main(){

joaogui1

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

const int MAX = 1e5 + 10;

pair <int, pair <int,int> > p[MAX];
int id[MAX], vertices, arestas, testes, ans;

int root(int x){
    while(id[x] != x){

joaogui1

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

struct ret {
    double x1,y1,x2,y2;
};

ret vet[20];
char c;
int i,sz;

joaogui1

#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef pair<int, int> pii;

vector <pii> adj[256];
map <string, int> mapa;
int G[256][256], cont, dist[256];

joaogui1

#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef pair<int, int> pii;

vector <pii> adj[256];
map <string, int> mapa;
int G[256][256], cont, dist[256];

joaogui1

#include <cstdio>

using namespace std;

int main() {

	char ant, S[35];
	int n;
	
	scanf("%d", &n);

joaogui1

#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int main()
{
    int m, n, i, j, a, b, cont = 0, z;
    scanf("%d%d", &n, &m);
    vector<int> v [n+1];
    int imperio[n+1];

joaogui1

#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef pair <double, double> pdd;
typedef pair <pdd, pdd> ppd;
typedef pair <ppd, char> fig;

fig arr[16];

joaogui1

#include <bits/stdc++.h>

using namespace std;

int G[128][128];

void fw(int n){
  for(int k = 1; k <= n; ++k)
    for(int i = 1; i <= n; ++i)
      for(int j = 1; j <= n; ++j)

joaogui1

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

pair <int,int> pi[MAXN];
int dp[MAXN][3610];
int n;

int solve(int atual, int tempo){
    if(atual >= n)return 0;