結果
問題 | No.383 レーティング |
ユーザー |
![]() |
提出日時 | 2016-07-07 18:47:35 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,529 bytes |
コンパイル時間 | 1,009 ms |
コンパイル使用メモリ | 102,204 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-12 23:17:47 |
合計ジャッジ時間 | 1,992 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 14 |
ソースコード
#include <vector>#include <list>#include <map>#include <set>#include <queue>#include <deque>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <ctime>#include <fstream>using namespace std;inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }template<class T> inline T sqr(T x) { return x*x; }typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<string> vs;typedef pair<int, int> pii;typedef long long ll;//repetition//------------------------------------------#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define rep(i,n) FOR(i,0,n)#define P(p) cout<<(p)<<endl;#define VEC_2D(a,b) vector<vector<int> >(a, vector<int>(b, 0))#define ALL(a) (a).begin(),(a).end()#define RALL(a) (a).rbegin(), (a).rend()#define pb push_back#define mp make_pair#define INF (1100000000)#define SZ(a) int((a).size())#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)#define EXIST(s,e) ((s).find(e)!=(s).end())#define SORT(c) sort((c).begin(),(c).end())#define MOD 1000000007LLint gcd(int x, int y) {if (y == 0) return x;else return gcd(y, x%y);}int lcm(int a, int b) {return a / gcd(a, b) * b;}bool is_prime(int n) {for (int i = 2; i * i <= n; i++) {if (n % i == 0) return false;}return n != 1;}map<int, int> prime_factor(int n) {map<int, int> res;for (int i = 2; i * i <= n; i++) {while (n % i == 0) {++res[i];n /= i;}}if (n != 1) res[n] = 1;return res;}int extgcd(int a, int b, int& x, int& y) {//int d = a;if (b != 0) {d = extgcd(b, a%b, y, x);y -= (a / b)*x;}else {x = 1; y = 0;}return d;}ll mod_pow(ll x, ll n, ll mod) {if (n == 0) return 1;ll res = mod_pow(x * x % mod, n / 2, mod);if (n & 1) res = res * x % mod;return res;}vector<string> split(const string &str, char delim) {vector<string> res;size_t current = 0, found;while ((found = str.find_first_of(delim, current)) != string::npos) {res.push_back(string(str, current, found - current));current = found + 1;}res.push_back(string(str, current, str.size() - current));return res;}bool is_kadomatsu(int a, int b, int c) {if (a == b || a == c || b == c)return false;if (a > b && c > b) return true;if (a < b && c < b)return true;return false;}struct UF {int n;vi d;UF(){}UF(int n):n(n),d(n,-1){}int root(int v) {if (d[v] < 0) return v;return d[v] = root(d[v]);}bool unite(int x, int y) {x = root(x); y = root(y);if (x == y) return false;if (size(x) < size(y)) swap(x, y);d[x] += d[y];d[y] = x;return true;}int size(int v) { return -d[root(v)]; }};int main() {int a, b;cin >> a >> b;if (b > a) {cout << "+" << (b - a) << endl;}else {cout << b - a << endl;}//ifstream ifs("ego-gplus_.txt"); //グラフの読み込み//ofstream output("ego-gplus_uniform_sampling_experiment_3times_percent.txt");//int a, b;//double c;//double d;//for (int i = 0; i < 17; i++) {// ifs >> a >> b >> c;// output << a << " " << b << " " << 1 << endl;// rep(j, 16) {// ifs >> a >> b >> d;// output << a << " " << b << " " << d/c<<endl;// }//}return 0;}