This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
for (int i=0;i<n;i++)
{
cin>>a[i];
}
int x=0,y=-1;
bool b=0;
for (int i=0;i<n-1;i++)
{
if (a[i]==a[i+1])
{
for (int j=1;j<n-1;j++)
{
if (a[j]==a[j+1])
{
x++;
y=a[j];
}
else
{
b=1;
break;
}
}
if (b)
break;
}
}
if (b)
cout<<1<<endl<<y;
else
cout<<y;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |