Submission #28681045


Source Code Expand

#include<bits/stdc++.h>
int mod;
using namespace std;
int n,m,K;
int a[1000010];
char s[1000010];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	int pos=n,fl=1;
	for(int i=2;i<=n;i++) if(a[i-1]>a[i]){
		pos=i-1;
		break;
	}
	for(int i=2;i<=n;i++) fl&=(a[i-1]==a[i]);
	if(fl) return 0;
	for(int i=1;i<=n;i++) if(a[i]!=a[pos]) printf("%d ",a[i]);puts("");
}

Submission Info

Submission Time
Task A - Erase by Value
User Wu_Ren
Language C++ (GCC 9.2.1)
Score 300
Code Size 399 Byte
Status AC
Exec Time 48 ms
Memory 4536 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:2: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   17 |  for(int i=1;i<=n;i++) if(a[i]!=a[pos]) printf("%d ",a[i]);puts("");
      |  ^~~
./Main.cpp:17:60: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   17 |  for(int i=1;i<=n;i++) if(a[i]!=a[pos]) printf("%d ",a[i]);puts("");
      |                                                            ^~~~
./Main.cpp:8:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    8 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
./Main.cpp:9:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    9 |  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
      |                        ~~~~~^~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 24
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt
All 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 1 ms 3588 KiB
00-sample-002.txt AC 2 ms 3652 KiB
00-sample-003.txt AC 2 ms 3716 KiB
01-001.txt AC 2 ms 3648 KiB
01-002.txt AC 17 ms 4164 KiB
01-003.txt AC 28 ms 4244 KiB
01-004.txt AC 27 ms 4076 KiB
01-005.txt AC 14 ms 4028 KiB
01-006.txt AC 7 ms 3632 KiB
01-007.txt AC 19 ms 4028 KiB
01-008.txt AC 14 ms 3920 KiB
01-009.txt AC 45 ms 4468 KiB
01-010.txt AC 9 ms 3824 KiB
01-011.txt AC 38 ms 4220 KiB
01-012.txt AC 18 ms 4396 KiB
01-013.txt AC 38 ms 4496 KiB
01-014.txt AC 38 ms 4364 KiB
01-015.txt AC 37 ms 4500 KiB
01-016.txt AC 41 ms 4496 KiB
01-017.txt AC 40 ms 4416 KiB
01-018.txt AC 41 ms 4468 KiB
01-019.txt AC 48 ms 4496 KiB
01-020.txt AC 46 ms 4536 KiB
01-021.txt AC 44 ms 4500 KiB