Submission #1484574
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; using llng = long long; template<typename T> using v = vector<T>; template<typename T> using vv = v<v<T> >; const llng MOD = 1e9+7; llng inv(llng n) { llng d = MOD - 2, ret = 1; while (d > 0) { if (d % 2 == 1) (ret *= n) %= MOD; (n *= n) %= MOD; d /= 2; } return ret; } int main() { llng A, B, C; cin >> A >> B >> C; llng dr = (((B-A+MOD)%MOD) * C) % MOD; llng dc = (((C-A+MOD)%MOD) * B) % MOD; llng n = ((A*B)%MOD + (MOD - (B*C)%MOD) + (C*A)%MOD) % MOD; llng r = (dr * inv(n)) % MOD; llng c = (dc * inv(n)) % MOD; cout << r << " " << c << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 動的計画法 |
User | hidollara |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 756 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt, subtask2_41.txt, subtask2_42.txt, subtask2_43.txt, subtask2_44.txt, subtask2_45.txt, subtask2_46.txt, subtask2_47.txt, subtask2_48.txt, subtask2_49.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 9 ms | 764 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 1 ms | 256 KB |
subtask2_02.txt | AC | 1 ms | 256 KB |
subtask2_03.txt | AC | 1 ms | 256 KB |
subtask2_04.txt | AC | 1 ms | 256 KB |
subtask2_05.txt | AC | 1 ms | 256 KB |
subtask2_06.txt | AC | 1 ms | 256 KB |
subtask2_07.txt | AC | 1 ms | 256 KB |
subtask2_08.txt | AC | 1 ms | 256 KB |
subtask2_09.txt | AC | 1 ms | 256 KB |
subtask2_10.txt | AC | 1 ms | 256 KB |
subtask2_11.txt | AC | 1 ms | 256 KB |
subtask2_12.txt | AC | 1 ms | 256 KB |
subtask2_13.txt | AC | 1 ms | 256 KB |
subtask2_14.txt | AC | 1 ms | 256 KB |
subtask2_15.txt | AC | 1 ms | 256 KB |
subtask2_16.txt | AC | 1 ms | 256 KB |
subtask2_17.txt | AC | 1 ms | 256 KB |
subtask2_18.txt | AC | 1 ms | 256 KB |
subtask2_19.txt | AC | 1 ms | 256 KB |
subtask2_20.txt | AC | 1 ms | 256 KB |
subtask2_21.txt | AC | 1 ms | 256 KB |
subtask2_22.txt | AC | 1 ms | 256 KB |
subtask2_23.txt | AC | 1 ms | 256 KB |
subtask2_24.txt | AC | 1 ms | 256 KB |
subtask2_25.txt | AC | 1 ms | 256 KB |
subtask2_26.txt | AC | 1 ms | 256 KB |
subtask2_27.txt | AC | 1 ms | 256 KB |
subtask2_28.txt | AC | 1 ms | 256 KB |
subtask2_29.txt | AC | 1 ms | 256 KB |
subtask2_30.txt | AC | 1 ms | 256 KB |
subtask2_31.txt | AC | 1 ms | 256 KB |
subtask2_32.txt | AC | 1 ms | 256 KB |
subtask2_33.txt | AC | 1 ms | 256 KB |
subtask2_34.txt | AC | 1 ms | 256 KB |
subtask2_35.txt | AC | 1 ms | 256 KB |
subtask2_36.txt | AC | 1 ms | 256 KB |
subtask2_37.txt | AC | 1 ms | 256 KB |
subtask2_38.txt | AC | 1 ms | 256 KB |
subtask2_39.txt | AC | 1 ms | 256 KB |
subtask2_40.txt | AC | 1 ms | 256 KB |
subtask2_41.txt | AC | 1 ms | 256 KB |
subtask2_42.txt | AC | 1 ms | 256 KB |
subtask2_43.txt | AC | 1 ms | 256 KB |
subtask2_44.txt | AC | 1 ms | 256 KB |
subtask2_45.txt | AC | 1 ms | 256 KB |
subtask2_46.txt | AC | 1 ms | 256 KB |
subtask2_47.txt | AC | 1 ms | 256 KB |
subtask2_48.txt | AC | 1 ms | 256 KB |
subtask2_49.txt | AC | 1 ms | 256 KB |