序号 标题 代码 编程语言 最后编辑时间 浏览次数
81 test1 /** * Created on: 2021年03月13日 16:26:30 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ public class HelloWorld { public static void main(String []args) { People people1 = new People(1, "aaa"); People people2 = new People(2, "aaa"); People people3 = new People(3, "aaa"); People people4 = new People(4, "aaa"); People people5 = new People(5, null); Map<Integer, String> result = null; // TODO } } Java 2021-03-13 16:29:00 49
82 test1 /** * Created on: 2021年03月13日 16:26:30 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ public class HelloWorld { public static void main(String []args) { People people1 = new People(1, "aaa"); People people2 = new People(2, "aaa"); People people3 = new People(3, "aaa"); People people4 = new People(4, "aaa"); People people5 = new People(5, null); List<People> initList = null; Map<Integer, String> result = null; // TODO } } Java 2021-03-13 16:34:20 59
83 1111 /** * Created on: 2021年03月29日 17:00:48 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ public class HelloWorld { public static void main(String []args) { System.out.println("Hello World!"); } } Java 2021-03-29 17:01:16 72
84 1111 /** * Created on: 2021年03月29日 17:00:48 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ public class HelloWorld { public static void main(String []args) { System.out.println("Hello World!"); } } Java 2021-03-29 17:01:42 63
85 1111 /** * Created on: 2021年03月29日 17:00:48 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ public class HelloWorld { public static void main(String []args) { System.out.println("Hello World!"); 1111 333 } } Java 2021-03-29 17:03:31 59
86 sdsf /** * Created on: 2021年09月28日 16:02:29 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ using System; namespace HelloWorldApplication { class HelloWorld { static void Main(string[] args) { /* 我的第一个 C# 程序*/ Console.WriteLine("Hello World!"); Console.ReadKey(); } } } C# 2021-09-28 16:02:41 53
87 1111 # Created on: 2021年10月19日 13:39:55 # Author: Guest # Copyright (c) 2021, All Rights Reserved. #!/usr/bin/python print("Hello, World!"); Python3 2021-10-19 13:40:24 49
88 作者真懒,题目都不写 ╮(╯_╰)╭ /** * Created on: 2021年11月02日 09:10:00 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ #include <stdio.h> int main() { // 我的第一个 C 程序 printf("Hello, World! \n"); return 0; } C/C++ 2021-11-02 09:10:33 54
89 sdsd /** * Created on: 2021年11月25日 10:33:33 * Author: Guest * Copyright (c) 2021, All Rights Reserved. */ #include <stdio.h> int main() { // 我的第一个 C 程序 printf("Hello, World! \n"); return 0; } C/C++ 2021-11-25 10:34:50 47
90 作者真懒,题目都不写 ╮(╯_╰)╭ /** * Created on: 2022年02月26日 13:52:18 * Author: Guest * Copyright (c) 2022, All Rights Reserved. */ #include <stdio.h> int main() { // 我的第一个 C 程序 printf("Hello, World! \n"); return 0; } C/C++ 2022-02-26 13:52:27 23
91 connect_area.c #include <stdio.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> #include <math.h> #define CONNECTIVITY4 4 #define CONNECTIVITY8 8 #define STACK_INIT_SIZE 256 #define STACK_INCRE 256 #define TRUE 1 #define FALSE 0 typedef struct tagStack { int **base; int **top; int stacksize; }Stack; Stack* CreatStack(void) { Stack *pStack = (Stack*)calloc(1, sizeof(Stack)); pStack->base = (int **)calloc(STACK_INIT_SIZE + 1, sizeof(int *)); pStack->top = pStack->base; pStack->stacksize = STACK_INIT_SIZE; return pStack; } int IsStackEmpty(Stack *pStack) { if (pStack->top == pStack->base) return TRUE; else return FALSE; } void Push(Stack *pStack, int *pnElement) { if (pStack->top - pStack->base >= pStack->stacksize) { pStack->base = (int **)realloc(pStack->base, (pStack->stacksize + STACK_INCRE) * sizeof(int *)); pStack->top = pStack->base + pStack->stacksize; ... C/C++ 2022-02-26 13:55:04 24
92 connect_area.c #include <stdio.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> #include <math.h> #define CONNECTIVITY4 4 #define CONNECTIVITY8 8 #define STACK_INIT_SIZE 256 #define STACK_INCRE 256 #define TRUE 1 #define FALSE 0 typedef struct tagStack { int **base; int **top; int stacksize; }Stack; Stack* CreatStack(void) { Stack *pStack = (Stack*)calloc(1, sizeof(Stack)); pStack->base = (int **)calloc(STACK_INIT_SIZE + 1, sizeof(int *)); pStack->top = pStack->base; pStack->stacksize = STACK_INIT_SIZE; return pStack; } int IsStackEmpty(Stack *pStack) { if (pStack->top == pStack->base) return TRUE; else return FALSE; } void Push(Stack *pStack, int *pnElement) { if (pStack->top - pStack->base >= pStack->stacksize) { pStack->base = (int **)realloc(pStack->base, (pStack->stacksize + STACK_INCRE) * sizeof(int *)); pStack->top = p ... C/C++ 2022-02-26 14:51:17 27
93 connect_area.c #include <stdio.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> #include <math.h> #include <string.h> #define CONNECTIVITY4 4 #define CONNECTIVITY8 8 #define STACK_INIT_SIZE 256 #define STACK_INCRE 256 #define TRUE 1 #define FALSE 0 typedef struct tagStack { uint8_t **base; uint8_t **top; int stacksize; }Stack; Stack* CreatStack(void) { Stack *pStack = (Stack*)calloc(1, sizeof(Stack)); pStack->base = (uint8_t **)calloc(STACK_INIT_SIZE + 1, sizeof(uint8_t *)); pStack->top = pStack->base; pStack->stacksize = STACK_INIT_SIZE; return pStack; } int IsStackEmpty(Stack *pStack) { if (pStack->top == pStack->base) return TRUE; else return FALSE; } void Push(Stack *pStack, uint8_t *pnElement) { if (pStack->top - pStack->base >= pStack->stacksize) { pStack->base = (uint8_t **)realloc(pStack->base, (pStack->stacksize + STACK_INCRE) ... C/C++ 2022-02-26 16:10:14 34
94 connect_area.c #include <stdio.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> #include <math.h> #include <string.h> #define CONNECTIVITY4 4 #define CONNECTIVITY8 8 #define STACK_INIT_SIZE 0 //初始栈大小,随着压栈会自动增加 #define STACK_INCRE 4 //每次进栈4个地址 #define TRUE 1 #define FALSE 0 typedef struct tagStack { uint8_t **base; uint8_t **top; int stacksize; }Stack; Stack* CreatStack(void) { Stack *pStack = (Stack*)calloc(1, sizeof(Stack)); //12字节 pStack->base = (uint8_t **)calloc(STACK_INIT_SIZE + 1, sizeof(uint8_t *)); //4字节 pStack->top = pStack->base; pStack->stacksize = STACK_INIT_SIZE; return pStack; } int IsStackEmpty(Stack *pStack) { if (pStack->top == pStack->base) return TRUE; else return FALSE; } void Push(Stack *pStack, uint8_t *pnElement) { if (pStack->top - pStack->base >= pStack->stacksize) { ... C/C++ 2022-02-28 15:08:13 32
95 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> rotate_image(uint8_t *pBufSrc,int width,int height,float cos_sita,float sin_sita) { uint8_t pBmpBufDst=NULL; float a=0.0,b=0.0,c=0.0,d=0.0; float x1=0.0,x2=0.0,x3=0.0,x4=0.0; float y1=0.0,y2=0.0,y3=0.0,y4=0.0; float f1=0.0,f2=0.0; int w1=0,h1=0,lineByte1=0; a = (width - 1) / 2; //中心坐标 b = (height - 1) / 2; x1 = -a*cos_sita - b*sin_sita; y1 = -a*sin_sita + b*cos_sita; x2 = a*cos_sita - b*sin_sita; y2 = a*sin_sita + b*cos_sita; x3 = a*cos_sita + b*sin_sita; y3 = a*sin_sita - b*cos_sita; x4 = -a*cos_sita + b*sin_sita; y4 = -a*sin_sita - b*cos_sita; w1 = round(fmax(abs(x1 - x3), abs(x2 - x4))); h1 = round(fmax(abs(y1 - y3), abs(y2 - y4))); c = (w1 - 1) / 2; d = (h1 - 1) / 2; f1 = -c*cos_sita + d*sin_sita + a; f2 = -c*sin_sita - d*cos_sita + b; lineByte1 = (w1*biCount / 8 + 3) / 4 * 4; pBmpBufDst =(uint8_t*)malloc(lineBy ... C/C++ 2022-02-28 20:33:31 24
96 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> unsigned char gImage_merry[1200] = { 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0XF8,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X01,0X8C,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X06,0X03,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X1C,0X01,0 ... C/C++ 2022-03-01 11:40:54 19
97 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> unsigned char gImage_merry[1200] = { 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0XF8,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X01,0X8C,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X06,0X03,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X1C,0X01,0 ... C/C++ 2022-03-01 14:12:08 25
98 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> unsigned char gImage_merry[1200] = { 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0XF8,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X01,0X8C,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X06,0X03,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X1C,0X01,0X80,0X00,0X00,0 ... C/C++ 2022-03-01 16:37:49 30
99 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> #include <stdarg.h> #include <stddef.h> #include <stdlib.h> #include <stdint.h> unsigned char gImage_merry[1200] = { 0X00,0X00,0X00,0X00,0X00,0X00,0X3F,0XBF,0X80,0X00,0X00,0X00,0X00,0X00,0X10,0X00, 0X00,0X00,0X00,0X00,0X00,0X00,0XFE,0X7C,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X03,0XFD,0XF8,0X00,0X00,0X00,0X00,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X0F,0XF7,0XE0,0X00,0X00,0X00,0X00,0X7C,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0X3F,0XFF,0X80,0X00,0X00,0X20,0XFF,0XF0,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X00,0XFF,0X7E,0X00,0X00,0X00,0XC0,0XFF,0XF0,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X03,0XFD,0XF8,0X00,0X00,0X9E,0X03,0XFF,0XC0,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X0F,0XFF,0XE0,0X00,0XA7,0XF8,0X07,0XFF,0X80,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X3F,0XFF,0XC0,0XA0,0X0F,0XF0,0X1F,0XFF,0X00,0X00,0X00,0X00, 0X00,0X00,0X00,0X00,0X7F,0XFF,0XA0,0X00,0X1F,0XC0,0X3F,0 ... C/C++ 2022-03-02 11:13:28 41
100 作者真懒,题目都不写 ╮(╯_╰)╭ #include <stdio.h> #include "mvm_color.h" #include "stddef.h" #include <string.h> #include "sys.h" #include <stdint.h> const int8_t lab_table[98304] = { 0, 0, -1, 0, 3, -9, 1, 8, -21, 2, 16, -31, 4, 27, -41, 6, 35, -48, 8, 41, -55, 11, 45, -61, 14, 50, -67, 16, 54, -73, 19, 58, -79, 22, 62, -84, 24, 66, -90, 27, 70, -95, 29, 74, -101, 31, 78, -106, 1, -1, 0, 1, 2, -8, 2, 7, -19, 3, 15, -30, 4, 25, -39, 6, 32, -47, 9, 38, -54, 12, 43, -60, 14, 48, -66, 17, 52, -72, 19, 57, -78, 22, 61, -84, 24, 65, -89, 27, 70, -95, 29, 74, -100, 31, 78, -106, 2, -2, 0, 2, 0, -7, 3, 5, -18, 4, 13, -29, 5, 23, -38, 7, 30, -46, 10, 36, -53, 12, 41, -59, 15, 47, -66, 17, 51, -71, 20, 56, -78, 22, 60 ... C/C++ 2022-03-02 20:44:32 38