QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#784388#9799. Magical PaletteQzong#WA 0ms1624kbC++14574b2024-11-26 14:52:422024-11-26 14:52:42

Judging History

你现在查看的是最新测评结果

  • [2024-11-26 14:52:42]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:1624kb
  • [2024-11-26 14:52:42]
  • 提交

answer

#include<cstdio>
int k[1000010];
void work(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n*m;i++)k[i]=0;
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        int x=i+(i-1)*n,y=j+(j-1)*m;
        if(k[1ll*x*y%(n*m)]){
            puts("No");
            return ;
        }
        k[1ll*x*y%(n*m)]=1;
    }
    puts("Yes");
    for(int i=1;i<=n;i++)printf("%d ",i+(i-1)*n);
    puts("");
    for(int j=1;j<=m;j++)printf("%d ",j+(j-1)*m);
    puts("");
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--)work();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 1624kb

input:

2
2 3
2 2

output:

Yes
1 4 
1 5 9 
No

result:

wrong answer Integer parameter [name=b[3]] equals to 9, violates the range [0, 5] (test case 1)