Submission #3427678
Source Code Expand
#include <bits/stdc++.h> #define FOR(i, begin, end) for(int i=(begin);i<(end);i++) #define REP(i, n) FOR(i,0,n) #define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--) #define IREP(i, n) IFOR(i,0,n) #define SORT(a) sort(a.begin(), a.end()) #define REVERSE(a) reverse(a.begin(), a.end()) #define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define int long long #define INF 1000000000000000000 using namespace std; typedef vector<int> vec; typedef vector<vec> mat; typedef pair<int, int> Pii; template<typename T> void readvec(vector<T> &a); void readindex(vector<int> &a); signed main(){ int N; cin >> N; FOR(h, 1, 3501){ FOR(n, 1, 3501){ int a1 = N * h * n; int a2 = 4 * h * n - n * N - h * N; if(a2 > 0 && a1 % a2 == 0){ int w = a1 / a2; cout << h << " " << n << " " << w; return 0; } } } return 0; } template<typename T> void readvec(vector<T> &a){ REP(i, a.size()){ cin >> a[i]; } } void readindex(vector<int> &a){ REP(i, a.size()){ cin >> a[i]; a[i]--; } }
Submission Info
Submission Time | |
---|---|
Task | C - 4/N |
User | sumitacchan |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1315 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0002, 3485, 4664 |
All | 0002, 0003, 0004, 0005, 0006, 0007, 0049, 0073, 0097, 0121, 0137, 0139, 0156, 0163, 0169, 0181, 0191, 0223, 0229, 0263, 0271, 0289, 0361, 0481, 0529, 0551, 0649, 0720, 0916, 1081, 1156, 1498, 1921, 2041, 2329, 2449, 2568, 2918, 2929, 3289, 3429, 3485, 3763, 4081, 4277, 4648, 4652, 4656, 4660, 4664 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0002 | AC | 1 ms | 256 KB |
0003 | AC | 1 ms | 256 KB |
0004 | AC | 1 ms | 256 KB |
0005 | AC | 1 ms | 256 KB |
0006 | AC | 1 ms | 256 KB |
0007 | AC | 1 ms | 256 KB |
0049 | AC | 1 ms | 256 KB |
0073 | AC | 1 ms | 256 KB |
0097 | AC | 1 ms | 256 KB |
0121 | AC | 1 ms | 256 KB |
0137 | AC | 1 ms | 256 KB |
0139 | AC | 1 ms | 256 KB |
0156 | AC | 1 ms | 256 KB |
0163 | AC | 1 ms | 256 KB |
0169 | AC | 1 ms | 256 KB |
0181 | AC | 1 ms | 256 KB |
0191 | AC | 1 ms | 256 KB |
0223 | AC | 1 ms | 256 KB |
0229 | AC | 1 ms | 256 KB |
0263 | AC | 1 ms | 256 KB |
0271 | AC | 1 ms | 256 KB |
0289 | AC | 1 ms | 256 KB |
0361 | AC | 1 ms | 256 KB |
0481 | AC | 1 ms | 256 KB |
0529 | AC | 1 ms | 256 KB |
0551 | AC | 1 ms | 256 KB |
0649 | AC | 2 ms | 256 KB |
0720 | AC | 2 ms | 256 KB |
0916 | AC | 2 ms | 256 KB |
1081 | AC | 2 ms | 256 KB |
1156 | AC | 2 ms | 256 KB |
1498 | AC | 2 ms | 256 KB |
1921 | AC | 2 ms | 256 KB |
2041 | AC | 3 ms | 256 KB |
2329 | AC | 3 ms | 256 KB |
2449 | AC | 3 ms | 256 KB |
2568 | AC | 3 ms | 256 KB |
2918 | AC | 3 ms | 256 KB |
2929 | AC | 3 ms | 256 KB |
3289 | AC | 4 ms | 256 KB |
3429 | AC | 4 ms | 256 KB |
3485 | AC | 4 ms | 256 KB |
3763 | AC | 4 ms | 256 KB |
4081 | AC | 4 ms | 256 KB |
4277 | AC | 5 ms | 256 KB |
4648 | AC | 5 ms | 256 KB |
4652 | AC | 5 ms | 256 KB |
4656 | AC | 5 ms | 256 KB |
4660 | AC | 5 ms | 256 KB |
4664 | AC | 5 ms | 256 KB |