niven numbers.txt

以前ACM在哈工程HRBEU做的一些简单题目

#include   <stdio.h>
#include <string>
using namespace std;

int main()
{
long b;
char num[32];
int cases;
scanf("%d",&cases );
long sum , sum1;
long   t;
int k =1;
int len , i;
while(k <= cases)
{
    while(scanf("%d",&b)!=EOF) 
    {
    if( b==0 )
     break;
    scanf("%s",num);
    len = strlen(num);
     sum = 0;
     t = 1;
     sum1 = 0;
     i=len-1;
     while(i >= 0)
     {
      sum1 += (num[i]-48 );
      sum +=( (num[i]-48)*t );
      t =t * b;
      i--;
     }

     if(sum % sum1 == 0)
      printf("yes\n");
     else 
      printf("no\n");
    }
    if( k != cases ) 
    printf("\n");
   k++;
}
return 0;
}