Submission #2096911
Source Code Expand
#include <iostream> using namespace std; #define MAX_N 1000 // 入力 int N; int T[MAX_N], A[MAX_N]; int main(void) { cin >> N; for (int i = 0; i < N; ++i) { cin >> T[i] >> A[i]; } long long vote_t = 1, vote_a = 1; for (int i = 0; i < N; ++i) { long long n_t, n_a; if (vote_t % T[i] == 0) { n_t = vote_t / T[i]; } else { n_t = vote_t / T[i] + 1; } if (vote_a % A[i] == 0) { n_a = vote_a / A[i]; } else { n_a = vote_a / A[i] + 1; } long long n = max(n_t, n_a); // cout << "n_t" << n_t << " n_a" << n_a << endl; // cout << "n: " << n << endl; vote_t = T[i] * n; vote_a = A[i] * n; // cout << vote_t << " " << vote_a << endl; } cout << vote_t + vote_a << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | sdub |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 903 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 2 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 1 ms | 256 KB |
1_012.txt | AC | 1 ms | 256 KB |
1_013.txt | AC | 2 ms | 256 KB |
1_014.txt | AC | 2 ms | 256 KB |