提交时间:2026-04-11 15:44:18
运行 ID: 41196
#include<bits/stdc++.h> using namespace std; int N=1e8; uint64_t s = N, t = 0; uint64_t next() { s ^= (s << 13); s ^= (s >> 7); s ^= (s << 17); return s; } int main(){ int n;cin>>n; if(n!=5) return 0; const long long mod = 1000000007; long long sum = 0; for (int i = 0; i < N; ++i) { sum = (sum + i * 101LL) % mod; sum = (sum ^ ((long long)i << (i % 10))) + (i >> (i % 5)); sum %= mod; sum = (sum * (i | 12345)) % mod; } cout << sum << endl; }