Problem 128732 >> @yuzihao |
zhaodongqiang @ 2024-07-11 20:15:53
代码我没有
|
zhaodongqiang @ 2024-07-11 20:16:46
#include <stdio.h>
int a[9],flag[10]={0}; void dfs(int pos,int n) { if (pos==n) // 已有n个数 { for (int i=0;i<n;i++) printf("%d ",a[i]); printf("\n"); } else { for(int i=1;i<=n;i++) { if(flag[i]) continue; a[pos]=i; flag[i]=1; dfs(pos+1,n); flag[i]=0; } } } int main() { int n; scanf("%d",&n); dfs(0,n); return 0; } |
zhaodongqiang @ 2024-07-11 20:17:00
就怕你看不懂
|
yuzihao @ 2024-07-11 20:17:31
哦
|
yuzihao @ 2024-07-11 20:19:19
问题 AP: 累加和-递归实现这一题的代码。
|
yuzihao @ 2024-07-11 20:19:32
这啥啊??
|
zhaodongqiang @ 2024-07-11 20:21:09
我真没了
|
yuzihao @ 2024-07-11 20:21:23
@zhaodongqiang
|
yuzihao @ 2024-07-11 20:21:46
啥都不是
|
zhaodongqiang @ 2024-07-11 20:22:00
我去你的
|
zhaodongqiang @ 2024-07-11 20:22:27
而且我也不会写
|
zhaodongqiang @ 2024-07-11 20:24:58
你会你怎么不写
|
zhaodongqiang @ 2024-07-11 20:25:16
我看你这题不是对了吗
|
yuzihao @ 2024-07-11 20:28:39
好吧
|
yuzihao @ 2024-07-11 20:28:59
拜拜
|
zhaodongqiang @ 2024-07-11 20:32:42
6
|
yuzihao @ 2024-07-11 20:39:40
赵东强o(╥﹏╥)o AQ 正确 ---- ---- ---- 2024-07-11 18:43:14
|
yuzihao @ 2024-07-11 20:40:12
这是什么
|
yuzihao @ 2024-07-11 20:40:37
@zhaodongqiang
|
zhaodongqiang @ 2024-07-11 20:46:16
e
|
zhaodongqiang @ 2024-07-11 20:46:29
我瞎写的
|
yuzihao @ 2024-07-11 20:46:39
快
|
yuzihao @ 2024-07-11 20:47:03
滚
|
yuzihao @ 2024-07-11 20:47:32
给me
|
yuzihao @ 2024-07-11 20:49:14
@zhaodongqiang
|
yuzihao @ 2024-07-11 21:00:59
@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang@zhaodongqiang
|
zhaodongqiang @ 2024-07-11 21:01:23
?
|
zhaodongqiang @ 2024-07-11 21:02:06
我去去去去去去去去去去去去去去去去去去去去去去去去去去去去去去你的
|
yuzihao @ 2024-07-11 21:36:55
我滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚滚你的
|
gezijian @ 2024-07-14 08:58:59
我去***的
|