华为oj 记负均正&&自守数

<pre name="code" class="cpp">#include<iostream>
using namespace std;

int main()
{
	int n;
	while (cin >> n)
	{
		int *num = new int[n];
		int cnt1 = 0, cnt2 = 0, sum = 0;
		int i;

		for (i = 0; i < n; i++)
			cin >> num[i];

		for (i = 0; i < n; i++)
		{
			if (num[i] < 0)
				cnt1++;
			else if (num[i]>0)
			{
				cnt2++;
				sum += num[i];
			}
		}
		if (sum == 0)
		{
			cout << cnt1 << ' ' << 0;
		}			
		else if (sum%cnt2 == 0)
		{
			cout << cnt1 << ' ' << sum / cnt2;
		}
		else
		{
			cout << cnt1 << ' ' << sum / cnt2 << '.' << (sum * 10 / cnt2) % 10;
		}

	}
	return 0;
}

#include<iostream>
using namespace std;
bool IsNum(int i)
{
	int s = i*i;
	while (i)
	{
		if (s % 10 == i % 10)
		{
			s = s / 10;
			i = i / 10;
		}
		else
		{
			break;
		}
	}
	if (!i)
	{
		return true;
	}
	else
	{
		return false;
	}
}
int main()
{
	int n, count = 0;
	cin >> n;
	if (n < 0)
	{
		return 0;
	}
	for (int i = 0; i <= n; i++)
	{
		if (IsNum(i))
		{
			count++;
		}
	}
	cout << count << endl;
	return 0;
}