#768885 (C++17) No.8077 🔧

• 問題: No.8077 🔧
• ユーザー: karinohito
• 提出日時: 2022-06-07 22:43:39
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 1,937 bytes
• コンパイル時間: 1,903 ms
• コンパイル使用メモリ: 195,176 KB
• 最終ジャッジ日時: 2025-01-29 18:56:45
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 10

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
template<class T>
bool chmax(T& p, T q) {
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q) {
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll gcd(ll(a), ll(b)) {
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll Eugrid(ll A, ll B, ll& x, ll& y) {
    if (B == 0) {
        x = 1;
        y = 0;
        return A;
    }
    ll C = gcd(A, B);
    ll D = Eugrid(B, A % B, y, x);
    y -= A / B * x;
    return D;
}//Ax+By=gcd(A,B)の解
ll W,H;
ll N;
vector<pair<ll,ll>> P;
ll dfs(ll L,ll R,ll D,ll U){
    ll res=0;
    rep(p,N){
        ll X=P[p].first;
        ll Y=P[p].second;
        ll k=0;
        if(L<=X&&X<=R&&D<=Y&&Y<=U){
            k+=(R-L)+(D-U)-1;
            k+=dfs(L,X-1,D,Y-1);
            k+=dfs(L,X-1,Y+1,U);
            k+=dfs(X+1,R,D,Y-1);
            k+=dfs(X+1,R,Y+1,U);
        }
        chmax(res,k);
    }
    return res;
}
ll mod=1e9+7;
ll modPow(long long a, long long n, long long p=mod) {
  if(a==0)return 0;
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % p;
  if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
  long long t = modPow(a, n / 2, p);
  return (t * t) % p;
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll a,b,c,d,k;
    cin>>a>>b>>c>>d>>k;
    cout<<((a*b+c-d)%k+k)%k<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX