POJ-1001

Sample Output

548815620517731830194541.899025343415715973535967221869852721
.00000005148554641076956121994511276767154838481760200726351203835429763013462401
43992025569.928573701266488041146654993318703707511666295476720493953024
29448126.764121021618164430206909037173276672
90429072743629540498.107596019456651774561044010001
1.126825030131969720661201

Hint

If you don't know how to determine wheather encounted the end of input: 
s is a string and  n is an integer 
C++

while(cin>>s>>n)

{

...

}

c

while(scanf("%s%d",s,&n)==2) //to  see if the scanf read in as many items as you want

/*while(scanf(%s%d",s,&n)!=EOF) //this also work    */

{

...

}

 

Source

 
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void main()
{
    char s[7],str1[200]="0";
    int i,n,L,ls,j,k,ls1,len,index;
    int del,del1,del2,ii;
    int tmp1,tmp2,tmp3,flag1=0,flag2=0,tmp4,flag3=0;


    for(ii=0;ii<200;str1[ii]='0',ii++); 


    while(scanf("%s%d",s,&n)!=EOF) {
        if(n<=0||n>25) continue;
        flag3=0;
        //cal the del
        ls=strlen(s);
        for(i=0,del=0;i<ls;i++){
            if(del) s[i-1]=s[i];
            if(s[i]=='.') del=ls-i-1; 
        }
        if(del) {ls--;s[ls]='\0';}


        char data1[200]="1.0";
        for(i=n;i>0;i--){
            //data1*=data;
            ls1=strlen(data1);
            for(k=0,del1=0;k<ls1;k++){
                if(del1) data1[k-1]=data1[k];
                if(data1[k]=='.') del1=ls1-k-1; 
            }
            if(del1) {ls1--;data1[ls1]='\0';}


            for(j=ls-1;j>=0;j--){
                flag1=0;
                flag2=0;
                for(k=ls1-1;k>=0;k--){
                    tmp4=str1[j+k+1]-48;
                    tmp1=s[j]-48;
                    tmp2=data1[k]-48;
                    tmp3=tmp1*tmp2+flag1;
                    if(tmp3>9){
                        flag1=tmp3/10;
                        tmp3=tmp3%10;
                    }
                    else flag1=0;
                    tmp4=tmp4+tmp3+flag2;
                    if(tmp4>9){
                        flag2=1;
                        tmp4=tmp4%10;
                    }
                    else flag2=0;
                    str1[j+k+1]=tmp4+'0';
                    //printf("str1[%d]=%c\n",k+j+1,str1[j+k+1]);
                }
                str1[j+k]=flag1+flag2+'0';


            }
            len=ls+ls1;
            del2=del+del1;
            if(del2){
                data1[len-del2]='.';
                len++;
                data1[len]='\0';
            }


            for(index=0;index<len;index++){
                if(index<len-del2-1) {
                    data1[index]=str1[index];
                }
                else
                    data1[index+1]=str1[index];
                //printf("data1[%d]=%c,str1[%d]=%c\n",index,data1[index],index,str1[index]);
                str1[index]='0';
            }
        }
        L = strlen(data1);
        for (i=L-1;i>=0;i--) {
            if(data1[i]=='0'&&flag3==0) flag3=0;
            else flag3=1;
            if(flag3==0) data1[i]='\0';
            else break;
        }
        if(data1[i]=='.') data1[i]='\0';
        L=strlen(data1);
        for (flag3=0,i=0;i<L;i++) {
            if (data1[i]=='0'&&flag3==0) flag3=0;
            else flag3=1;
            if(flag3) putchar(data1[i]);
        }
        putchar('\n');
   }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值