Submission #1752534

---

Source Code Expand

// Kenus the Ancient Greek
// * frank_c1
// * 2017 / 11 / 08

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int maxw = 87;
const int mo = (int)(1e9) + 7;
LL f[maxw + 10];
vector<pair<LL, LL> > g[maxw + 5];

void gen() {
	f[0] = f[1] = 1;
	for (int i = 2; i <= maxw + 3; ++i) f[i] = f[i - 1] + f[i - 2];
	g[0].push_back(make_pair(1, 1));
	for (int i = 0; i < maxw; ++i) {
		for (int j = 0; j < (int)g[i].size(); ++j) {
			LL y = g[i][j].first, x = g[i][j].second + y;
			while (x <= f[i] + f[i + 3]) {
				g[i + 1].push_back(make_pair(x, y)); x += y;
			}
		}
	}
}

LL calc(LL n, LL m, int p) {
	LL ret = 0;
	for (int j = 0; j < (int)g[p - 1].size(); ++j) {
		LL x = g[p - 1][j].first, y = g[p - 1][j].second;
		if (x <= m) (ret += (n - y) / x) %= mo;
	} return ret;
}

void solve() {
	LL n, m; 
	scanf("%lld%lld", &n, &m);
	if (n < m) swap(n, m);
	if (n == 2 && m == 2) {
		printf("1 4\n"); return;
	}
	if (m == 1) {
		printf("1 %d\n", n % mo); return;
	}
	int p = 2, res= 0;
	for (; n >= f[p + 1] && m >= f[p]; ++p); --p;
	printf("%d ", p); res = calc(n, m, p); 
	if (f[p + 1] <= m) res += calc(m, m, p);
	printf("%d\n", res % mo);
}

int main() {
	gen();
	int T; 
	scanf("%d", &T);
	while (T--) solve(); 
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:44:26: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘LL {aka long long int}’ [-Wformat=]
   printf("1 %d\n", n % mo); return;
                          ^
./Main.cpp:38:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &n, &m);
                           ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:56:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &T);
                 ^

Judge Result