Submission #8522952
Source Code Expand
#include <algorithm> #include <cmath> #include <cstring> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> using namespace std; #define rep(i, n) for(int i = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int i = (m); (i) < (n); (i)++) #define All(v) (v).begin(), (v).end() #define MP make_pair #define pb push_back typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1 << 30; const ll LINF = 1LL << 61; const int MOD = 1e9 + 7; int main() { int A, B, C; cin >> A >> B >> C; ll K; cin >> K; if(K % 2 == 0) { cout << A - B << endl; } else { cout << B - A << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Fairness |
User | rokahikou |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 788 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |