Submission #62517870


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int n,m,a[N],cnt,x;
int main() {
scanf("%d%d",&n,&m);
while(m--) {
scanf("%d",&x);
a[x]=1;
}
for(int i=1;i<=n;i++) cnt+=1-a[i];
printf("%d\n",cnt);
for(int i=1;i<=n;i++) {
if(a[i]==0) printf("%d ",i);
}
printf("\n");
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int n,m,a[N],cnt,x;
int main() {
	scanf("%d%d",&n,&m);
	while(m--) {
		scanf("%d",&x);
		a[x]=1;
	}
	for(int i=1;i<=n;i++) cnt+=1-a[i];
	printf("%d\n",cnt);
	for(int i=1;i<=n;i++) {
		if(a[i]==0) printf("%d ",i);
	} 
	printf("\n");
	return 0;
}

Submission Info

Submission Time
Task B - Who is Missing?
User wanglongye1
Language C++ 20 (gcc 12.2)
Score 200
Code Size 324 Byte
Status AC
Exec Time 1 ms
Memory 3884 KB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:6:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    6 |         scanf("%d%d",&n,&m);
      |         ~~~~~^~~~~~~~~~~~~~
Main.cpp:8:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    8 |                 scanf("%d",&x);
      |                 ~~~~~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 43
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3756 KB
sample_02.txt AC 1 ms 3748 KB
sample_03.txt AC 1 ms 3688 KB
test_01.txt AC 1 ms 3652 KB
test_02.txt AC 1 ms 3688 KB
test_03.txt AC 1 ms 3616 KB
test_04.txt AC 1 ms 3652 KB
test_05.txt AC 1 ms 3656 KB
test_06.txt AC 1 ms 3648 KB
test_07.txt AC 1 ms 3820 KB
test_08.txt AC 1 ms 3688 KB
test_09.txt AC 1 ms 3580 KB
test_10.txt AC 1 ms 3580 KB
test_11.txt AC 1 ms 3624 KB
test_12.txt AC 1 ms 3872 KB
test_13.txt AC 1 ms 3760 KB
test_14.txt AC 1 ms 3820 KB
test_15.txt AC 1 ms 3756 KB
test_16.txt AC 1 ms 3752 KB
test_17.txt AC 1 ms 3596 KB
test_18.txt AC 1 ms 3652 KB
test_19.txt AC 1 ms 3628 KB
test_20.txt AC 1 ms 3816 KB
test_21.txt AC 1 ms 3752 KB
test_22.txt AC 1 ms 3820 KB
test_23.txt AC 1 ms 3636 KB
test_24.txt AC 1 ms 3768 KB
test_25.txt AC 1 ms 3756 KB
test_26.txt AC 1 ms 3640 KB
test_27.txt AC 1 ms 3876 KB
test_28.txt AC 1 ms 3872 KB
test_29.txt AC 1 ms 3884 KB
test_30.txt AC 1 ms 3680 KB
test_31.txt AC 1 ms 3692 KB
test_32.txt AC 1 ms 3676 KB
test_33.txt AC 1 ms 3756 KB
test_34.txt AC 1 ms 3680 KB
test_35.txt AC 1 ms 3872 KB
test_36.txt AC 1 ms 3692 KB
test_37.txt AC 1 ms 3752 KB
test_38.txt AC 1 ms 3628 KB
test_39.txt AC 1 ms 3816 KB
test_40.txt AC 1 ms 3816 KB


2025-04-11 (Fri)
09:43:06 +00:00