1665A - GCD vs LCM - CodeForces Solution

constructive algorithms math

Please click on ads to support us..

Python Code: 

t=int(input())
while(t>0):
    n=int(input())
    if(n%2==0):
        if(n%4==0):
            print(n//4,n//4,n//4,n//4)
        else:
            print(((n-2)//2)-1,((n-2)//2)+1,1,1)
    else:
        print((n-2)//2,((n-2)//2)+1,1,1)


    t=t-1

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double

int32_t main(){
    
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

int t;
cin>>t;
while(t--)
{
    int n;
    cin>>n;
    if(n==4)
    {
        cout<<1<<" "<<1<<" "<<1<<" "<<1<<endl;
        continue;
    }
    if(n==6)
    {
        cout<<3<<" "<<1<<" "<<1<<" "<<1<<endl;
        continue;
    }
    if(n%2==1)
    {
        n-=2;
        int s1=n/2;
        int s2=n-s1;
        cout<<s1<<" "<<s2<<" "<<1<<" "<<1<<endl;


    }
    else
    {
        n-=4;
        int s2=n-2;
        cout<<2<<" "<<s2<<" "<<2<<" "<<2<<endl;
    }

}

return 0;
}


Comments

Submit
0 Comments
More Questions

Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
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