QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#562466 | #8186. Fast Travel Coloring | Afterlife# | WA | 0ms | 3572kb | C++20 | 681b | 2024-09-13 17:48:47 | 2024-09-13 17:48:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
string s[7]={
"1101100",
"1110001",
"0011000",
"1000111",
"0100110",
"0011010",
"0011101"
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=0;i<7*n;++i){
for(int j=0;j<7*n;++j){
int u=i%n+1,v=j%n+1;
if(u==v){
cout<<(i==j?0:u)<<' ';
}
else{
if(s[i/n][j/n]=='0'){
cout<<u<<' ';
}
else{
cout<<v<<' ';
}
}
}
cout<<'\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
1
output:
0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3552kb
input:
2
output:
0 2 1 2 1 1 1 2 1 2 1 1 1 1 1 0 1 2 2 2 1 2 1 2 2 2 2 2 1 2 0 2 1 2 1 1 1 1 1 1 1 2 1 2 1 0 1 2 2 2 2 2 2 2 1 2 1 1 1 1 0 2 1 2 1 1 1 1 1 1 2 2 2 2 1 0 1 2 2 2 2 2 2 2 1 2 1 1 1 1 0 1 1 2 1 2 1 2 1 2 2 2 2 2 2 0 1 2 1 2 1 2 1 1 1 2 1 1 1 1 0 2 1 2 1 1 2 2 1 2 2 2 2 2 1 0 1 2 2 2 1 1 1 1 1 ...
result:
wrong answer a[1][0] =/= a[0][1]