#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include <cstring>
using namespace std;
int i;
int main()
{
int n,k=1,jump;
cin >> n;
int pep[4] = { 0 };
for (i = 1; k <= n; i++)
{
if (i % 7 == 0 || i % 10 == 7 || i / 10 % 10 == 7 || i / 100 == 7)
{
jump = i % 4;
switch (jump)
{
case 0:
pep[0]++;
break;
case 1:
pep[1]++;
break;
case 2:
pep[2]++;
break;
case 3:
pep[3]++;
break;
}
}
else
{
k++;
}
}
for (int i = 1; i < 4; i++)
{
cout << pep[i] << endl;;
}
cout << pep[0];
return 0;
}
csp 201912-1 报数 100分解法
于 2023-03-16 16:25:36 首次发布