結果
問題 | No.435 占い(Extra) |
ユーザー |
![]() |
提出日時 | 2020-01-05 23:27:31 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,667 ms / 2,000 ms |
コード長 | 2,786 bytes |
コンパイル時間 | 1,675 ms |
コンパイル使用メモリ | 167,820 KB |
実行使用メモリ | 23,116 KB |
最終ジャッジ日時 | 2024-10-08 12:32:45 |
合計ジャッジ時間 | 25,550 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 32 |
コンパイルメッセージ
main.cpp: In function 'void init_primes()': main.cpp:27:23: warning: iteration 9999998 invokes undefined behavior [-Waggressive-loop-optimizations] 27 | if(!divprime[i]){ | ~~~~~~~~~~^ main.cpp:26:21: note: within this loop 26 | for(ll i = 2; i <= MAX_PRIME;i++){ | ~~^~~~~~~~~~~~
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1e9;const ll LINF = 1e18;inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out<< Mat[i];} return out; }template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }/*<url:https://yukicoder.me/problems/no/434>問題文=============================================================================================================================解説=============================================================================================================================*/const int MAX_PRIME = 1e7;short divprime[MAX_PRIME];void init_primes(){for(ll i = 2; i <= MAX_PRIME;i++){if(!divprime[i]){for(ll j = i*i; j <= MAX_PRIME;j+=i) divprime[j]=i;}}}const ll MOD = 9;// a^b % MOD;ll powmod(ll a,ll b) {ll res=1;a%=MOD; for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}template<class Type>Type solve(Type res = Type()){init_primes();int T; cin >> T;while(T--){ll N,X,A,B,M; cin >> N >> X >> A >> B >> M;ll ans = 0;int num[10] = {};for(int i = 0; i < N;i++){if(num[3] < 2){ll x = 1;for(int j = 2; j < 9;j++) x *= powmod(j,num[j]);ans += x*(X%10);}else{ans += 9*(X%10);}if(i < N-1){ll x = N-1-i;ll y = 1+i;while(divprime[x]){ num[divprime[x]%9]++; x /= divprime[x];}num[x%9]++;while(divprime[y]){ num[divprime[y]%9]--; y /= divprime[y];}num[y%9]--;}X = ((X^A)+B)%M;}while(ans>=10) ans = ans%10+ans/10;cout << ans << endl;}return res;}int main(void) {cin.tie(0); ios::sync_with_stdio(false);solve<ll>(0);//cout << fixed << setprecision(12) << solve<ll>() << endl;return 0;}