結果
問題 | No.965 門松列が嫌い |
ユーザー |
![]() |
提出日時 | 2020-01-13 20:27:13 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,898 bytes |
コンパイル時間 | 1,267 ms |
コンパイル使用メモリ | 150,160 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-30 16:03:58 |
合計ジャッジ時間 | 1,641 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
コンパイルメッセージ
main.cpp:1:18: warning: '#pragma comment linker' ignored [-Wignored-pragmas] 1 | #pragma comment (linker, "/STACK:256000000") | ^ 1 warning generated.
ソースコード
#pragma comment (linker, "/STACK:256000000")#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <algorithm>#include <utility>#include <functional>#include <cstring>#include <queue>#include <stack>#include <math.h>#include <iterator>#include <vector>#include <string>#include <set>#include <math.h>#include <iostream>#include <random>#include<map>#include <iomanip>#include <time.h>#include <stdlib.h>#include <list>#include <typeinfo>#include <list>#include <set>#include <cassert>#include<fstream>#include <unordered_map>#include <unordered_set>#include <cstdlib>#include <complex>#include <cctype>#include <bitset>using namespace std;typedef string::const_iterator State;const long double Ma_PI = 3.1415926535897932384626433832795028841971L;#define eps 1e-15L#define LONG_INF 2000000000000000000LL#define GOLD 1.61803398874989484820458#define MAX_MOD 1000000007LL#define GYAKU 500000004LL#define MOD 998244353LL#define seg_size 262144*2#define pb push_back#define mp make_pairtypedef long long ll;#define REP(a,b) for(long long a = 0;a < b;++a)#define ALL(x) (x).begin(),(x).end()void init() {iostream::sync_with_stdio(false);cout << fixed << setprecision(100);}unsigned long xor128() {static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;unsigned long t = (x ^ (x << 11));x = y; y = z; z = w;return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));}typedef struct BigInt {string s = "0";BigInt operator +(BigInt obj) {string c;while (max(obj.s.length(), this->s.length()) + 1 > c.length()) {c.pb('0');}for (int q = 0; q < obj.s.length(); ++q) {c[c.length() - 1 - q] = obj.s[obj.s.length() - q - 1];}for (int q = 0; q < this->s.length(); ++q) {c[c.length() - 1 - q] += this->s[this->s.length() - 1 - q] - '0';if (c[c.length() - 1 - q] > '9') {c[c.length() - 2 - q]++;c[c.length() - 1 - q] -= 10;}}if (c.front() == '0') {c.erase(c.begin());}return BigInt{ c };}BigInt operator *(BigInt obj) {BigInt ans;for (int i = this->s.length() - 1; i >= 0; --i) {REP(q, this -> s[i] - '0') {ans = ans + obj;}obj.s.pb('0');}return ans;}}BigInt;void solve() {int a, b, c;cin >> a >> b >> c;if (a < b && b < c) {cout << 0 << endl;return;}if (c < b && b < a) {cout << 0 << endl;return;}if (a == b || b == c || a == c) {cout << 0 << endl;return;}int ans = min({ llabs(a - c) ,llabs(a - b),llabs(b - c) });cout << ans << endl;}#undef intint main() {init();solve();}