QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #418328 | #3739. 字符画 | ZayinCTT# | AC ✓ | 1ms | 3884kb | C++14 | 1.3kb | 2024-05-23 12:40:51 | 2024-05-23 12:40:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fo(v,a,b) for(int v = a; v <= b; v++)
#define fr(v,a,b) for(int v = a; v >= b; v--)
#define cl(a,v) memset(a, v, sizeof(a))
// const int N = 1
int n;
int main()
{
scanf("%d", &n);
fo(i, 1, 3) putchar('o');
fo(i, 1, n) putchar('.');
fo(i, 1, 3) putchar('o');
fo(i, 1, n) putchar('.');
fo(i, 1, 3) putchar('o');
fo(i, 1, n) putchar('.');
fo(i, 1, 3) putchar('o');
puts("");
fo(i, 1, 2) putchar('.');
putchar('o');
fo(i, 1, n) putchar('.');
putchar('o'), putchar('.'), putchar('o');
fo(i, 1, n) putchar('.');
putchar('.'), putchar('o'), putchar('.');
fo(i, 1, n) putchar('.');
printf("o.o"), puts("");
printf("ooo"); fo(i, 1, n) putchar('.');
printf("o.o"); fo(i, 1, n) putchar('.');
printf(".o."); fo(i, 1, n) putchar('.');
printf("ooo"); puts("");
printf("o.."); fo(i, 1, n) putchar('.');
printf("o.o"); fo(i, 1, n) putchar('.');
printf(".o."); fo(i, 1, n) putchar('.');
printf("o.o"); puts("");
printf("ooo"); fo(i, 1, n) putchar('.');
printf("ooo"); fo(i, 1, n) putchar('.');
printf("ooo"); fo(i, 1, n) putchar('.');
printf("ooo"); puts("");
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3884kb
input:
2017
output:
ooo............................................................................................................................................................................................................................................................................................................
result:
ok 5 tokens