Submission #1003093


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>

using namespace std;

typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)

typedef long  LL;

LL K;
char s[10] = "FESTIVA";

int main(){
	scanf("%lld" , &K);
	printf("%s" , s);
	if(K % 2 == 1) printf("L");
	K /= 2;
	repm(i,6,0){
		if(K == 0) break;
		printf("%s" , s + i);
		if(K % 2 == 1) printf("L");
		K /= 2;
	}
	repp(i,0,7){
		repp(j,0,8){
			if(K == 0) break;
			repm(t,1<<j,0){
				printf("%c" , s[i]);
			}
			printf("%s" , s + i + 1);
			if(K % 2 == 1) printf("L");
			K /= 2;
		}
	}
	repm(i,K*2,0){
		printf("L");
	}
	printf("\n");
	return 0;
}

Submission Info

Submission Time
Task G - FESTIVAL
User PIandS
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1258 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:19: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘LL* {aka long int*}’ [-Wformat=]
  scanf("%lld" , &K);
                   ^
./Main.cpp:30:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld" , &K);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 6
WA × 50
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, 050.txt, 051.txt, 052.txt, 053.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 1 ms 128 KB
001.txt AC 1 ms 128 KB
002.txt AC 1 ms 128 KB
003.txt AC 1 ms 128 KB
004.txt WA 1 ms 128 KB
005.txt WA 1 ms 128 KB
006.txt WA 1 ms 128 KB
007.txt WA 1 ms 128 KB
008.txt WA 1 ms 128 KB
009.txt WA 1 ms 128 KB
010.txt WA 1 ms 128 KB
011.txt WA 1 ms 128 KB
012.txt WA 1 ms 128 KB
013.txt WA 1 ms 128 KB
014.txt WA 1 ms 128 KB
015.txt WA 1 ms 128 KB
016.txt WA 1 ms 128 KB
017.txt WA 1 ms 128 KB
018.txt WA 1 ms 128 KB
019.txt WA 1 ms 128 KB
020.txt WA 1 ms 128 KB
021.txt WA 1 ms 128 KB
022.txt WA 1 ms 128 KB
023.txt WA 1 ms 128 KB
024.txt WA 1 ms 128 KB
025.txt WA 1 ms 128 KB
026.txt WA 1 ms 128 KB
027.txt WA 1 ms 128 KB
028.txt WA 1 ms 128 KB
029.txt WA 1 ms 128 KB
030.txt WA 1 ms 128 KB
031.txt WA 1 ms 128 KB
032.txt WA 1 ms 128 KB
033.txt WA 1 ms 128 KB
034.txt WA 1 ms 128 KB
035.txt WA 1 ms 128 KB
036.txt WA 1 ms 128 KB
037.txt WA 1 ms 128 KB
038.txt WA 1 ms 128 KB
039.txt WA 1 ms 128 KB
040.txt WA 1 ms 128 KB
041.txt WA 1 ms 128 KB
042.txt WA 1 ms 128 KB
043.txt WA 1 ms 128 KB
044.txt WA 1 ms 128 KB
045.txt WA 1 ms 128 KB
046.txt WA 1 ms 128 KB
047.txt WA 1 ms 128 KB
048.txt WA 1 ms 128 KB
049.txt WA 1 ms 128 KB
050.txt WA 1 ms 128 KB
051.txt WA 1 ms 128 KB
052.txt WA 1 ms 128 KB
053.txt WA 1 ms 128 KB
example0.txt AC 1 ms 128 KB
example1.txt AC 1 ms 128 KB