結果
問題 | No.327 アルファベット列 |
ユーザー |
|
提出日時 | 2015-12-29 00:22:39 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,277 bytes |
コンパイル時間 | 539 ms |
コンパイル使用メモリ | 63,344 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-19 08:15:25 |
合計ジャッジ時間 | 1,965 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 WA * 18 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:44:14: warning: format ‘%c’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 44 | printf("%c",'A'-2+n/pow((ull)26,cnt-1)); | ~^ ~~~~~~~~~~~~~~~~~~~~~~~~~~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:49:14: warning: format ‘%c’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 49 | printf("%c",'A'-1+n/pow((ull)26,cnt-1)); | ~^ ~~~~~~~~~~~~~~~~~~~~~~~~~~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:50:29: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 50 | if(test) printf("\nn = %d\n",n); | ~^ ~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:57:29: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 57 | if(test) printf("\nn = %d\n",n); | ~^ ~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:60:16: warning: format ‘%c’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 60 | printf("%c",'A'-1+n/tmp); | ~^ ~~~~~~~~~~~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:65:12: warning: format ��
ソースコード
#include <iostream>#include <cstring>#include <algorithm>#include <limits.h>#include <cmath>#define REP(i,a,b) for(i=a;i<b;i++)#define rep(i,n) REP(i,0,n)0using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;#define mid 2/* ここからが本編 *//* *//* pow(x,n)はx^nを返すよ! */ull pow(ull x,ull n) {ull res = 1;while(n > 0) {if(n&1) res = res * x;x = x * x;n >>= 1;}return res;}int main(void){int i,j,k,l;int test = 0;ull n;ull tmp;ull cnt = 1;cin >> n;tmp = n;while(tmp >= 26) {if(cnt != 1 && tmp == 26) break;tmp /= 26; cnt++;}tmp = pow((ull)26,cnt-1);if(n >= 26 && n%tmp == 0 && n/tmp == 2) {printf("%c",'A'-2+n/pow((ull)26,cnt-1));n -= (n/tmp-1)*tmp;cnt--;}else if(n >= 26){printf("%c",'A'-1+n/pow((ull)26,cnt-1));if(test) printf("\nn = %d\n",n);ull tmp = pow((ull)26,cnt-1);n -= n/tmp*tmp;cnt--;}while(cnt > 1) {ull tmp = pow((ull)26,cnt-1);if(test) printf("\nn = %d\n",n);if(n == 0) printf("A");else {printf("%c",'A'-1+n/tmp);n -= n/tmp*tmp;}cnt--;}printf("%c",'A'+n/pow((ull)26,cnt-1));puts("");return 0;}