Massbug/judge4c
2
0
Fork 0
mirror of https://github.com/massbug/judge4c.git synced 2025-05-18 07:16:34 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

bugs: fix bugs in coding template

Browse Source
This commit is contained in:
fly6516 2025-04-15 16:40:03 +08:00
parent 7073d5ddf4
commit a9ea06a56a
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
prisma/seed.ts
View File

@ -297,7 +297,8 @@ int* twoSum(int* nums, int numsSize, int target, int* returnSize) {
create: [ create: [
{ {
language: "c", language: "c",
template: `#include <stdio.h> template: `
#include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
@ -377,7 +378,7 @@ int* twoSum(int* nums, int numsSize, int target, int* returnSize) {
{ {
language: "cpp", language: "cpp",
template: ` template: `
#include <iostream> #include <iostream>
#include <vector> #include <vector>
#include <string> #include <string>
#include <sstream> #include <sstream>
@ -990,7 +991,7 @@ Let $m$ be the size of array \`nums1\` and $n$ be the size of array \`nums2\`.
{ {
language: "c", language: "c",
template: ` template: `
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
@ -1016,6 +1017,8 @@ int *parseIntArray(char *line, int *len) {
return arr; return arr;
} }
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size);
int main() { int main() {
char line[1024]; char line[1024];
@ -1048,7 +1051,7 @@ double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Si
{ {
language: "cpp", language: "cpp",
template: ` template: `
#include <iostream> #include <iostream>
#include <vector> #include <vector>
#include <string> #include <string>
#include <sstream> #include <sstream>