#include #include #includeusingnamespace std;typedeflonglong LL;intmain() {LL a, b, n;cin >> a >> b >> n;LL s &#61;5* a &#43;2* b;LL res &#61; n / s *7;n %&#61; s;LL d[]&#61;{a, a, a, a, a, b, b};for(int i &#61;0; n >0; i &#43;&#43;){n -&#61; d[i];res &#43;&#43;;}cout << res << endl;return0; }
修建灌木
规律题&#xff0c;手动模拟两边就可以了
#include #include #includeusingnamespace std;intmain() {int n;cin >> n;for(int i &#61;1; i <&#61; n; i &#43;&#43;)cout <<max(i -1, n - i)*2<< endl;return0; }
#include #include #includeusingnamespace std;typedeflonglong LL;constint N &#61;100010, MOD &#61;1000000007;int n, m1, m2, m; int a[N], b[N];intmain() {scanf("%d",&n);scanf("%d",&m1);for(int i &#61; m1 -1; i >&#61;0; i --)scanf("%d",&a[i]);scanf("%d",&m2);for(int i &#61; m2 -1; i >&#61;0; i --)scanf("%d",&b[i]);int m &#61;max(m1, m2);int res &#61;0;for(int i &#61; m -1; i >&#61;0; i --)//从高位向低位求res &#61;(res *(LL)max({2, a[i]&#43;1, b[i]&#43;1})&#43; a[i]- b[i])% MOD;printf("%d\n", res);return0; }