QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #245104 | #6602. Journey to Un'Goro | 0x4F5DA2 | WA | 1ms | 4016kb | C++14 | 9.6kb | 2023-11-09 18:51:56 | 2023-11-09 18:51:57 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int ans,flag,n;
int a[40],sum[40];
char twenty_nine[200][300] = {"00000000000010000000000000010", "00000000000010000000000000101", "00000000000010000000000000111", "00000000000010000000000001010", "00000000000010000000000001101", "00000000000010000000000001111", "00000000000010000000000010100", "00000000000010000000000011001", "00000000000010000000000011011", "00000000000010000000000011110", "00000000000010000000000101000", "00000000000010000000000110001", "00000000000010000000000110011", "00000000000010000000000110110", "00000000000010000000000111100", "00000000000010000000001010000", "00000000000010000000001100001", "00000000000010000000001100011", "00000000000010000000001100110", "00000000000010000000001101100", "00000000000010000000001111000", "00000000000010000000010100000", "00000000000010000000011000001", "00000000000010000000011000011", "00000000000010000000011000110", "00000000000010000000011001100", "00000000000010000000011011000", "00000000000010000000011110000", "00000000000010000000101000000", "00000000000010000000110000001", "00000000000010000000110000011", "00000000000010000000110000110", "00000000000010000000110001100", "00000000000010000000110011000", "00000000000010000000110110000", "00000000000010000000111100000", "00000000000010000001010000000", "00000000000010000001100000001", "00000000000010000001100000011", "00000000000010000001100000110", "00000000000010000001100001100", "00000000000010000001100011000", "00000000000010000001100110000", "00000000000010000001101100000", "00000000000010000001111000000", "00000000000010000010100000000", "00000000000010000011000000001", "00000000000010000011000000011", "00000000000010000011000000110", "00000000000010000011000001100", "00000000000010000011000011000", "00000000000010000011000110000", "00000000000010000011001100000", "00000000000010000011011000000", "00000000000010000011110000000", "00000000000010000101000000000", "00000000000010000110000000001", "00000000000010000110000000011", "00000000000010000110000000110", "00000000000010000110000001100", "00000000000010000110000011000", "00000000000010000110000110000", "00000000000010000110001100000", "00000000000010000110011000000", "00000000000010000110110000000", "00000000000010000111100000000", "00000000000010001010000000000", "00000000000010001100000000001", "00000000000010001100000000011", "00000000000010001100000000110", "00000000000010001100000001100", "00000000000010001100000011000", "00000000000010001100000110000", "00000000000010001100001100000", "00000000000010001100011000000", "00000000000010001100110000000", "00000000000010001101100000000", "00000000000010001111000000000", "00000000000010010100000000000", "00000000000010011000000000001", "00000000000010011000000000011", "00000000000010011000000000110", "00000000000010011000000001100", "00000000000010011000000011000"};
char thrity[200][300] = {"000000000000010000000000000001", "000000000000010000000000000010", "000000000000010000000000000011", "000000000000010000000000000101", "000000000000010000000000000110", "000000000000010000000000000111", "000000000000010000000000001010", "000000000000010000000000001100", "000000000000010000000000001101", "000000000000010000000000001111", "000000000000010000000000010100", "000000000000010000000000011000", "000000000000010000000000011001", "000000000000010000000000011011", "000000000000010000000000011110", "000000000000010000000000101000", "000000000000010000000000110000", "000000000000010000000000110001", "000000000000010000000000110011", "000000000000010000000000110110", "000000000000010000000000111100", "000000000000010000000001010000", "000000000000010000000001100000", "000000000000010000000001100001", "000000000000010000000001100011", "000000000000010000000001100110", "000000000000010000000001101100", "000000000000010000000001111000", "000000000000010000000010100000", "000000000000010000000011000000", "000000000000010000000011000001", "000000000000010000000011000011", "000000000000010000000011000110", "000000000000010000000011001100", "000000000000010000000011011000", "000000000000010000000011110000", "000000000000010000000101000000", "000000000000010000000110000000", "000000000000010000000110000001", "000000000000010000000110000011", "000000000000010000000110000110", "000000000000010000000110001100", "000000000000010000000110011000", "000000000000010000000110110000", "000000000000010000000111100000", "000000000000010000001010000000", "000000000000010000001100000000", "000000000000010000001100000001", "000000000000010000001100000011", "000000000000010000001100000110", "000000000000010000001100001100", "000000000000010000001100011000", "000000000000010000001100110000", "000000000000010000001101100000", "000000000000010000001111000000", "000000000000010000010100000000", "000000000000010000011000000000", "000000000000010000011000000001", "000000000000010000011000000011", "000000000000010000011000000110", "000000000000010000011000001100", "000000000000010000011000011000", "000000000000010000011000110000", "000000000000010000011001100000", "000000000000010000011011000000", "000000000000010000011110000000", "000000000000010000101000000000", "000000000000010000110000000000", "000000000000010000110000000001", "000000000000010000110000000011", "000000000000010000110000000110", "000000000000010000110000001100", "000000000000010000110000011000", "000000000000010000110000110000", "000000000000010000110001100000", "000000000000010000110011000000", "000000000000010000110110000000", "000000000000010000111100000000", "000000000000010001010000000000", "000000000000010001100000000000", "000000000000010001100000000001", "000000000000010001100000000011", "000000000000010001100000000110"};
void dfs(int dep,int len)
{
if(dep == len + 1)
{
for(int i = 1;i <= len;i ++)
{
sum[i] = sum[i - 1] + a[i];
}
int now_ans = 0;
for(int i = 1;i <= len;i ++)
{
for(int j = i;j <= len;j ++)
{
if((sum[j] - sum[i - 1]) % 2) now_ans ++;
}
}
if(ans == now_ans && flag < 100)
{
flag ++;
for(int i = 1;i <= len;i ++)
{
if(a[i] == 0) printf("b");
else printf("r");
}
printf("\n");
}
return;
}
for(int i = 0;i <= 1;i ++)
{
a[dep] = i;
dfs(dep + 1,len);
if(flag >= 100) return;
}
}
void force(int n)
{
int num = 0;
for(int len = 1;len <= n;len ++)
{
flag = 0;
if(len % 2) num ++;
ans += num;
}
printf("%d\n",ans);
if(n <= 20) dfs(1,n);
else dfs(n / 2 - 4,n);
}
int solve(int n)
{
//freopen("Df.out","w",stdout);
//scanf("%d",&n);
force(n);
// int num = 0;
// for(int len = 30;len <= 30;len ++)
// {
// flag = 0;
// if(len % 2) num ++;
// ans += num;
// dfs(12,len);
// printf("%d %d\n",len,ans);
// }
return (0 ^ 0);
}
int main()
{
int n;
scanf("%d",&n);
if(n<=30){
solve(n);
}
else
{
long long Ans = (n+1)/2;
if(n%2 == 0){
printf("%lld\n",(1+Ans)*Ans);
if(n>=240){
for(int i=1;i<=n/2;i++)
printf("b");
printf("r");
for(int i=1;i<n/2;i++)
printf("b");
printf("\n");
for(int i=1;i<n/2;i++)
printf("b");
printf("r");
for(int i=1;i<=n/2;i++)
printf("b");
printf("\n");
for(int i=1;i<=98;i++){
for(int j=1;j<=n;j++){
if(j == n/2)
printf("r");
else if(j == n-i+1 || j == n-i+2)
printf("r");
else
printf("b");
}
printf("\n");
}
}
else{
for(int i=1;i<=n/2;i++)
printf("b");
printf("r");
for(int i=1;i<n/2;i++)
printf("b");
printf("\n");
for(int i=1;i<n/2;i++)
printf("b");
printf("r");
for(int i=1;i<=n/2;i++)
printf("b");
printf("\n");
int p=1;
for(p=1;p<=n/2 && p<=98;p++){
for(int j=1;j<=n;j++){
if(j == n/2)
printf("r");
else if(j == n-p+1 || j == n-p+2)
printf("r");
else
printf("b");
}
printf("\n");
}
for(int i=p;i<=98;i++){
for(int j=1;j<=(n-30)/2;j++)
printf("b");
for(int j=0;j<=14;j++)
if(thrity[i-p][j] == '0')
printf("b");
else
printf("r");
for(int j=1;j<=(n-30)/2;j++)
printf("b");
for(int j=15;j<30;j++)
if(thrity[i-p][j] == '0')
printf("b");
else
printf("r");
printf("\n");
}
}
}
else{
printf("%lld\n",(1+Ans)*Ans-Ans);
if(n>=240){
for(int i=1;i<n/2;i++)
printf("b");
printf("r");
for(int i=1;i<n/2;i++)
printf("b");
printf("\n");
for(int i=1;i<=99;i++){
for(int j=1;j<=n;j++){
if(j == n/2)
printf("r");
else if(j == n-i+1 || j == n-i+2)
printf("r");
else
printf("b");
}
printf("\n");
}
}
else{
for(int i=1;i<=n/2;i++)
printf("b");
printf("r");
for(int i=1;i<=n/2;i++)
printf("b");
printf("\n");
int p=1;
for(p=1;p<=n/2+1 && p<=99;p++){
for(int j=1;j<=n;j++){
if(j == n/2)
printf("r");
else if(j == n-p+1 || j == n-p+2)
printf("r");
else
printf("b");
}
printf("\n");
}
for(int i=p;i<=99;i++){
for(int j=1;j<=(n-29)/2;j++)
printf("b");
for(int j=0;j<=14;j++)
if(twenty_nine[i-p][j] == '0')
printf("b");
else
printf("r");
for(int j=1;j<=(n-29)/2;j++)
printf("b");
for(int j=15;j<29;j++)
if(twenty_nine[i-p][j] == '0')
printf("b");
else
printf("r");
printf("\n");
}
}
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 4008kb
input:
1
output:
1 r
result:
ok 2 tokens
Test #2:
score: 0
Accepted
time: 0ms
memory: 4008kb
input:
2
output:
2 br rb rr
result:
ok 4 tokens
Test #3:
score: 0
Accepted
time: 0ms
memory: 3932kb
input:
3
output:
4 brb rbr rrr
result:
ok 4 tokens
Test #4:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
4
output:
6 bbrb brbb brbr brrr rbbr rbrb rbrr rrbr rrrb rrrr
result:
ok 11 tokens
Test #5:
score: 0
Accepted
time: 0ms
memory: 4016kb
input:
5
output:
9 bbrbb brbbr brbrr brrrb rbbrb rbrbr rbrrr rrbrb rrrbr rrrrr
result:
ok 11 tokens
Test #6:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
6
output:
12 bbbrbb bbrbbb bbrbbr bbrbrr bbrrrb brbbbr brbbrb brbbrr brbrbr brbrrb brbrrr brrbrb brrrbb brrrbr brrrrr rbbbrb rbbrbb rbbrbr rbbrrr rbrbbr rbrbrb rbrbrr rbrrbr rbrrrb rbrrrr rrbbrb rrbrbb rrbrbr rrbrrr rrrbbr rrrbrb rrrbrr rrrrbr rrrrrb rrrrrr
result:
ok 36 tokens
Test #7:
score: 0
Accepted
time: 0ms
memory: 3920kb
input:
7
output:
16 bbbrbbb bbrbbbr bbrbbrr bbrbrrb bbrrrbb brbbbrb brbbrbr brbbrrr brbrbrb brbrrbr brbrrrr brrbrbb brrrbbr brrrbrr brrrrrb rbbbrbb rbbrbbr rbbrbrr rbbrrrb rbrbbrb rbrbrbr rbrbrrr rbrrbrb rbrrrbr rbrrrrr rrbbrbb rrbrbbr rrbrbrr rrbrrrb rrrbbrb rrrbrbr rrrbrrr rrrrbrb rrrrrbr rrrrrrr
result:
ok 36 tokens
Test #8:
score: 0
Accepted
time: 0ms
memory: 3956kb
input:
8
output:
20 bbbbrbbb bbbrbbbb bbbrbbbr bbbrbbrr bbbrbrrb bbbrrrbb bbrbbbbr bbrbbbrb bbrbbbrr bbrbbrbr bbrbbrrb bbrbbrrr bbrbrbrb bbrbrrbb bbrbrrbr bbrbrrrr bbrrbrbb bbrrrbbb bbrrrbbr bbrrrbrr bbrrrrrb brbbbbrb brbbbrbb brbbbrbr brbbbrrr brbbrbbr brbbrbrb brbbrbrr brbbrrbr brbbrrrb brbbrrrr brbrbbrb brbrbrbb ...
result:
ok 101 tokens
Test #9:
score: 0
Accepted
time: 0ms
memory: 3932kb
input:
9
output:
25 bbbbrbbbb bbbrbbbbr bbbrbbbrr bbbrbbrrb bbbrbrrbb bbbrrrbbb bbrbbbbrb bbrbbbrbr bbrbbbrrr bbrbbrbrb bbrbbrrbr bbrbbrrrr bbrbrbrbb bbrbrrbbr bbrbrrbrr bbrbrrrrb bbrrbrbbb bbrrrbbbr bbrrrbbrr bbrrrbrrb bbrrrrrbb brbbbbrbb brbbbrbbr brbbbrbrr brbbbrrrb brbbrbbrb brbbrbrbr brbbrbrrr brbbrrbrb brbbrrr...
result:
ok 101 tokens
Test #10:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
10
output:
30 bbbbbrbbbb bbbbrbbbbb bbbbrbbbbr bbbbrbbbrr bbbbrbbrrb bbbbrbrrbb bbbbrrrbbb bbbrbbbbbr bbbrbbbbrb bbbrbbbbrr bbbrbbbrbr bbbrbbbrrb bbbrbbbrrr bbbrbbrbrb bbbrbbrrbb bbbrbbrrbr bbbrbbrrrr bbbrbrbrbb bbbrbrrbbb bbbrbrrbbr bbbrbrrbrr bbbrbrrrrb bbbrrbrbbb bbbrrrbbbb bbbrrrbbbr bbbrrrbbrr bbbrrrbrrb ...
result:
ok 101 tokens
Test #11:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
11
output:
36 bbbbbrbbbbb bbbbrbbbbbr bbbbrbbbbrr bbbbrbbbrrb bbbbrbbrrbb bbbbrbrrbbb bbbbrrrbbbb bbbrbbbbbrb bbbrbbbbrbr bbbrbbbbrrr bbbrbbbrbrb bbbrbbbrrbr bbbrbbbrrrr bbbrbbrbrbb bbbrbbrrbbr bbbrbbrrbrr bbbrbbrrrrb bbbrbrbrbbb bbbrbrrbbbr bbbrbrrbbrr bbbrbrrbrrb bbbrbrrrrbb bbbrrbrbbbb bbbrrrbbbbr bbbrrrbbb...
result:
ok 101 tokens
Test #12:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
12
output:
42 bbbbbbrbbbbb bbbbbrbbbbbb bbbbbrbbbbbr bbbbbrbbbbrr bbbbbrbbbrrb bbbbbrbbrrbb bbbbbrbrrbbb bbbbbrrrbbbb bbbbrbbbbbbr bbbbrbbbbbrb bbbbrbbbbbrr bbbbrbbbbrbr bbbbrbbbbrrb bbbbrbbbbrrr bbbbrbbbrbrb bbbbrbbbrrbb bbbbrbbbrrbr bbbbrbbbrrrr bbbbrbbrbrbb bbbbrbbrrbbb bbbbrbbrrbbr bbbbrbbrrbrr bbbbrbbrrrr...
result:
ok 101 tokens
Test #13:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
13
output:
49 bbbbbbrbbbbbb bbbbbrbbbbbbr bbbbbrbbbbbrr bbbbbrbbbbrrb bbbbbrbbbrrbb bbbbbrbbrrbbb bbbbbrbrrbbbb bbbbbrrrbbbbb bbbbrbbbbbbrb bbbbrbbbbbrbr bbbbrbbbbbrrr bbbbrbbbbrbrb bbbbrbbbbrrbr bbbbrbbbbrrrr bbbbrbbbrbrbb bbbbrbbbrrbbr bbbbrbbbrrbrr bbbbrbbbrrrrb bbbbrbbrbrbbb bbbbrbbrrbbbr bbbbrbbrrbbrr bbb...
result:
ok 101 tokens
Test #14:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
14
output:
56 bbbbbbbrbbbbbb bbbbbbrbbbbbbb bbbbbbrbbbbbbr bbbbbbrbbbbbrr bbbbbbrbbbbrrb bbbbbbrbbbrrbb bbbbbbrbbrrbbb bbbbbbrbrrbbbb bbbbbbrrrbbbbb bbbbbrbbbbbbbr bbbbbrbbbbbbrb bbbbbrbbbbbbrr bbbbbrbbbbbrbr bbbbbrbbbbbrrb bbbbbrbbbbbrrr bbbbbrbbbbrbrb bbbbbrbbbbrrbb bbbbbrbbbbrrbr bbbbbrbbbbrrrr bbbbbrbbbrbr...
result:
ok 101 tokens
Test #15:
score: 0
Accepted
time: 0ms
memory: 4012kb
input:
15
output:
64 bbbbbbbrbbbbbbb bbbbbbrbbbbbbbr bbbbbbrbbbbbbrr bbbbbbrbbbbbrrb bbbbbbrbbbbrrbb bbbbbbrbbbrrbbb bbbbbbrbbrrbbbb bbbbbbrbrrbbbbb bbbbbbrrrbbbbbb bbbbbrbbbbbbbrb bbbbbrbbbbbbrbr bbbbbrbbbbbbrrr bbbbbrbbbbbrbrb bbbbbrbbbbbrrbr bbbbbrbbbbbrrrr bbbbbrbbbbrbrbb bbbbbrbbbbrrbbr bbbbbrbbbbrrbrr bbbbbrbbb...
result:
ok 101 tokens
Test #16:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
16
output:
72 bbbbbbbbrbbbbbbb bbbbbbbrbbbbbbbb bbbbbbbrbbbbbbbr bbbbbbbrbbbbbbrr bbbbbbbrbbbbbrrb bbbbbbbrbbbbrrbb bbbbbbbrbbbrrbbb bbbbbbbrbbrrbbbb bbbbbbbrbrrbbbbb bbbbbbbrrrbbbbbb bbbbbbrbbbbbbbbr bbbbbbrbbbbbbbrb bbbbbbrbbbbbbbrr bbbbbbrbbbbbbrbr bbbbbbrbbbbbbrrb bbbbbbrbbbbbbrrr bbbbbbrbbbbbrbrb bbbbbbrb...
result:
ok 101 tokens
Test #17:
score: 0
Accepted
time: 1ms
memory: 3860kb
input:
17
output:
81 bbbbbbbbrbbbbbbbb bbbbbbbrbbbbbbbbr bbbbbbbrbbbbbbbrr bbbbbbbrbbbbbbrrb bbbbbbbrbbbbbrrbb bbbbbbbrbbbbrrbbb bbbbbbbrbbbrrbbbb bbbbbbbrbbrrbbbbb bbbbbbbrbrrbbbbbb bbbbbbbrrrbbbbbbb bbbbbbrbbbbbbbbrb bbbbbbrbbbbbbbrbr bbbbbbrbbbbbbbrrr bbbbbbrbbbbbbrbrb bbbbbbrbbbbbbrrbr bbbbbbrbbbbbbrrrr bbbbbbrbb...
result:
ok 101 tokens
Test #18:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
18
output:
90 bbbbbbbbbrbbbbbbbb bbbbbbbbrbbbbbbbbb bbbbbbbbrbbbbbbbbr bbbbbbbbrbbbbbbbrr bbbbbbbbrbbbbbbrrb bbbbbbbbrbbbbbrrbb bbbbbbbbrbbbbrrbbb bbbbbbbbrbbbrrbbbb bbbbbbbbrbbrrbbbbb bbbbbbbbrbrrbbbbbb bbbbbbbbrrrbbbbbbb bbbbbbbrbbbbbbbbbr bbbbbbbrbbbbbbbbrb bbbbbbbrbbbbbbbbrr bbbbbbbrbbbbbbbrbr bbbbbbbrbbbb...
result:
ok 101 tokens
Test #19:
score: 0
Accepted
time: 1ms
memory: 3860kb
input:
19
output:
100 bbbbbbbbbrbbbbbbbbb bbbbbbbbrbbbbbbbbbr bbbbbbbbrbbbbbbbbrr bbbbbbbbrbbbbbbbrrb bbbbbbbbrbbbbbbrrbb bbbbbbbbrbbbbbrrbbb bbbbbbbbrbbbbrrbbbb bbbbbbbbrbbbrrbbbbb bbbbbbbbrbbrrbbbbbb bbbbbbbbrbrrbbbbbbb bbbbbbbbrrrbbbbbbbb bbbbbbbrbbbbbbbbbrb bbbbbbbrbbbbbbbbrbr bbbbbbbrbbbbbbbbrrr bbbbbbbrbbbbbbbr...
result:
ok 101 tokens
Test #20:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
20
output:
110 bbbbbbbbbbrbbbbbbbbb bbbbbbbbbrbbbbbbbbbb bbbbbbbbbrbbbbbbbbbr bbbbbbbbbrbbbbbbbbrr bbbbbbbbbrbbbbbbbrrb bbbbbbbbbrbbbbbbrrbb bbbbbbbbbrbbbbbrrbbb bbbbbbbbbrbbbbrrbbbb bbbbbbbbbrbbbrrbbbbb bbbbbbbbbrbbrrbbbbbb bbbbbbbbbrbrrbbbbbbb bbbbbbbbbrrrbbbbbbbb bbbbbbbbrbbbbbbbbbbr bbbbbbbbrbbbbbbbbbrb bb...
result:
ok 101 tokens
Test #21:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
50
output:
650 bbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbr bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbrr bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbrrb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbb...
result:
ok 101 tokens
Test #22:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
51
output:
676 bbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbr bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbrr bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbrrb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbrrbb bbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbb...
result:
ok 101 tokens
Test #23:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
100
output:
2550 bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...
result:
ok 101 tokens
Test #24:
score: 0
Accepted
time: 1ms
memory: 3888kb
input:
101
output:
2601 bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbr bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...
result:
ok 101 tokens
Test #25:
score: 0
Accepted
time: 1ms
memory: 3924kb
input:
500
output:
62750 bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...
result:
ok 101 tokens
Test #26:
score: -100
Wrong Answer
time: 1ms
memory: 3848kb
input:
501
output:
63001 bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...
result:
wrong answer 2nd words differ - expected: 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb', found: 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb'