C题
- 思路
- 代码
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int,int>
const int N=200005;
#define int1 long long
int1 n,m;
int1 a[N],b[N],a_[N];
void solve()
{
cin>>n>>m;
for(int1 i=1;i<=n;i++)
cin>>a[i];
for(int1 i=1;i<=m;i++)
cin>>b[i];
for(int1 i=2;i<=n;i++)
{
a_[i]=abs(a[i]-a[i-1]);
}
int1 cm=a_[2];
for(int1 i=3;i<=n;i++)
{
cm=__gcd(cm,a_[i]);
}
for(int1 i=1;i<=m;i++)
{
int1 x=__gcd(cm,b[i]+a[1]);
cout<<x<<" ";
}
}
int main()
{
int t;
t=1;
while(t--)
{
solve();
}
}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 233333;
char r[maxn], b[maxn];
int main() {
int T;
int n;
scanf("%d", &n);
if(n % 2 == 0) {
ll m = n / 2;
ll ans = (m + 1)*(m+1);
printf("%lld\n", ans);
} else {
ll m = n / 2;
ll p = n - m;
ll ans = 2 * (m + 1) * (p + 1);
printf("%lld\n", ans);
}
}