#include<stdio.h>intmain(){printf("0~5组成的无重复数字的三位数为:\n");for(int i =1; i <=5; i++){for(int j =0; j <=5; j++){if(i == j)continue;for(int k =0; k <=5; k++){if(k == i || k == j)continue;printf("%d%d%d ", i, j, k);}printf("\n");}}return0;}
前言:好久没有写树上dp了,这儿题目还是挺有意思的 题目地址 #include<bits/stdc.h>
#include<iostream>
using namespace std;//#define int long long
int n;
const int N (int)1e510;
int e[N],ne[N],h[N],idx 0;
int dp[2][N];void add…