201912-1 报数
#include<iostream>
using namespace std;
bool isJ(int n) {
if (n % 7 == 0) return false;
while (n > 0) {
if (n % 10 == 7) return false;
n /= 10;
}
return true;
}
int main()
{
int n, current = 1;
int a[4] = { 0 };
cin >> n;
while (n--) {
if (!isJ(current++)) {
a[(current-2)%4]++;
n++;
}
}
cout << a[0] << endl << a[1] << endl << a[2] << endl << a[3] << endl;
return 0;
}