Accepted
Code
#include <bits/stdc++.h>
using namespace std;
void solve_by_payel(int n, int samp[])
{
int reslt = 0;
for(int i = 0; i < n; i++)
{
int flag = 0;
for(int j = 0; j < n; j++)
{
if(i != j && samp[i] == samp[j])
{
flag = 1;
break;
}
}
if(flag == 0)
{
reslt = samp[i];
break;
}
}
cout << reslt << endl;
}
int main()
{
int n;
cin >> n;
int samp[n];
for(int i = 0; i < n; i++)
{
cin >> samp[i];
}
solve_by_payel(n, samp);
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1095 Uncovering the Lone Heart
- Contest
- Brain Booster #6
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-10-03 16:36:47
- Judged At
- 2024-12-17 11:34:26
- Judged By
- Score
- 100
- Total Time
- 58ms
- Peak Memory
- 924.0 KiB