题解 | #序列找数#
序列找数
https://www.nowcoder.com/practice/a7d1856a72404ea69fdfb5786d65539c
#include <iostream>
using namespace std;
int a, n, mid,sum2;
int sum(int b);
int main()
{
cin >> a;
for (n = 1; n < (a + 1); n++)
{
cin >> mid;
sum2+=mid;
}
cout << sum(a)-sum2;
}
int sum(int b)
{
if (b == 0) return 0;
return b + sum(b - 1);
}
