Submission #1816015
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(X,Y) ((X)>(Y)?X=(Y),true:false) #define chmax(X,Y) ((X)<(Y)?X=(Y),true:false) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} int main(){ ll d; cin>>d; rep(b0, 3500) rep(c0, 3500){ ll b = b0+1, c = c0+1; ll x = b*c*d, y = 4*b*c-b*d-c*d; if(y==0 || x/y<0) continue; if(x%y==0){ cout<<x/y<<" "<<b<<" "<<c<<endl; return 0; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 4/N |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1405 Byte |
Status | AC |
Exec Time | 65 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 | 2 ms | 256 KB |
0073 | AC | 2 ms | 256 KB |
0097 | AC | 2 ms | 256 KB |
0121 | AC | 2 ms | 256 KB |
0137 | AC | 2 ms | 256 KB |
0139 | AC | 2 ms | 256 KB |
0156 | AC | 3 ms | 256 KB |
0163 | AC | 3 ms | 256 KB |
0169 | AC | 3 ms | 256 KB |
0181 | AC | 3 ms | 256 KB |
0191 | AC | 3 ms | 256 KB |
0223 | AC | 3 ms | 256 KB |
0229 | AC | 3 ms | 256 KB |
0263 | AC | 4 ms | 256 KB |
0271 | AC | 4 ms | 256 KB |
0289 | AC | 4 ms | 256 KB |
0361 | AC | 5 ms | 256 KB |
0481 | AC | 6 ms | 256 KB |
0529 | AC | 6 ms | 256 KB |
0551 | AC | 6 ms | 256 KB |
0649 | AC | 7 ms | 256 KB |
0720 | AC | 8 ms | 256 KB |
0916 | AC | 10 ms | 256 KB |
1081 | AC | 12 ms | 256 KB |
1156 | AC | 13 ms | 256 KB |
1498 | AC | 17 ms | 256 KB |
1921 | AC | 22 ms | 256 KB |
2041 | AC | 23 ms | 256 KB |
2329 | AC | 27 ms | 256 KB |
2449 | AC | 28 ms | 256 KB |
2568 | AC | 30 ms | 256 KB |
2918 | AC | 35 ms | 256 KB |
2929 | AC | 35 ms | 256 KB |
3289 | AC | 41 ms | 256 KB |
3429 | AC | 43 ms | 256 KB |
3485 | AC | 43 ms | 256 KB |
3763 | AC | 48 ms | 256 KB |
4081 | AC | 54 ms | 256 KB |
4277 | AC | 57 ms | 256 KB |
4648 | AC | 64 ms | 256 KB |
4652 | AC | 65 ms | 256 KB |
4656 | AC | 65 ms | 256 KB |
4660 | AC | 65 ms | 256 KB |
4664 | AC | 65 ms | 256 KB |