結果
問題 | No.487 2017 Calculation(2017の計算) |
ユーザー |
|
提出日時 | 2017-02-24 22:28:40 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,297 bytes |
コンパイル時間 | 1,594 ms |
コンパイル使用メモリ | 160,052 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2025-01-02 22:50:20 |
合計ジャッジ時間 | 2,271 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))#define rep(i,j) FOR(i,0,j)#define each(x,y) for(auto &(x):(y))#define mp make_pair#define mt make_tuple#define all(x) (x).begin(),(x).end()#define debug(x) cout<<#x<<": "<<(x)<<endl#define smax(x,y) (x)=max((x),(y))#define smin(x,y) (x)=min((x),(y))#define MEM(x,y) memset((x),(y),sizeof (x))#define sz(x) (int)(x).size()#define pb push_backtypedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;typedef vector<ll> vll;class mint{public:static long long MOD;mint():value(0){}mint(long long val):value(val<0?MOD+val%MOD:val%MOD){ }mint& operator+=(mint that){value = value+that.value;if(value>=MOD)value-=MOD;return *this;}mint& operator-=(mint that){value -= that.value;if(value<0)value+=MOD;return *this;}mint& operator*=(mint that){value = value * that.value % MOD;return *this;}mint &operator/=(mint that){return *this *= that.inverse();}mint operator+(mint that) const{return mint(*this)+=that;}mint operator-(mint that) const{return mint(*this)-=that;}mint operator*(mint that) const{return mint(*this)*=that;}mint operator/(mint that) const {return mint(*this) /= that;}mint operator^(long long k) const{if(value==0)return 0;mint n = *this, res = 1;while(k){if(k & 1)res *= n;n *= n;k >>= 1;}return res;}mint inverse() const {long long a = value, b = MOD, u = 1, v = 0;while(b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}return mint(u);}long long toll() const{ return value; }int toi() const{ return (int)value; }private:long long value;};long long mint::MOD = 1000000007ll;int main(){ios::sync_with_stdio(false);cin.tie(0);ll M;while(cin >> M) {mint::MOD = M;mint a = 2017;mint ans = a + ((a*a) ^ 2017);cout << ans.toi() << endl;}}