QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#749764#8651. Table Tennislfyszy0 5ms3632kbC++14667b2024-11-15 10:02:112024-11-15 10:02:11

Judging History

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

  • [2024-11-15 10:02:11]
  • 评测
  • 测评结果:0
  • 用时:5ms
  • 内存:3632kb
  • [2024-11-15 10:02:11]
  • 提交

answer

#include<bits/stdc++.h> 
#define int long long 
#define x first 
#define y second 
#define il inline 
#define em emplace 
#define eb emplace_back 
#define debug() puts("-----") 
using namespace std; 
typedef pair<int,int> pii; 
il int read(){ 
	int x=0,f=1; char ch=getchar(); 
	while(ch<'0'||ch>'9'){ if(ch=='-') f=-1; ch=getchar(); } 
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar(); 
	return x*f; 
} 
il void solve(){ 
	int n=read(),m=read(); 
	cout<<"Yes"<<endl; 
	for(int i=1;i<=n;i++){ 
		for(int j=1;j<=i;j++){ 
			cout<<1; 
		} cout<<endl; 
	} 
} 
signed main(){ 
	int T=read(); 
	while(T--) solve(); 
	return 0; 
} 

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 5ms
memory: 3632kb

input:

97
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 0
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 0
58 0
59 0
60 0
61 0
62 0
63 0...

output:

Yes
1
11
111
Yes
1
11
111
1111
Yes
1
11
111
1111
11111
Yes
1
11
111
1111
11111
111111
Yes
1
11
111
1111
11111
111111
1111111
Yes
1
11
111
1111
11111
111111
1111111
11111111
Yes
1
11
111
1111
11111
111111
1111111
11111111
111111111
Yes
1
11
111
1111
11111
111111
1111111
11111111
111111111
1111111111
...

result:

wrong answer Token "111" doesn't correspond to pattern "(Yes)|(No)" (test case 2)

Subtask #2:

score: 0
Wrong Answer

Test #58:

score: 0
Wrong Answer
time: 1ms
memory: 3564kb

input:

1
4 4

output:

Yes
1
11
111
1111

result:

wrong answer expected 4 ways, but found 0 ways (test case 1)

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Skipped

Dependency #3:

0%

Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Skipped

Dependency #1:

0%