题解 | 牛牛学数列
牛牛学数列
https://www.nowcoder.com/practice/0b97367cd2184c12a0e02f7c223aee11
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,num=0;
cin >> n;
for (int i = 1; i <= n; i++) {
num += pow(-1, i - 1) * i;
if (i == n) {
cout << num <<endl;
}
}
return 0;
}
