View Code of Problem 3850

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<stack>
#include<cmath>
using namespace std;

typedef long long ll;
const int N = 1e2 + 10;
ll a[N], b[N];
int n;


int main() {
#ifdef ACM_LOCAL
	freopen("./std.in", "r", stdin);
#endif
	int t;
	scanf("%d", &t);
	for (int Case = 1; Case <= t; Case++) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		for (int i = 1; i <= n; i++)
			scanf("%d", &b[i]);
		printf("Case #%d: ", Case);
		if (a[1] < b[1]) {
			printf("0\n");
			continue;
		}
		ll res = -1, res2;
		for (int i = 1; i <= n; i++) {
			int j = (i == 1 ? n : i - 1);
			if (b[i] > b[j]) {
				ll cnt = (a[i]) / (b[i] - b[j]);
				if (res == -1 || res > cnt) {
					res = cnt;
					res2 = i;
				}
			}
		}
		if (res == -1) {
			printf("INF\n");
		}
		else {
			printf("%lld\n", res*n + res2-1);
		}
	}
}