[R语言] 螺旋方阵 数学黑洞 数值分解

#include<stdio.h>
int a[20][20];
void f(int left,int right,int up,int down,int V)
{
  int i ,j ,k ,l;
  if(left<=right)
  {
    for(i = left;i<=right;i++)
    a[up][i] = V++;
    for(j = up+1;j<=down;j++)
    a[j][right] = V++;
    for(k = right-1;k>=left;k--)
     a[down][k] = V++;
    for(l = down-1;l>up;l--)
    a[l][left] = V++;
    f(left+1,right-1,up+1,down-1,V);
  }
}
int main()
{
  int n,m,i,j;
  scanf("%d",&m);
  while(m--)
  {
    scanf("%d",&n);
    f(1,n,1,n,1);
    for(i = 1;i<=n;i++)
    {
      for(j = 1;j<n;j++)
      printf("%d\t",a[i][j]);
      printf("%d\n",a[i][j]);
    }
    printf("\n");
  }
  return 0;
}

#include <stdio.h>
#include <stdlib.h>
int cnt;
void f(int n)
{
  int a[5] = {0}, i, j,temp;
  for(i = 0; i < 4; i++)
  {
    a[i] = n%10;
    n /= 10;
  }
  for( i = 0; i < 3; i++)
  {
    for(j = 0; j < 3-i; j++)
    {
      if(a[j] > a[j+1])
      {
        temp  =a[j];
        a[j] = a[j+1];
        a[j+1] = temp;
      }
    }
  }
  int max = 0, min = 0;
  int d = 10;
  for( i = 0; i < 4; i++)
  {
    max = max*d+a[3-i];
    min = min*d+a[i];
  }
  int poor = max - min;
  if(poor == 6174)
  {
    cnt++;
    printf("%d \n", poor);
    printf("%d\n", cnt);
  }
  else
  {
    printf("%d ", poor);
    cnt++;
    f(poor);
  }
}
int main()
{
  int n;
  while(scanf("%d", &n)!=EOF)
  {
    cnt = 0;
    f(n);
  }
  return 0;
}

#include<stdio.h>
int main()
{
  int mui;
  int num, count;
  while(scanf("%d",&num)!=EOF)
  {
    mui = 1;
    count = 0;
    while(num > 4)
    {
      num = num - 3;
      printf("3 ");
      count ++;
      mui = mui * 3;
    }
    if (num <= 4) count ++;
    printf("%d \n",num);
    printf("%d %d\n",count, mui * num);
  }
  return 0;
}