Submission #2667867
Source Code Expand
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,r) RFOR(i,0,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define lower(a,x) lower_bound(all(a), x) - a.begin();
#define COUNT(a,x) upper_bound(all(a), x) - lower_bound(all(a), x);
#define MCOUNT(a,x,y) upper_bound(all(a), y) - lower_bound(all(a), x);
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end());
#define scan(x) scanf("%lld",&x);
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
typedef set<ll> SET;
typedef double D;
const ll inf = 5555555555555555555;
const ll mod = 1000000007;
const D pi = acos(-1);
const D eps = 1e-10;
ll n = 0, m = 0, ans = 0, sum = 0, cnt = 0, tmp = 0, ma = 0, mi = 0;
string s;
bool ok, flag;
ll dx[4] = { 1,-1,0,0 }, dy[4] = { 0,0,1,-1 };
ll ddx[9] = { 1,-1,0,0,1,1,-1,-1,0 }, ddy[9] = { 0,0,1,-1,1,-1,1,-1,0 };
#pragma endregion
#define MAX 111111
int main(void) {
cin >> n;
ll x, y;
FOR(h, 1, 3501) {
FOR(w, 1, 3501) {
x = 4 * h*w - h * n - w * n;
y = n * h * w;
if (x <= 0) continue;
if (y % x == 0) {
cout << h << " " << w << " " << y / x << endl;
return 0;
}
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 4/N |
User |
hide1214 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1680 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 |
2 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 |