阿姆斯特朗数.txt

 # include <stdio.h>

 long power (x,n)
 int x,n;
  {long p;
   for(p=1;n>0;--n)
        p*=x;
        return (p);
  }
  main()
  {int a,i,j,n,s,b[100],t=0;
     long k;
    scanf("%d",&n);

   for(i=power(10,n-1);i<=power(10,n);i++)
    {
      a=i;
      j=0;
      while(a>0)
       {b[j]=a%10;
         a=a/10;
        j++;
       }
        s=0;
    for(j=0;j<n;j++)
       s=s+power(b[j],n);

   if(s==i)
       { printf("%d/",s);
         t=1;