1396A - Multiples of Length - CodeForces Solution


constructive algorithms greedy number theory *1600

Please click on ads to support us..

C++ Code:

  /*
        
  ░░░░░░░░░░░░░▄░░░░░░░░░░░░░░░░░░░░░
  ░░░░░░░░░░▄▐░▄▄█████▄▄░░░░░░░░░░░░░░
  ░░░░░░░░░▄█████████████▄▀▄▄░▄▄▄░░░░░░░
  ░░░░░░░░█████████████████▄██████░░░░░░░
  ░░░░░░░████▐█████▌████████▌█████▌░░░░░░░
  ░░░░░░████▌█████▌█░████████▐▀██▀░░░░░░░
  ░░░░▄█████░█████▌░█░▀██████▌█▄▄▀▄░░░░░░░
  ░░░░▌███▌█░▐███▌▌░░▄▄░▌█▌███▐███░▀░░░░░░░
  ░░░▐░▐██░░▄▄▐▀█░░░▐▄█▀▌█▐███▐█░░░░░░░
  ░░░░░███░▌▄█▌░░▀░░▀██░░▀██████▌░░░░░░░
  ░░░░░░▀█▌▀██▀░▄░░░░░░░░░███▐███░░░░░░░░
  ░░░░░░░██▌░░░░░░░░░░░░░▐███████▌░░░░░░░░
  ░░░░░░░███░░░░░▀█▀░░░░░▐██▐███▀▌░░░░░░░░
  ░░░░░░░▌█▌█▄░░░░░░░░░▄▄████▀░▀░░░░░░░
  ░░░░░░░░░█▀██▄▄▄░▄▄▀▀▒█▀█░▀░░░░░░░
  ░░░░░░░░░░░░▀░▀█▀▌▒▒▒░▐▄▄░░░░░░░
  ░░░░░░░░░░░▄▄▀▀▄░░░░░░▄▀░▀▀▄▄░░░░░░░
  ░░░░░░░░░▄▀░▄▀▄░▌░░░▄▀░░░░░░▄▀▀▄░░░░░░░
  ░░░░░░░░▐▒▄▀▄▀░▌▀▄▄▀░░░░░░▄▀▒▒▒▐░░░░░░░ 
  ░░░░░░░▐▒▒▌▀▄░░░░░▌░░░░▄▄▀▒▐▒▒▒▒▌░░░░░░░
  ░░░░░░▐▒▒▐░▌░▀▄░░▄▀▀▄▀▀▒▌▒▐▒▒▒▒▐▐░░░░░░░░
  ░░░░░░▌▄▀░░░▄▀░█▀▒▒▒▒▀▄▒▌▐▒▒▒▒▒▌▌░░░░░░░
  ░░░░░▄▀▒▐░▄▀░░░▌▒▐▒▐▒▒▒▌▀▒▒▒▒▒▐▒▌░░░░░░

  */


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;

// Macros definition
#define ll long long
#define lld long double
#define ln cout<<"\n";
#define print(a) cout<< a << ' '

// Predefined values
ll mod = 1e9+7;

void solve(){
    ll n;
    cin>>n;
    vector<ll>v(n+1);
    vector<int>oddIdx;
    for(int i=1; i<=n; i++){
        cin>>v[i];
        if(v[i]%2) oddIdx.push_back(i);
    }
    // if(oddIdx.empty()){
        
    // }
    print("1 1");
        ln;
        print(-v[1]);
        ln;
    if(n==1){
        print("1 1");
        ln;
        print(0);
        ln;
        print("1 1");
        ln;
        print(0);
        ln;
        return;
    }
    v[1]=0;
    print(1);
    print(n);
    ln;
    for(int i=1; i<=n; i++){
        print(-n*v[i]);
    }
    ln;
    print(2);
    print(n);
    ln;
    for(int i=2; i<=n; i++){
        print((n-1)*v[i]);
    }
    ln;

}

int main(){

    // Deepu Yadav
    ios_base :: sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately
561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts
1822. Sign of the Product of an Array