int main() { int i; int arr[]{49,38,65,97,76,13,27,49}; int nsizeof(arr)/sizeof(arr[0]); //数据开始的排列 for(i0;i<n;i) { printf("%d ",arr[i]); } printf("\n"); //排序后 InsertSort(arr,n…
创建本地密匙
按下WinR输入cmd,输入
ssh-keygen -t rsa然后连续回车直到结束 找到Your public key has been saved in C:\Users\Administrator/.ssh/id_rsa.pub,每个人都不一样找到密匙所在地 打开id_rsa.pub这个文件,可以用记事本打开&am…
1.杂题 1.1 计算二进制中1的个数
AcWing import java.util.*;public class Main{public static void main(String[] args) {Scanner sc new Scanner(System.in);int n sc.nextInt();int[] num new int[n];for (int i 0; i < n; i) {num[i] sc.nextInt();}int[] arr n…
力扣题目链接
列转行
SELECT product_id, store1 store, store1 price FROM products WHERE store1 IS NOT NULL
UNION
SELECT product_id, store2 store, store2 price FROM products WHERE store2 IS NOT NULL
UNION
SELECT product_id, store3 store, store3 price FROM p…
论文题目:A dynamic multi-objective optimization based on a hybrid of pivot points prediction and diversity strategies
基于枢轴点预测和多样性策略混合的动态多目标优化(Jinhua Zheng a,b,d, Fei Zhou a,b,∗, Juan Zou a,b, Shengxiang Yang a…