Submission #3448107
Source Code Expand
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
#define mp make_pair
#define mt make_tuple
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
/* ---------- container ---------- */
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
/* ----------- debug ---------- */
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// mt19937 mert(LL(time(0)));
/* ---------- Short Functions ---------- */
template <typename T>
T sq(T a) {
return a * a;
}
template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b /* % MOD */;
if (n % 2 == 0) {
return mypow(b * b /* % MOD */, n / 2);
} else {
return mypow(b, n - 1) * b /* % MOD */;
}
}
ll pcnt(ll b) {
return __builtin_popcountll(b);
}
/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */
int main() {
int A;
string S;
cin >> A >> S;
int a[S.size()];
for (int i = 0; i < S.size(); ++i) {
a[i] = S[i] - 'a' + 1;
}
string ans;
for (int i = 0; i < S.size(); ++i) {
int b = 0, j = 0;
while (true) {
bool pushed = false;
while (a[i + j] > 0) {
int tmp = b + mypow(A, j);
if (tmp > 26) {
ans.push_back('a' + b - 1);
pushed = true;
break;
}
b = tmp;
--a[i + j];
}
if (pushed) break;
++j;
if (i + j == S.size()) {
if (b > 0) {
ans.push_back('a' + b - 1);
}
break;
}
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Best Password |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3523 Byte |
Status |
WA |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
corner_18, corner_19, corner_20, corner_21, corner_22, corner_23, large_09, large_10, large_11, large_12, large_13, large_14, large_15, large_16, large_17, sample_00, sample_01, sample_02, sample_03, small_00, small_01, small_02, small_03, small_04, small_05, small_06, small_07, small_08 |
Case Name |
Status |
Exec Time |
Memory |
corner_18 |
AC |
1 ms |
256 KB |
corner_19 |
AC |
1 ms |
256 KB |
corner_20 |
AC |
1 ms |
256 KB |
corner_21 |
WA |
1 ms |
256 KB |
corner_22 |
WA |
1 ms |
256 KB |
corner_23 |
AC |
1 ms |
256 KB |
large_09 |
WA |
1 ms |
256 KB |
large_10 |
WA |
2 ms |
256 KB |
large_11 |
WA |
1 ms |
256 KB |
large_12 |
WA |
1 ms |
256 KB |
large_13 |
WA |
1 ms |
256 KB |
large_14 |
WA |
1 ms |
256 KB |
large_15 |
WA |
1 ms |
256 KB |
large_16 |
WA |
1 ms |
256 KB |
large_17 |
WA |
1 ms |
256 KB |
sample_00 |
AC |
1 ms |
256 KB |
sample_01 |
AC |
1 ms |
256 KB |
sample_02 |
AC |
1 ms |
256 KB |
sample_03 |
AC |
1 ms |
256 KB |
small_00 |
AC |
1 ms |
256 KB |
small_01 |
AC |
1 ms |
256 KB |
small_02 |
AC |
1 ms |
256 KB |
small_03 |
WA |
1 ms |
256 KB |
small_04 |
AC |
1 ms |
256 KB |
small_05 |
AC |
1 ms |
256 KB |
small_06 |
AC |
1 ms |
256 KB |
small_07 |
AC |
1 ms |
256 KB |
small_08 |
AC |
1 ms |
256 KB |