【 Problem description 】

The recurrence formula of Fibonacci sequence is ：Fn = Fn−1 + Fn−2, among F1 = F2 = 1.
Excuse me, , Fibonacci Series No 1 to 202202011200 term （ contain ） in , How many items have a bit of 7.

【 Problem solving 】

If the normal running cycle , It will take a long time . If you use recursion, it will overflow . So I choose to find rules .

【 Code 】

Java：

public class A {

public static void main(String[] args) {

int a = 1;
int b = 1;
for (int i = 0; i < 120; i++) {

System.out.println("F" + (i + 1) + " : " + a);
int ret = a + b;
if (ret >= 10) {

ret %= 10;
}
a = b;
b = ret;
}
}
}

Python：

a = 1
b = 1
for i in range(120):
print(f"F{
i + 1} = {
a}")
ret = a + b
if ret >= 10:
ret %= 10
a, b = b, ret