题解 | #奶龙消失!!!#
奶龙消失!!!
https://ac.nowcoder.com/acm/contest/100061/A
开Longlong
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,sum=0;
cin>>n;
vector <int>a(n-1);
for (int i=0;i<n-1;i++){
cin>>a[i];
sum+=a[i];
}
long long int num=(1+n)*n/2-sum;
cout << num <<" ";
int p;
for (int i=0;i<n-1;i++){
if (a[i]==num-1){
cout << i+1;
}
}
return 0;
}
查看9道真题和解析