Skip to content

Instantly share code, notes, and snippets.

#include <stack>
#include <string>
#include <iostream>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#include <stack>
#include <string>
#include <iostream>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#include <cstring>
#include <iostream>
using namespace std;
#define min(n, m) n > m ? m : n
int n;
int mat[10][10];
bool visit[10][10];
#include <deque>
#include <cstdio>
#include <cstring>
using namespace std;
char buf[100001];
int main(void) {
int tc;
/* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.c
* @brief : Main program body
******************************************************************************
* @attention
*
*
#include <cstdio>
#include <vector>
using namespace std;
#define max(n, m) n > m ? n : m
int mat[50][50];
int dx[2] = { 1, 1 };
int dy[2] = { 0, 1 };
#include "gpio.h"
#include "stm32f4xx_hal.h"
#include "stm32f4xx_hal_gpio.h"
void on_green_led(void)
{
HAL_GPIO_WritePin(GPIOG, GPIO_PIN_13, GPIO_PIN_SET);
}
void off_green_led(void)
#include <iostream>
using namespace std;
struct tree {
int left, right;
tree() : left(-1), right(-1) {}
};
tree tr[26];
#include <queue>
#include <vector>
#include <cstring>
#include <iostream>
using namespace std;
vector<int> graph[100001];
int p[100001];
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> cut(const vector<int>& base, int a, int b) {
return vector<int>(base.begin() + a, base.begin() + b);
}