็ตๆ
ๅ้ก | No.8077 ๐ง |
ใฆใผใถใผ |
![]() |
ๆๅบๆฅๆ | 2021-04-03 15:59:42 |
่จ่ช | C++14 (gcc 13.3.0 + boost 1.87.0) |
็ตๆ |
AC
|
ๅฎ่กๆ้ | 3 ms / 2,000 ms |
ใณใผใ้ท | 732 bytes |
ใณใณใใคใซๆ้ | 1,903 ms |
ใณใณใใคใซไฝฟ็จใกใขใช | 164,824 KB |
ๅฎ่กไฝฟ็จใกใขใช | 5,248 KB |
ๆ็ตใธใฃใใธๆฅๆ | 2024-12-24 21:56:22 |
ๅ่จใธใฃใใธๆ้ | 2,652 ms |
ใธใฃใใธใตใผใใผID ๏ผๅ่ๆ ๅ ฑ๏ผ |
judge5 / judge1 |
๏ผ่ฆใญใฐใคใณ๏ผ
ใใกใคใซใใฟใผใณ | ็ตๆ |
---|---|
sample | AC * 3 |
other | AC * 10 |
ใฝใผในใณใผใ
#include "bits/stdc++.h"//#include "atcoder/all"using namespace std;//using namespace atcoder;//using mint = modint1000000007;//const int mod = 1000000007;//using mint = modint998244353;//const int mod = 998244353;//const int INF = 1e9;//const long long LINF = 1e18;#define rep(i, n) for (int i = 0; i < (n); ++i)#define rep2(i,l,r)for(int i=(l);i<(r);++i)#define rrep(i, n) for (int i = (n-1); i >= 0; --i)#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)#define all(x) (x).begin(),(x).end()#define allR(x) (x).rbegin(),(x).rend()#define endl "\n"int main() {ios::sync_with_stdio(false);cin.tie(nullptr);long long A, B, C, D, K;cin >> A >> B >> C >> D >> K;cout << (A * B + C - D) % K << endl;return 0;}