Submission #1521146
Source Code Expand
#include<bits/stdc++.h> using namespace std; int MOD = 1000000007; long long int factorial(int n){ long long int factorial_ans = 1; for(; n != 0; n--) factorial_ans = (factorial_ans * n) % MOD; return factorial_ans; } long long int pow_mod(long long int pm_n, long long int pm_p){ if(pm_p == 0) return 1; else if(pm_p % 2 == 0){ long long int va = pow_mod(pm_n, pm_p / 2); return (va * va) % MOD; } else if(pm_p % 2 == 1) return (pow_mod(pm_n, pm_p - 1) * pm_n) % MOD; } int main(){ long long int a , b, c; cin >> a >> b >> c; long long int w = a * b / (a * b + a * c - b* c) - 1; long long int h = c * (w + 1) / b - 1; cout << w << " " << h << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 動的計画法 |
User | Masumi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 772 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 1 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 1 ms | 256 KB |
subtask2_09.txt | WA | 1 ms | 256 KB |
subtask2_10.txt | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 256 KB |
subtask2_12.txt | WA | 1 ms | 256 KB |
subtask2_13.txt | WA | 1 ms | 256 KB |
subtask2_14.txt | WA | 1 ms | 256 KB |
subtask2_15.txt | WA | 1 ms | 256 KB |
subtask2_16.txt | WA | 1 ms | 256 KB |
subtask2_17.txt | WA | 1 ms | 256 KB |
subtask2_18.txt | WA | 1 ms | 256 KB |
subtask2_19.txt | WA | 1 ms | 256 KB |
subtask2_20.txt | WA | 1 ms | 256 KB |
subtask2_21.txt | WA | 1 ms | 256 KB |
subtask2_22.txt | WA | 1 ms | 256 KB |
subtask2_23.txt | WA | 1 ms | 256 KB |
subtask2_24.txt | WA | 1 ms | 256 KB |
subtask2_25.txt | WA | 1 ms | 256 KB |
subtask2_26.txt | WA | 1 ms | 256 KB |
subtask2_27.txt | WA | 1 ms | 256 KB |
subtask2_28.txt | WA | 1 ms | 256 KB |
subtask2_29.txt | WA | 1 ms | 256 KB |
subtask2_30.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_42.txt | WA | 1 ms | 256 KB |
subtask2_43.txt | WA | 1 ms | 256 KB |
subtask2_44.txt | WA | 1 ms | 256 KB |
subtask2_45.txt | WA | 1 ms | 256 KB |
subtask2_46.txt | WA | 1 ms | 256 KB |
subtask2_47.txt | WA | 1 ms | 256 KB |
subtask2_48.txt | WA | 1 ms | 256 KB |
subtask2_49.txt | WA | 1 ms | 256 KB |