#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#define mxn 555
//#define send(x) cout<<x<<" ";
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
static constexpr int digits(int base) noexcept {
return base <= 1 ? 0 : 1 + digits(base / 10);
}
static constexpr int base = 1000'000'000;
static constexpr int base_digits = digits(base);
static constexpr int fft_base = 10'000; // fft_base^2 * n / fft_base_digits <= 10^15 for double
static constexpr int fft_base_digits = digits(fft_base);
struct bigint {
// value == 0 is represented by empty z
vector<int> z; // digits
// sign == 1 <==> value >= 0
// sign == -1 <==> value < 0
int sign;
bigint(long long v = 0) { *this = v; }
bigint &operator=(long long v) {
sign = v < 0 ? -1 : 1;
v *= sign;
z.clear();
for (; v > 0; v = v / base)
z.push_back((int)(v % base));
return *this;
}
bigint(const string &s) { read(s); }
bigint &operator+=(const bigint &other) {
if (sign == other.sign) {
for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
if (i == z.size())
z.push_back(0);
z[i] += carry + (i < other.z.size() ? other.z[i] : 0);
carry = z[i] >= base;
if (carry)
z[i] -= base;
}
} else if (other != 0 /* prevent infinite loop */) {
*this -= -other;
}
return *this;
}
friend bigint operator+(bigint a, const bigint &b) {
a += b;
return a;
}
bigint &operator-=(const bigint &other) {
if (sign == other.sign) {
if ((sign == 1 && *this >= other) || (sign == -1 && *this <= other)) {
for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
z[i] -= carry + (i < other.z.size() ? other.z[i] : 0);
carry = z[i] < 0;
if (carry)
z[i] += base;
}
trim();
} else {
*this = other - *this;
this->sign = -this->sign;
}
} else {
*this += -other;
}
return *this;
}
friend bigint operator-(bigint a, const bigint &b) {
a -= b;
return a;
}
bigint &operator*=(int v) {
if (v < 0)
sign = -sign, v = -v;
for (int i = 0, carry = 0; i < z.size() || carry; ++i) {
if (i == z.size())
z.push_back(0);
long long cur = (long long)z[i] * v + carry;
carry = (int)(cur / base);
z[i] = (int)(cur % base);
}
trim();
return *this;
}
bigint operator*(int v) const { return bigint(*this) *= v; }
friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
int norm = base / (b1.z.back() + 1);
bigint a = a1.abs() * norm;
bigint b = b1.abs() * norm;
bigint q, r;
q.z.resize(a.z.size());
for (int i = (int)a.z.size() - 1; i >= 0; i--) {
r *= base;
r += a.z[i];
int s1 = b.z.size() < r.z.size() ? r.z[b.z.size()] : 0;
int s2 = b.z.size() - 1 < r.z.size() ? r.z[b.z.size() - 1] : 0;
int d = (int)(((long long)s1 * base + s2) / b.z.back());
r -= b * d;
while (r < 0)
r += b, --d;
q.z[i] = d;
}
q.sign = a1.sign * b1.sign;
r.sign = a1.sign;
q.trim();
r.trim();
return {q, r / norm};
}
friend bigint sqrt(const bigint &a1) {
bigint a = a1;
while (a.z.empty() || a.z.size() % 2 == 1)
a.z.push_back(0);
int n = a.z.size();
int firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
int norm = base / (firstDigit + 1);
a *= norm;
a *= norm;
while (a.z.empty() || a.z.size() % 2 == 1)
a.z.push_back(0);
bigint r = (long long)a.z[n - 1] * base + a.z[n - 2];
firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
int q = firstDigit;
bigint res;
for (int j = n / 2 - 1; j >= 0; j--) {
for (;; --q) {
bigint r1 = (r - (res * 2 * base + q) * q) * base * base +
(j > 0 ? (long long)a.z[2 * j - 1] * base + a.z[2 * j - 2] : 0);
if (r1 >= 0) {
r = r1;
break;
}
}
res *= base;
res += q;
if (j > 0) {
int d1 = res.z.size() + 2 < r.z.size() ? r.z[res.z.size() + 2] : 0;
int d2 = res.z.size() + 1 < r.z.size() ? r.z[res.z.size() + 1] : 0;
int d3 = res.z.size() < r.z.size() ? r.z[res.z.size()] : 0;
q = (int)(((long long)d1 * base * base + (long long)d2 * base + d3) / (firstDigit * 2));
}
}
res.trim();
return res / norm;
}
bigint operator/(const bigint &v) const { return divmod(*this, v).first; }
bigint operator%(const bigint &v) const { return divmod(*this, v).second; }
bigint &operator/=(int v) {
if (v < 0)
sign = -sign, v = -v;
for (int i = (int)z.size() - 1, rem = 0; i >= 0; --i) {
long long cur = z[i] + rem * (long long)base;
z[i] = (int)(cur / v);
rem = (int)(cur % v);
}
trim();
return *this;
}
bigint operator/(int v) const { return bigint(*this) /= v; }
int operator%(int v) const {
if (v < 0)
v = -v;
int m = 0;
for (int i = (int)z.size() - 1; i >= 0; --i)
m = (int)((z[i] + m * (long long)base) % v);
return m * sign;
}
bool operator<(const bigint &v) const {
if (sign != v.sign)
return sign < v.sign;
if (z.size() != v.z.size())
return z.size() * sign < v.z.size() * v.sign;
for (int i = (int)z.size() - 1; i >= 0; i--)
if (z[i] != v.z[i])
return z[i] * sign < v.z[i] * sign;
return false;
}
bool operator>(const bigint &v) const { return v < *this; }
bool operator<=(const bigint &v) const { return !(v < *this); }
bool operator>=(const bigint &v) const { return !(*this < v); }
bool operator==(const bigint &v) const { return sign == v.sign && z == v.z; }
bool operator!=(const bigint &v) const { return !(*this == v); }
void trim() {
while (!z.empty() && z.back() == 0)
z.pop_back();
if (z.empty())
sign = 1;
}
bool isZero() const { return z.empty(); }
friend bigint operator-(bigint v) {
if (!v.z.empty())
v.sign = -v.sign;
return v;
}
bigint abs() const { return sign == 1 ? *this : -*this; }
long long longValue() const {
long long res = 0;
for (int i = (int)z.size() - 1; i >= 0; i--)
res = res * base + z[i];
return res * sign;
}
void read(const string &s) {
sign = 1;
z.clear();
int pos = 0;
while (pos < s.size() && (s[pos] == '-' || s[pos] == '+')) {
if (s[pos] == '-')
sign = -sign;
++pos;
}
for (int i = (int)s.size() - 1; i >= pos; i -= base_digits) {
int x = 0;
for (int j = max(pos, i - base_digits + 1); j <= i; j++)
x = x * 10 + s[j] - '0';
z.push_back(x);
}
trim();
}
friend istream &operator>>(istream &stream, bigint &v) {
string s;
stream >> s;
v.read(s);
return stream;
}
friend ostream &operator<<(ostream &stream, const bigint &v) {
if (v.sign == -1)
stream << '-';
stream << (v.z.empty() ? 0 : v.z.back());
for (int i = (int)v.z.size() - 2; i >= 0; --i)
stream << setw(base_digits) << setfill('0') << v.z[i];
return stream;
}
static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
vector<long long> p(max(old_digits, new_digits) + 1);
p[0] = 1;
for (int i = 1; i < p.size(); i++)
p[i] = p[i - 1] * 10;
vector<int> res;
long long cur = 0;
int cur_digits = 0;
for (int v : a) {
cur += v * p[cur_digits];
cur_digits += old_digits;
while (cur_digits >= new_digits) {
res.push_back(int(cur % p[new_digits]));
cur /= p[new_digits];
cur_digits -= new_digits;
}
}
res.push_back((int)cur);
while (!res.empty() && res.back() == 0)
res.pop_back();
return res;
}
};
struct International_Olympiad_in_Informatics
{
int i,j,res[mxn],nres;
bigint p[mxn],c[mxn][mxn];
bigint K(int k,int n) { return c[k][n+k-1]; }
void Work(int n,int a[])
{
p[0]=bigint(1);
for(i=1;i<=n;i++) p[i]=p[i-1]*256;
for(i=0;i<=261;i++)
for(j=i;j<=525;j++)
if(i==0) c[i][j]=bigint(1); else c[i][j]=c[i][j-1]+c[i-1][j-1];
bigint order=bigint(1);
for(i=1;i<=n;i++) order+=p[n-i]*a[i];
order=order+bigint(1);
res[0]=-1;
for(i=1;i<=261;i++)
{
for(j=res[i-1];j<=255;j++)
{
bigint tg=K(261-i,255-j+1);
if(order>tg) order-=tg; else break;
}
res[i]=j;
}
nres=0;
for(i=1;i<=261;i++) nres+=(res[i]>-1);
}
} IOI;
int n,m[mxn],i;
void encode(int _n,int _m[])
{
n=_n;
for(int i=0;i<n;i++) m[i]=_m[i];
for(int i=n;i>=1;i--) m[i]=m[i-1];
IOI.Work(n,m);
// cout<<n<<" "<<IOI.nres<<'\n';
for(int i=1;i<=261;i++)
if(IOI.res[i]>-1) send(IOI.res[i]);
// cout<<'\n';
}
/*
int main()
{
freopen("encoder.inp","r",stdin);
freopen("encoder.out","w",stdout);
while(cin>>n)
{
for(i=0;i<n;i++) cin>>m[i];
encode(n,m);
cin>>i;
// return 0;
}
}
*/
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#define mxn 555
//#define output(x) cout<<x<<" ";
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
static constexpr int digits(int base) noexcept {
return base <= 1 ? 0 : 1 + digits(base / 10);
}
static constexpr int base = 1000'000'000;
static constexpr int base_digits = digits(base);
static constexpr int fft_base = 10'000; // fft_base^2 * n / fft_base_digits <= 10^15 for double
static constexpr int fft_base_digits = digits(fft_base);
struct bigint {
// value == 0 is represented by empty z
vector<int> z; // digits
// sign == 1 <==> value >= 0
// sign == -1 <==> value < 0
int sign;
bigint(long long v = 0) { *this = v; }
bigint &operator=(long long v) {
sign = v < 0 ? -1 : 1;
v *= sign;
z.clear();
for (; v > 0; v = v / base)
z.push_back((int)(v % base));
return *this;
}
bigint(const string &s) { read(s); }
bigint &operator+=(const bigint &other) {
if (sign == other.sign) {
for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
if (i == z.size())
z.push_back(0);
z[i] += carry + (i < other.z.size() ? other.z[i] : 0);
carry = z[i] >= base;
if (carry)
z[i] -= base;
}
} else if (other != 0 /* prevent infinite loop */) {
*this -= -other;
}
return *this;
}
friend bigint operator+(bigint a, const bigint &b) {
a += b;
return a;
}
bigint &operator-=(const bigint &other) {
if (sign == other.sign) {
if ((sign == 1 && *this >= other) || (sign == -1 && *this <= other)) {
for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
z[i] -= carry + (i < other.z.size() ? other.z[i] : 0);
carry = z[i] < 0;
if (carry)
z[i] += base;
}
trim();
} else {
*this = other - *this;
this->sign = -this->sign;
}
} else {
*this += -other;
}
return *this;
}
friend bigint operator-(bigint a, const bigint &b) {
a -= b;
return a;
}
bigint &operator*=(int v) {
if (v < 0)
sign = -sign, v = -v;
for (int i = 0, carry = 0; i < z.size() || carry; ++i) {
if (i == z.size())
z.push_back(0);
long long cur = (long long)z[i] * v + carry;
carry = (int)(cur / base);
z[i] = (int)(cur % base);
}
trim();
return *this;
}
bigint operator*(int v) const { return bigint(*this) *= v; }
friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
int norm = base / (b1.z.back() + 1);
bigint a = a1.abs() * norm;
bigint b = b1.abs() * norm;
bigint q, r;
q.z.resize(a.z.size());
for (int i = (int)a.z.size() - 1; i >= 0; i--) {
r *= base;
r += a.z[i];
int s1 = b.z.size() < r.z.size() ? r.z[b.z.size()] : 0;
int s2 = b.z.size() - 1 < r.z.size() ? r.z[b.z.size() - 1] : 0;
int d = (int)(((long long)s1 * base + s2) / b.z.back());
r -= b * d;
while (r < 0)
r += b, --d;
q.z[i] = d;
}
q.sign = a1.sign * b1.sign;
r.sign = a1.sign;
q.trim();
r.trim();
return {q, r / norm};
}
friend bigint sqrt(const bigint &a1) {
bigint a = a1;
while (a.z.empty() || a.z.size() % 2 == 1)
a.z.push_back(0);
int n = a.z.size();
int firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
int norm = base / (firstDigit + 1);
a *= norm;
a *= norm;
while (a.z.empty() || a.z.size() % 2 == 1)
a.z.push_back(0);
bigint r = (long long)a.z[n - 1] * base + a.z[n - 2];
firstDigit = (int)::sqrt((double)a.z[n - 1] * base + a.z[n - 2]);
int q = firstDigit;
bigint res;
for (int j = n / 2 - 1; j >= 0; j--) {
for (;; --q) {
bigint r1 = (r - (res * 2 * base + q) * q) * base * base +
(j > 0 ? (long long)a.z[2 * j - 1] * base + a.z[2 * j - 2] : 0);
if (r1 >= 0) {
r = r1;
break;
}
}
res *= base;
res += q;
if (j > 0) {
int d1 = res.z.size() + 2 < r.z.size() ? r.z[res.z.size() + 2] : 0;
int d2 = res.z.size() + 1 < r.z.size() ? r.z[res.z.size() + 1] : 0;
int d3 = res.z.size() < r.z.size() ? r.z[res.z.size()] : 0;
q = (int)(((long long)d1 * base * base + (long long)d2 * base + d3) / (firstDigit * 2));
}
}
res.trim();
return res / norm;
}
bigint operator/(const bigint &v) const { return divmod(*this, v).first; }
bigint operator%(const bigint &v) const { return divmod(*this, v).second; }
bigint &operator/=(int v) {
if (v < 0)
sign = -sign, v = -v;
for (int i = (int)z.size() - 1, rem = 0; i >= 0; --i) {
long long cur = z[i] + rem * (long long)base;
z[i] = (int)(cur / v);
rem = (int)(cur % v);
}
trim();
return *this;
}
bigint operator/(int v) const { return bigint(*this) /= v; }
int operator%(int v) const {
if (v < 0)
v = -v;
int m = 0;
for (int i = (int)z.size() - 1; i >= 0; --i)
m = (int)((z[i] + m * (long long)base) % v);
return m * sign;
}
bool operator<(const bigint &v) const {
if (sign != v.sign)
return sign < v.sign;
if (z.size() != v.z.size())
return z.size() * sign < v.z.size() * v.sign;
for (int i = (int)z.size() - 1; i >= 0; i--)
if (z[i] != v.z[i])
return z[i] * sign < v.z[i] * sign;
return false;
}
bool operator>(const bigint &v) const { return v < *this; }
bool operator<=(const bigint &v) const { return !(v < *this); }
bool operator>=(const bigint &v) const { return !(*this < v); }
bool operator==(const bigint &v) const { return sign == v.sign && z == v.z; }
bool operator!=(const bigint &v) const { return !(*this == v); }
void trim() {
while (!z.empty() && z.back() == 0)
z.pop_back();
if (z.empty())
sign = 1;
}
bool isZero() const { return z.empty(); }
friend bigint operator-(bigint v) {
if (!v.z.empty())
v.sign = -v.sign;
return v;
}
bigint abs() const { return sign == 1 ? *this : -*this; }
long long longValue() const {
long long res = 0;
for (int i = (int)z.size() - 1; i >= 0; i--)
res = res * base + z[i];
return res * sign;
}
void read(const string &s) {
sign = 1;
z.clear();
int pos = 0;
while (pos < s.size() && (s[pos] == '-' || s[pos] == '+')) {
if (s[pos] == '-')
sign = -sign;
++pos;
}
for (int i = (int)s.size() - 1; i >= pos; i -= base_digits) {
int x = 0;
for (int j = max(pos, i - base_digits + 1); j <= i; j++)
x = x * 10 + s[j] - '0';
z.push_back(x);
}
trim();
}
friend istream &operator>>(istream &stream, bigint &v) {
string s;
stream >> s;
v.read(s);
return stream;
}
friend ostream &operator<<(ostream &stream, const bigint &v) {
if (v.sign == -1)
stream << '-';
stream << (v.z.empty() ? 0 : v.z.back());
for (int i = (int)v.z.size() - 2; i >= 0; --i)
stream << setw(base_digits) << setfill('0') << v.z[i];
return stream;
}
static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
vector<long long> p(max(old_digits, new_digits) + 1);
p[0] = 1;
for (int i = 1; i < p.size(); i++)
p[i] = p[i - 1] * 10;
vector<int> res;
long long cur = 0;
int cur_digits = 0;
for (int v : a) {
cur += v * p[cur_digits];
cur_digits += old_digits;
while (cur_digits >= new_digits) {
res.push_back(int(cur % p[new_digits]));
cur /= p[new_digits];
cur_digits -= new_digits;
}
}
res.push_back((int)cur);
while (!res.empty() && res.back() == 0)
res.pop_back();
return res;
}
};
struct International_Olympiad_in_Informatics
{
int i,j,res[mxn];
bigint p[mxn],c[mxn][mxn];
bigint K(int k,int n) { return c[k][n+k-1]; }
void Work(int n,int m,int a[])
{
p[0]=bigint(1);
for(i=1;i<=n;i++) p[i]=p[i-1]*256;
for(i=0;i<=261;i++)
for(j=i;j<=525;j++)
if(i==0) c[i][j]=bigint(1); else c[i][j]=c[i][j-1]+c[i-1][j-1];
sort(a+1,a+m+1);
bigint order=bigint(1);
a[0]=-1;
for(i=1;i<=m;i++)
{
for(j=a[i-1];j<a[i];j++)
order+=K(m-i,255-j+1);
}
order=order-1;
for(i=1;i<=n;i++)
{
for(j=0;j<=255;j++)
if(order>p[n-i]) order-=p[n-i]; else break;
res[i]=j;
}
}
} IOI;
int n,l,x[mxn],i;
void decode(int _n,int _l,int _x[])
{
n=_n; l=_l;
for(int i=0;i<l;i++) x[i]=_x[i];
for(int i=l;i>=1;i--) x[i]=x[i-1];
IOI.Work(n,l,x);
for(int i=1;i<=n;i++) output(IOI.res[i]);
// cout<<'\n';
}
/*
int main()
{
freopen("decoder.inp","r",stdin);
freopen("decoder.out","w",stdout);
while(cin>>n>>l)
{
for(i=0;i<l;i++) cin>>x[i];
decode(n,l,x);
}
}
*/
Compilation message
encoder.cpp: In member function 'bigint& bigint::operator+=(const bigint&)':
encoder.cpp:53:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
| ~~^~~~~~~~~~~~~~~~
encoder.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | if (i == z.size())
| ~~^~~~~~~~~~~
encoder.cpp:56:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | z[i] += carry + (i < other.z.size() ? other.z[i] : 0);
| ~~^~~~~~~~~~~~~~~~
encoder.cpp: In member function 'bigint& bigint::operator-=(const bigint&)':
encoder.cpp:75:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
75 | for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
| ~~^~~~~~~~~~~~~~~~
encoder.cpp:76:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | z[i] -= carry + (i < other.z.size() ? other.z[i] : 0);
| ~~^~~~~~~~~~~~~~~~
encoder.cpp: In member function 'bigint& bigint::operator*=(int)':
encoder.cpp:100:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
100 | for (int i = 0, carry = 0; i < z.size() || carry; ++i) {
| ~~^~~~~~~~~~
encoder.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if (i == z.size())
| ~~^~~~~~~~~~~
encoder.cpp: In member function 'void bigint::read(const string&)':
encoder.cpp:261:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
261 | while (pos < s.size() && (s[pos] == '-' || s[pos] == '+')) {
| ~~~~^~~~~~~~~~
encoder.cpp: In static member function 'static std::vector<int> bigint::convert_base(const std::vector<int>&, int, int)':
encoder.cpp:294:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
294 | for (int i = 1; i < p.size(); i++)
| ~~^~~~~~~~~~
decoder.cpp: In member function 'bigint& bigint::operator+=(const bigint&)':
decoder.cpp:53:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
| ~~^~~~~~~~~~~~~~~~
decoder.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | if (i == z.size())
| ~~^~~~~~~~~~~
decoder.cpp:56:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | z[i] += carry + (i < other.z.size() ? other.z[i] : 0);
| ~~^~~~~~~~~~~~~~~~
decoder.cpp: In member function 'bigint& bigint::operator-=(const bigint&)':
decoder.cpp:75:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
75 | for (int i = 0, carry = 0; i < other.z.size() || carry; ++i) {
| ~~^~~~~~~~~~~~~~~~
decoder.cpp:76:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | z[i] -= carry + (i < other.z.size() ? other.z[i] : 0);
| ~~^~~~~~~~~~~~~~~~
decoder.cpp: In member function 'bigint& bigint::operator*=(int)':
decoder.cpp:100:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
100 | for (int i = 0, carry = 0; i < z.size() || carry; ++i) {
| ~~^~~~~~~~~~
decoder.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if (i == z.size())
| ~~^~~~~~~~~~~
decoder.cpp: In member function 'void bigint::read(const string&)':
decoder.cpp:261:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
261 | while (pos < s.size() && (s[pos] == '-' || s[pos] == '+')) {
| ~~~~^~~~~~~~~~
decoder.cpp: In static member function 'static std::vector<int> bigint::convert_base(const std::vector<int>&, int, int)':
decoder.cpp:294:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
294 | for (int i = 1; i < p.size(); i++)
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
168 ms |
32140 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
832 ms |
32372 KB |
Output is correct |
| 2 |
Correct |
812 ms |
32364 KB |
Output is correct |
| 3 |
Correct |
821 ms |
32396 KB |
Output is correct |
| 4 |
Correct |
815 ms |
32212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
811 ms |
32144 KB |
Output is correct |
| 2 |
Correct |
857 ms |
32448 KB |
Output is correct |
| 3 |
Correct |
806 ms |
32184 KB |
Output is correct |
| 4 |
Correct |
830 ms |
32408 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
820 ms |
32144 KB |
Output is correct |
| 2 |
Correct |
804 ms |
32384 KB |
Output is correct |
| 3 |
Correct |
830 ms |
32364 KB |
Output is correct |
| 4 |
Correct |
816 ms |
32428 KB |
Output is correct |
| 5 |
Correct |
800 ms |
32460 KB |
Output is correct |
| 6 |
Correct |
815 ms |
32396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
806 ms |
32268 KB |
Output is correct - P = 1.750000 |
| 2 |
Correct |
813 ms |
32388 KB |
Output is correct - P = 2.437500 |
| 3 |
Correct |
804 ms |
32404 KB |
Output is correct - P = 2.484848 |
| 4 |
Correct |
840 ms |
32500 KB |
Output is correct - P = 3.280000 |
| 5 |
Correct |
817 ms |
32740 KB |
Output is correct - P = 3.833333 |
| 6 |
Correct |
815 ms |
33012 KB |
Output is correct - P = 4.015873 |
| 7 |
Correct |
808 ms |
32480 KB |
Output is correct - P = 4.078125 |
