1898846_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <math.h>
# include <string.h>
# include <stdlib.h>

int d[7];
int c[7];

int main()
{
	int i, n;
	long p, m;
	__int64 j;
	double s, ans;

	scanf("%d%ld",&n,&p);
	if(p==0)
	{
		printf("0\n");
		return 1;
	}
	m = p;
	for(i = n-1; i >= 0; i--)
	{
		d[i] = /*'0' + */m%10;
		m /= 10;
	}
	d[n] = '\0';
	for(j = 1; ; j++)
	{
		//s = j + p*1.0/pow(10,n);
		//s *= s;
		//s = floor(s) + 1;
		//ans = s;
		//s = sqrt(s);
		//s = s - floor(s);
		//for(i = 0; i < n; i++)
		//{
		//	s *= 10;
		//	c[i] = /*'0' + */floor(s);
		//	s -= floor(s);
		//	if(c[i]!=d[i])
		//		goto end;
		//}
		//printf("%.0lf\n",ans);break;
		//end : ;
		s = j + p*1.0/pow(10,n);
		s *= s;
		s = floor(s) + 1;
		ans = s;
		s *= pow(10,2*n);
		s = floor(sqrt(s));
		//printf("%ld %lf %lf\n",p,s,j*pow(10,n));
		//system("pause");
		if((double)p == s - j*pow(10,n))
		{
			printf("%.0lf\n",ans);
			break;
		}
	}
	return 1;
}