c++模板

最新推荐文章于 2024-07-17 21:57:39 发布

Tomato_Fishing

最新推荐文章于 2024-07-17 21:57:39 发布

阅读量470

点赞数 8

文章标签： c++ 算法深度优先

本文链接：https://blog.csdn.net/he700/article/details/136475797

版权


#include<cmath>
#include<cstdio>
#include<cstring>
#define ll long long
#define lll __int128

long long const M=2147483647;
int const N=20005;
int const NM=1005;
using namespace std;

int read();
void write(int);
void dg(int,int);
void dfs(int,int);
ll max(ll,ll);
ll min(ll,ll);
int n,m,k,t,jk,tot,ans,sum,num,answer,a[N],f[NM][NM];

int main()
{
//	freopen("","r",stdin);
//	freopen("","w",stdout);
	n=read(); m=read();
	for(int i=1;i<=n;i++)
	{
		
	}
	ans=n+m;
	write(ans);
	return 0;
}

ll max(ll x,ll y){if(y>x) return y;else return x;}
ll min(ll x,ll y){if(x>y) return y;else return x;}

int read()
{
    int x=0,ff=1;
    char ch=getchar();
    while (ch<'0'||ch>'9')
    {
        if(ch=='-') ff=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*ff;
}

void write(int x)
{
	if(x<0) putchar('-'),x=-x;
	if(x>9) write(x/10);
    putchar(x%10+'0');
    return;
}

void dg(int x,int y)
{
	
}

void dfs(int x,int y)
{
	
}

#include<cmath>
#include<cstdio>
#include<cstring>
#define ll long long
#define lll __int128
long long const M=2147483647;
int const N=100005;
int const NM=1005;
using namespace std;
int read();
void write(int);
void dg(int,int);
void dfs(int,int);
void qsort(int,int);
ll max(ll,ll);
ll min(ll,ll);
int n,m,k,t,jk,tot,ans,sum,num,answer,a[N],f[NM][NM];
int main()
{
//	freopen("","r",stdin);
//	freopen("","w",stdout);
	n=read();// m=read();
	for(int i=1;i<=n;i++) a[i]=read();
	qsort(1,n);
	for(int i=1;i<=n;i++) write(a[i]),putchar(' ');
	return 0;
}
ll max(ll x,ll y){if(y>x) return y;else return x;}
ll min(ll x,ll y){if(x>y) return y;else return x;}
int read()
{
    int x=0,ff=1;
    char ch=getchar();
    while (ch<'0'||ch>'9')
    {
        if(ch=='-') ff=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*ff;
}
void write(int x)
{
	if(x<0) putchar('-'),x=-x;
	if(x>9) write(x/10);
    putchar(x%10+'0');
    return;
}
void dg(int x,int y)
{
	
}
void dfs(int x,int y)
{
	
}
void qsort(int i,int j)
{
    int mid,l,r;
    mid=a[(i+j)/2+1];
    l=i;
    r=j;
    while(i<=j)
    {
        while(a[i]<mid)i++;
        while(a[j]>mid)j--;
        if(i<=j)
        {
            a[0]=a[i];
            a[i]=a[j];
            a[j]=a[0];
            i++;
            j--;
        }
    }
    if(l<j)
    qsort(l,j);
    if(i<r)
    qsort(i,r);
}