“fdfa761a8c1bd1a0dcf2e0d66dbbb3edf40d543e”上不存在“...dataset/git@gitcode.net:paddlepaddle/PaddleSeg.git”
提交 5b7a4219 编写于 作者: L luxin

format bug fixed

上级 0f2edd53
......@@ -7,7 +7,7 @@
int main(int argc, char** argv)
{
_____(1)_____;
_____(1)_____
while (num <= max_num)
{
......
......@@ -5,7 +5,7 @@
```c
#include <stdio.h>
_____(1)_____;
_____(1)_____
int main(int argc, char** argv)
{
......
......@@ -9,7 +9,7 @@
int main(int argc, char** argv)
{
_____(1)_____;
_____(1)_____
printf("学号:\t%d\n", student_id);
printf("姓名:\t%s\n", name);
......
......@@ -7,7 +7,7 @@
int main(int argc, char** argv)
{
_____(1)_____;
_____(1)_____
printf("a = %d\n", a);
printf("b = %d\n", b);
......
......@@ -10,7 +10,7 @@
int main(int argc, char** argv)
{
int i = 1;
_____(1)_____;
_____(1)_____
return 0;
}
......
......@@ -12,7 +12,7 @@ int main(int argc, char** argv)
printf("请输入一个正整数:");
scanf("%d", &num);
_____(1)_____;
_____(1)_____
printf("位数为:%d", count);
return 0;
......
......@@ -11,7 +11,7 @@ int main(int argc, char** argv)
printf("请输入3个整数:");
scanf("%d,%d,%d", &a, &b, &c);
_____(1)_____;
_____(1)_____
printf("3个整数中的最大的是:%d", max);
return 0;
......
......@@ -8,7 +8,7 @@
int main(int argc, char** argv)
{
int arr[] = {1,2,3,4,5};
_____(1)_____;
_____(1)_____
size_t i;
for (i = 0; i < len; ++i)
......
......@@ -9,7 +9,7 @@ int main(int argc, char** argv)
{
int x, y, z;
x = y = 1;
_____(1)_____;
_____(1)_____
printf("%d,%d,%d\n", x, y, z);
}
```
......
......@@ -11,7 +11,7 @@ int main(int argc, char** argv)
size_t len = sizeof(str) / sizeof(char);
size_t i;
for (i = 0; i < len; ++i)
_____(1)_____;
_____(1)_____
return 0;
}
......
......@@ -13,7 +13,7 @@ int main(int argc, char** argv)
printf("请输入三角形的三条边:");
scanf("%f,%f,%f", &a, &b, &c);
_____(1)_____;
_____(1)_____
return 0;
}
......
......@@ -19,7 +19,7 @@ int main(int argc, char** argv)
printf("请输入 a,b,c:\n");
scanf("%d,%d,%d", &a, &b, &c);
_____(1)_____;
_____(1)_____
printf("升序排序结果:\n");
printf("%d,%d,%d", a, b, c);
......
......@@ -17,7 +17,7 @@ int main(int argc, char** argv)
printf("请输入第2个整数:");
scanf("%d", &num_2);
_____(1)_____;
_____(1)_____
printf("两数之间的较大值为:%d", max_num);
......
......@@ -24,7 +24,7 @@ int main(int argc, char** argv)
}
int quotient = score / 10;
_____(1)_____;
_____(1)_____
return 0;
}
......
......@@ -10,7 +10,7 @@ int main(int argc, char** argv)
int i = 0;
int j = 0;
_____(1)_____;
_____(1)_____
return 0;
}
......
......@@ -9,7 +9,7 @@ int main(int argc, char** argv)
{
int sum = 0;
int i = 0;
_____(1)_____;
_____(1)_____
printf("10以内的正整数之和为:%d", sum);
return 0;
......
......@@ -21,7 +21,7 @@ int main(int argc, char** argv)
}
m = a * b;
c = a % b;
_____(1)_____;
_____(1)_____
printf("最大公约数是:%d\n", b);
printf("最小公倍数是:%d\n", m / b);
......
......@@ -5,7 +5,7 @@
```c
#include <stdio.h>
_____(1)_____;
_____(1)_____
int main(int argc, char** argv)
{
......
......@@ -9,7 +9,7 @@
int main(int argc, char** argv)
{
int i;
_____(1)_____;
_____(1)_____
for (i = 0; i < LEN; ++i)
printf("%-4d", arr[i]);
......
......@@ -11,7 +11,7 @@ int main(int argc, char **argv)
int arr[LEN] = {2, 5, 1, 10, 4, 8, 6, 3, 9, 7};
int i, j, max_value, position;
_____(1)_____;
_____(1)_____
printf("数组中的最大值为:%d\n", max_value);
printf("最大值在数组中的下标为:%d\n", position);
......
......@@ -19,7 +19,7 @@ int main(int argc, char** argv)
for (j = 0; j < LEN - i - 1; ++j)
if (arr[j] > arr[j + 1])
{
_____(1)_____;
_____(1)_____
is_sorted = false;
}
if (is_sorted)
......
......@@ -29,7 +29,7 @@ int main(int argc, char** argv)
printf("反转前:\n");
print_array(a, ARR_LEN);
_____(1)_____;
_____(1)_____
printf("反转后:\n");
print_array(a, ARR_LEN);
......
......@@ -33,7 +33,7 @@ int main(int argc, char** argv)
printf("转置前:\n");
print_matrix(m, row, col);
_____(1)_____;
_____(1)_____
printf("转置后:\n");
print_matrix(t, col, row);
......
......@@ -23,7 +23,7 @@ int main(int argc, char** argv)
int i, j, rows, cols, sum;
rows = 2, cols = 5;
_____(1)_____;
_____(1)_____
sum = sum_2d_array(ROWS, COLS, arr_1);
printf("array_1中所有元素之和为:%d\n", sum);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册