#include <iostream>using namespace std;const int N = 1000;int vis[N];int val[N];void print(int n,int* x,int l){    int i;    bool flag = false;    for (i = 0; i < n; i++)    {    ...

#include <iostream>#include <cmath>#include <string>#include <stack>#include<queue>using namespace std;const int N = 105;int dir[4][2] = {    0,1,1,0,0,-1,-1,0};...

#include <iostream>#include <cmath>#include <string>#include <stack>#include<queue>using namespace std;const int N = 105;int dir[4][2] = {    0,1,1,0,0,-1,-1,0};...

#include <iostream>#include <cmath>#include <string>using namespace std;const int F = 3;struct node{    string s;    node *parent, *child[F];    int val;};struct tree {   ...

#include <iostream>#include <cmath>#include <string>#include <stack>using namespace std;const int N = 105;int dir[4][2] = {    0,1,1,0,0,-1,-1,0};struct P {    int x,...

#include <iostream>#include <cmath>#include <string>using namespace std;const int N = 105;int st[N];int main(){    int n;    cin >> n;    int sp[N];    for (int i =...

#include <iostream>#include <cmath>#include <string>using namespace std;const int N = 105;void hanio(char a, char b, char c, int n){    if (n == 1)    {        cout <<...

#include <iostream>#include <cmath>#include <string>using namespace std;const int N = 105;struct node {    int xs[N];    int val;    node()    {        for (int i = 0; i &l...

#include <iostream>#include <cmath>#include <opencv2/opencv.hpp>#include <opencv2/highgui/highgui.hpp>#include <opencv2/imgproc/imgproc.hpp>using namespace std;usin...

#include "Matrix.h"const int N = 105;int a[N];int main(){    int n;    cin >> n;    int mx, mn;    cin >> a[0];    mn = mx = a[0];    for (int i = 1; i < n; i++)    {       ...

#include "Matrix.h"const int N = 105;int a[N];void srotbase(int bas,int n){    int out[N];    int buck[11];    buck[10] = 0;    for (int i = 0; i < 10; i++)        buck[i] = 0;    for (in...

#include "Matrix.h"const int N = 105;int x[N];int pre[N];void init(int n){    for (int i = 0; i < n+1; i++)        pre[i] = i;}int findf(int x){    if (pre[x] == x) return x;    return ...

#include <iostream>using namespace std;const int N = 10;int mark[N];int x[N];int main(){    int n;    cin >> n;    for (int i = 0; i < n; i++)    {        cin >> x[i];...

#include <iostream>#include <cmath>#include <vector>#include <algorithm>using namespace std;const int N = 101;struct node{    int val;    int id;};bool cmp(node a, n...