i < 10;++i) {return 0;
2024-01-03 11:15:55
710
int a[10];i < 10;++i) {a[i] = 0;i < 10;++i) {return 0;
2024-01-02 15:32:43
1087
* 此处写main函数及相关内容 */
2024-01-02 15:31:45
484
* 此处写main函数及相关内容 */
2024-01-02 15:31:14
838
* 此处写main函数及相关内容 */
2024-01-02 15:30:32
461
* 此处写main函数及相关内容 */
2024-01-02 15:29:59
641
* 此处写main函数及相关内容 */
2024-01-02 15:29:26
609
return n;elsereturn a;int n;
2024-01-02 15:28:56
397
if (n!=0)i <= n;i++)int main()int n;
2024-01-02 15:28:16
351
i < side;i++)i < side;i++)int main()int s;char c;
2024-01-02 15:27:45
400
int main()for(i = 0;i<5;i++)int x,y;elsereturn 0;
2024-01-02 15:27:14
340
return 1;int n1,n2;i<5;i++){
2023-12-06 19:00:32
456
int main()for(i = 0;i<5;i++)int x,y;elsereturn 0;
2023-12-06 18:59:52
408
i < side;i++)i < side;i++)int main()int s;char c;
2023-12-06 18:59:19
476
if (n!=0)i <= n;i++)int main()int n;
2023-12-06 18:58:48
372
return n;elsereturn a;int n;
2023-12-06 18:58:16
387
int main()year<=2000;year++)count++;return 0;
2023-12-06 18:57:50
402
/sqrt，开平方的数学库函数。
2023-12-05 09:26:35
376
/生成1-100之间的数字。printf("退出游戏\n");printf("选择错误\n");printf("猜大了\n");printf("猜小了\n");printf("猜到了\n");printf("请猜数字:>");printf("请选择>:");
2023-12-05 09:25:36
369
printf("请注意，你的电脑将在一分钟内关机，如果输入：我是猪，就取消关机\n请输入");if(strcmp(input,"我是猪") == 0)//比较两个字符串。//system()-执行系统命令。
2023-12-05 09:22:58
383
printf("找到了，下标是: %d\n",mid);printf("找不到\n");
2023-12-05 09:21:19
580
return ans;cin >> n;return 0;
2023-12-05 08:46:39
372
if(n==0)return 1;elseint main()int x,n;int result;return 0;
2023-12-05 08:46:05
463
int main()int i = 0;for(;i<5;i++)return 0;
2023-12-05 08:45:34
1006
int main()int x,y,z;if(x>y)max = x;elsemax = y;if(max<z)max = z;return 0;
2023-12-05 08:44:54
417
int main()int num;return 0;
2023-12-05 08:44:21
895
* 毕达哥拉斯三元组 */
2023-12-05 08:43:14
621
* 计算圆周率值 */
2023-12-05 08:42:40
537
int main()int i,j,n;for(i=1;i<=n;i++)for(j=1;j<=i-1;j++)j>=1;j--)return 0;
2023-12-05 08:41:55
828
int main()i <= 5;i++)j<= i;j++)return 0;
2023-12-05 08:41:14
1017
int main()int m = 0;int n = 0;int i;for(i=m;i<=n;i++)if(i%2==0)sum+=i;return 0;
2023-12-05 08:40:40
748
int main()max=n;for(i=1;i<m;i++)if(x>=max)max=x;elsecontinue;return 0;
2023-11-30 11:12:17
736
int main()sum=0;i<=n;i++)sum+=m;return 0;
2023-11-30 11:11:44
1536
int main()int i =1,n;for(i=1;i<=n;i++)\n");
2023-11-30 11:11:02
652
int main()int i=1,n;do\n");i++;
2023-11-30 11:10:22
541
int main()int i=1,n;\n");i++;
2023-11-30 11:09:44
603
int main()int a[5];i < 5;i++)j < 5;j++)max =a[j];min =a[j];
2023-11-30 11:09:00
347
int x, y;return 0;
2023-11-30 11:08:24
682
int main()int x = 0;else {return 0;
2023-11-30 11:07:52
552
int main()return 0;
2023-11-30 11:07:18
599
RSS订阅