Submission #5072160
Source Code Expand
/* title: url: */ #include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <functional> #include <queue> #include <limits> #include <string> #include <utility> #include <cstring> #include <map> #include <cmath> #include <iterator> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define INF 1000000007 typedef pair<int, int> pint; typedef long long ll; #define int ll //get vector of prime numbers which is lower than or equal n vector<int> get_primes(int n) { vector<bool> is_prime(n + 1, true); vector<int> res; is_prime[0] = is_prime[1] = false; for (int i = 2; i <= n; i++) { if (is_prime[i]) { res.push_back(i); for (int j = 2 * i; j < is_prime.size(); j = j + i) { is_prime[j] = false; } } } return res; } vector<pair<int, int>> factorize(int n) { vector<pair<int, int>> res; for (int i = 2; i * i <= n; i++) { int tmp = 0; while (n % i == 0) { tmp++; n /= i; } res.push_back(make_pair(i, tmp)); } if (n != 1) { res.push_back(make_pair(n, 1)); } return res; } int mpow(int x, int n) { int res = 1; while (n != 0) { if (n & 1) res = res * x % INF; x = x * x % INF; n = n >> 1; } return res; } //mod frac vector<int> mfrac; void set_mfrac(int n) { if (mfrac.size() == 0) { mfrac.push_back(1); } for (int i = mfrac.size(); i <= n; i++) { mfrac.push_back((i * mfrac[i - 1]) % INF); } } //get nCm mod INF int mcomb(int n, int m) { if (mfrac.size() <= n) { set_mfrac(n); } int res = mfrac[n]; res = res * mpow(mfrac[m], INF - 2) % INF; res = res * mpow(mfrac[n - m], INF - 2) % INF; return res; } vector<int> get_gcd(int n) { vector<int> res; for (int i = 1; i * i <= n; i++) { if (n % i == 0) { if (i * i == n) { res.push_back(i); } else { res.push_back(i); res.push_back(n / i); } } } return res; } signed main() { int A, B; cin >> A >> B; cout << A - B << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 積雪深差 |
User | LoveMachine |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2494 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |