ACM从零开始---电子科大POJ "a^b"

a ^ b

Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)



C-sources:
#include
int main()
{
    unsigned int number;
    unsigned int a,b;
    unsigned int *result=NULL;
    int i,temp;

    scanf("%d",&number);

    temp=number;

    result=(unsigned int*)malloc(number*sizeof(unsigned int));

    for(i=0;i999)
                printf("%u\n",result[i]);
            else if(result[i]>0&&result[i]<999)
                printf("%04u\n",result[i]);
            else if(result[i]>9999&&result[i]<=99999)
                printf("%u\n",result[i]%10000);
            else if(result[i]>99999&&result[i]<=999999)
                printf("%u\n",result[i]%100000);
            else
                printf("%u\n",result[i]%1000000);

        }


    free(result);
    result=NULL;
    return 0;
}


转载请注明作者:小刘

你可能感兴趣的:(算法,ACM)