#include "scales.h"
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000009
#define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
#define dgb(x) cout<<#x<<" : "<<x<<"\n"
using namespace std;
using namespace __gnu_pbds;
ll dx[]={1, 0, 0};
ll dy[]={0, 1, -1};
inline ll ml(ll a, ll b){
return ((a%mod)*(b%mod))%mod;
}
ll bpow(ll a , ll b) {
if (b==0)return 1;
if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod;
ll r=bpow (a ,b/ 2) ;
return ((r%mod)*(r%mod))%mod;
}
void init (int T){
}
inline bool cmp(int a, int b){
int c=getLightest(a, b, a);
return (c==a);
}
void orderCoins(){
vector<int> v(6);
for(int i=0; i<6; i++)v[i]=i+1;
sort(all(v), cmp);
int r[6];
for(int i=0; i<6; i++)r[i]=v[i];
answer(r);
return;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
