pat 精度问题

点击打开链接

老TLE，可以看出浮点运算的复杂程度远大于整数运算。怎么优化。。。

int main()

{
float f1, f2;
int dignum;
scanf("%d", &dignum);
scanf("%f %f", &f1, &f2);
float t1 = f1, t2 = f2;
int count1 = 0, count2 = 0;
while (t1>=1.0)
{
t1 /= 10;
count1++;
}
while (t2>=1.0)
{
t2 /= 10;
count2++;
}
while (t1<0.1)
{
t1 *= 10;
count1++;
}
while (t2<0.1)
{
t2 *= 10;
count2++;
}
if (abs(t1 - t2) < pow(10, -dignum)&&count1==count2)//表示相同
{
//ios::setp
printf("YES %.*f*10^%d\n",dignum,t1,f1>=0.1?count1:-count1);
}
else
{
printf("NO %.*f*10^%d %.*f*10^%d\n",f1>=0.1? count1:-count1, t1, f2>=0.1?count2:-count2, t2);
}
return 0;
}