結果
問題 | No.327 アルファベット列 |
ユーザー |
![]() |
提出日時 | 2021-04-16 21:13:56 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 2,785 bytes |
コンパイル時間 | 1,676 ms |
コンパイル使用メモリ | 174,212 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-03 00:21:34 |
合計ジャッジ時間 | 3,492 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 50 |
ソースコード
#include <bits/stdc++.h>#include <iostream>#include <vector>#include <functional>#include <algorithm>#include <map>#include <cstdio>#include <cmath>#include <iomanip>#include <queue>using namespace std;#define rep(i,n) for (int i = 0; i < (n); i++)#define vi vector<int>#define vll vector<long long>#define vb vector<bool>#define vs vector<string>#define all(x) x.begin() , x.end()#define pb push_back#define eb emplace_back#define chmax(x,y) (x) = max((x) , (y))#define chmin(x,y) (x) = min((x) , (y))#define fi first#define se secondtypedef long long ll;typedef unsigned long long ull;typedef long double ld;//const int MOD = int(1e9) + 7;//const int MOD = 998244353;const ll MOD = ll(1e9) + 7;//const ll MOD = 998244353;const ld PI = 3.1415926535897932384626;const int INF = 1001001001;//const ll LINF = 1001001001001001001;const ll LINF = (1LL << 63);const int MX = 220000;ll gcd (ll a , ll b) { if (a < b) swap(a , b); if (a % b == 0) return b; else return gcd(b , a % b); }ll lcm (ll a , ll b) { return a / gcd(a , b) * b; }ll lin() { ll x; scanf("%lld" , &x); return x; }int in() { int x; scanf("%d" , &x); return x; }bool is_palindrome (string s) { string t = s; reverse(all(t)); return (s == t); }void io_setup() {cout << fixed << setprecision(100);}ll modpow (ll x , ll p) {ll ret = 1;while (p) {if (p % 2 == 1) {ret *= x;ret %= MOD;}x *= x;x %= MOD;p /= 2;}return ret;}ll moddiv (ll a , ll b) {return a * modpow(b , MOD - 2) % MOD;}ll modsub (ll a , ll b) {if (a >= b) return (a - b) % MOD;else return (MOD - a + b);}vll fact(MX);vll factinv(MX);void init_fact () {fact[0] = 1;for (int i = 1; i < MX; i++) {fact[i] = 1LL * i * fact[i - 1] % MOD;}for (int i = 0; i < MX; i++) {factinv[i] = modpow(fact[i] , MOD - 2);}}ll nCk (ll n , ll k) {return ((fact[n] * factinv[k] % MOD) * factinv[n - k] % MOD);}bool is_prime (int x) {if (x == 2 || x == 3 || x == 5 || x == 7) {return true;}for (ll i = 2; i*i <= x; i++) {if (x % i == 0) {return false;}}return true;}vb prime_table(MX , true);void init_prime() {for (int i = 2; i < MX; i++) {for (int j = i + i; j < MX; j += i) {prime_table[j] = false;}}return;}void solve () {ll n = lin();string s;while (true) {char now = ('A' + ll(n % 26));s = now + s;n /= 26;if (n <= 0) break;n--;}cout << s << endl;return;}int main() {io_setup();//init_fact();//init_prime();solve();return 0;}