#include#include#include#include#include#includeusing namespace std;#define maxn 2500int Map[maxn][maxn];bool Mark[maxn];int V,E;void DFS(int x,int V){ int i;
#include#include#include#include#include#includeusing namespace std;int main(){ int a[10]; int i; for(i=0;i scanf("%d",&a[i]); sort(a,a+4); for(i=
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
