第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-446 递归输出数字

#include <stdio.h>
#define N 6
int main() {
    int m, n, a[N] = {0}, i;
    scanf("%d", &n);
    m = n;
    for (i = 0; i < N; i++) {
        a[i] = n % 10;
        n /= 10;
    }
    n = m;
    if (n >= 100000) {
        for (i = N - 1; i >= 0; i--)
            printf("%d ", a[i]);
        printf("\n");
    } else if (n >= 10000 && n < 100000) {
        for (i = N - 2; i >= 0; i--)
            printf("%d ", a[i]);
        printf("\n");
    } else if (n >= 1000 && n < 10000) {
        for (i = N - 3; i >= 0; i--)
            printf("%d ", a[i]);
        printf("\n");
    } else if (n >= 100 && n < 1000) {
        for (i = N - 4; i >= 0; i--)
            printf("%d ", a[i]);
        printf("\n");
    } else if (n >= 10 && n < 100) {
        for (i = N - 5; i >= 0; i--)
            printf("%d ", a[i]);
        printf("\n");
    } else if (n >= 0 && n < 10) {
        printf("%d\n", a[0]);
    }
    return 0;
}

#include <iostream>
#include<string>
using namespace std;
int n;
int len;
int a[1000];
int k=0;
void dfs()
{
  int x=n%10;
  n=n/10;
  a[k++]=x;
  if(n==0)
    return ;
  dfs();
}
int main()
{
  cin>>n;
  dfs();
  for(int i=k-1;i>=0;i--)
    cout<<a[i]<<" ";
  cout<<endl;
  return 0;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
  static StringBuilder builder = new StringBuilder();
  public static void main(String[] args) throws NumberFormatException, IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int num = Integer.parseInt(br.readLine());
    toPrint(num);
    System.out.print(builder.toString().trim());
  }
  public static void toPrint(int num) {
    if(num == 0) {
      return;
    }
    toPrint(num / 10);
    int temp = num % 10;
    builder.append(temp + " ");
  }
}

def fun():
    a=list(map(int,input()))
    for i in a:
        print(i,end=' ')
fun()