L_Wheel of Numbers

• 2015 acm-icpc 예선
• Problem L Wheel of Numbers
• 구현 문제

int arr[111];
int arr2[10];

int convert2int(int *src, int digit)
{
	int d = powl(10, digit);
	int V = 0;
	for (int i = 0; i < digit; i++)
	{
		d /= 10;
		V += src[i] * d;
	}

	return V;
}
int main()
{
	int T;
	for (scanf("%d", &T); T--;)
	{
		int n, m;
		scanf("%d %d", &n, &m);
		int X, Y;

		for (int i = 0; i < m; i++)
			scanf("%d", &arr2[i]);
		X = convert2int(arr2, m);

		for (int i = 0; i < m; i++)
			scanf("%d", &arr2[i]);
		Y = convert2int(arr2, m);

		for (int i = 0; i < n; i++)
			scanf("%d", &arr[i]);

		for (int i = 0; i < m - 1; i++)
			arr[n + i] = arr[i];

		int R = 0;
		for (int i = 0; i < n; i++)
		{
			int Z = convert2int(arr + i, m);
			if (X <= Z && Z <= Y)
				++R;
		}
		printf("%d\n", R);
	}
	return 0;
}