Forgotten Episode
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Polycarpus adores TV series. Right now he is ready to finish watching a season of a popular sitcom "Graph Theory". In total, the season has n episodes, numbered with integers from 1 to n.
Polycarpus watches episodes not one by one but in a random order. He has already watched all the episodes except for one. Which episode has Polycaprus forgotten to watch?
Input
The first line of the input contains integer n (2 ≤ n ≤ 100000) — the number of episodes in a season. Assume that the episodes are numbered by integers from 1 to n.
The second line contains n - 1 integer a1, a2, ..., an (1 ≤ ai ≤ n) — the numbers of episodes that Polycarpus has watched. All values ofai are distinct.
Output
Print the number of the episode that Polycarpus hasn't watched.
Sample test(s)
input
10 3 8 10 1 7 9 6 5 2
output
4
解题报告
一看描述傻眼了,一个叫“
Graph Theory”的电视连续剧。。。在接着看下去。。。额。。。
连CB都没打开,直接用notepad++写上交了。。。
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int hash[101000];
int main()
{
int n,i,j,a;
while(cin>>n)
{
memset(hash,0,sizeof(hash));
for(i=0;i<n-1;i++)
{
cin>>a;
if(!hash[a])
hash[a]=1;
}
for(i=1;i<=n;i++)
{
if(hash[i]==0)
{
cout<<i<<endl;
break;
}
}
}
}