Submission #62514218


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e3+10,M=1e5+10;
int n,m,a[N];
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int b;
cin>>b;
a[b]=1;
}
cout<<n-m<<endl;
for(int i=1;i<=n;i++)
{
if(a[i]==0)
{
cout<<i<<" ";
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e3+10,M=1e5+10;
int n,m,a[N];
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int b;
		cin>>b;
		a[b]=1;
	}
	cout<<n-m<<endl;
	for(int i=1;i<=n;i++)
	{
		if(a[i]==0)
		{
			cout<<i<<" ";
		}
	}
	return 0;
}
 

Submission Info

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

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 3376 KB
sample_02.txt AC 1 ms 3432 KB
sample_03.txt AC 1 ms 3480 KB
test_01.txt AC 1 ms 3648 KB
test_02.txt AC 1 ms 3472 KB
test_03.txt AC 1 ms 3500 KB
test_04.txt AC 1 ms 3452 KB
test_05.txt AC 1 ms 3456 KB
test_06.txt AC 1 ms 3516 KB
test_07.txt AC 1 ms 3564 KB
test_08.txt AC 1 ms 3492 KB
test_09.txt AC 1 ms 3504 KB
test_10.txt AC 1 ms 3500 KB
test_11.txt AC 1 ms 3508 KB
test_12.txt AC 1 ms 3452 KB
test_13.txt AC 1 ms 3460 KB
test_14.txt AC 1 ms 3472 KB
test_15.txt AC 1 ms 3468 KB
test_16.txt AC 1 ms 3408 KB
test_17.txt AC 1 ms 3444 KB
test_18.txt AC 1 ms 3468 KB
test_19.txt AC 1 ms 3468 KB
test_20.txt AC 1 ms 3512 KB
test_21.txt AC 1 ms 3448 KB
test_22.txt AC 1 ms 3380 KB
test_23.txt AC 1 ms 3444 KB
test_24.txt AC 1 ms 3500 KB
test_25.txt AC 1 ms 3496 KB
test_26.txt AC 1 ms 3568 KB
test_27.txt AC 1 ms 3580 KB
test_28.txt AC 1 ms 3448 KB
test_29.txt AC 1 ms 3580 KB
test_30.txt AC 1 ms 3456 KB
test_31.txt AC 1 ms 3436 KB
test_32.txt AC 1 ms 3448 KB
test_33.txt AC 1 ms 3504 KB
test_34.txt AC 1 ms 3544 KB
test_35.txt AC 1 ms 3344 KB
test_36.txt AC 1 ms 3444 KB
test_37.txt AC 1 ms 3516 KB
test_38.txt AC 1 ms 3448 KB
test_39.txt AC 1 ms 3384 KB
test_40.txt AC 1 ms 3580 KB


2025-04-11 (Fri)
12:47:43 +00:00