C. Multiples of Length(构造)

https://codeforces.com/contest/1397/problem/C

---

思路：

一次[1,n-1],一次[2,n],一次[1,n]

对于每次在(n-1)的基础上凑成n的倍数，最后一次下来就好。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL lcm(LL A,LL B){
   return A/__gcd(A,B)*B;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   LL len=n-1;
   for(LL i=1;i<=n;i++) cin>>a[i];
   if(n==1){
      cout<<"1"<<" "<<"1"<<"\n";
      cout<<-a[1]<<"\n";
      cout<<"1"<<" "<<"1"<<"\n";
      cout<<"0"<<"\n";
      cout<<"1"<<" "<<"1"<<"\n";
      cout<<"0"<<"\n";
      return 0;
   }
   cout<<"1"<<" "<<n-1<<"\n";
   for(LL i=1;i<=n-1;i++){
       LL temp=(a[i])%n;
       temp=temp*len;
       a[i]+=temp;
       cout<<temp<<" ";
   }
   cout<<"\n";

   cout<<"2"<<" "<<n<<"\n";
   for(LL i=2;i<=n;i++){
       LL temp=(a[i])%n;
       temp=temp*len;
       a[i]+=temp;
       cout<<temp<<" ";
   }
   cout<<"\n";
   cout<<"1"<<" "<<n<<"\n";
   for(LL i=1;i<=n;i++){
       if(a[i]<=0){
          cout<<abs(a[i])<<" ";
       }
       else cout<<"-"<<abs(a[i])<<" ";
   }
   cout<<"\n";
   return 0;
}