fzu 1001

[qqmsn270601679]

Problem Description
An array of length n, with address from 1 to n inclusive, contains entries from the set {1,2,...,n-1} and there's exactly two elements with the same value. Your task is to find out the value.



Input
Input contains several cases.
Each case includes a number n (1<n<=10^6), which is followed by n integers.
The input is ended up with the end of file.


Output
Your must output the value for each case, one per line.

Sample Input
2
1 1
4
1 2 3 2
Sample Output
1
2


为什么超时？？

#include <iostream>
using namespace std;
int main()
{

int b,n,i,m,s;
while(scanf("%d",&n))
{
s=0;
m=0;
for(i=0;i<n;i++)
{
scanf("%d",&b);
s=s+b;
m+=i;
}

printf("%d\n",s-m);
}
return 0;
}

[xboy]

问题描述清晰一点，你的程序貌似没什么问题啊

[logiciel]

while(scanf("%d",&n))
改为
while(scanf("%d",&n)!= EOF)

否则循环不会结束，因此超时。

[qqmsn270601679]

好像可以，解决了谢谢