Best Solution for AvtoBus: Codeforces Round #791 (Div. 2) Problem A

Revision en2, by Sushil07, 2022-06-03 23:14:26

Link to Problem: codeforces.com/contest/1679/problem/A My Solution: //

include <bits/stdc++.h>

define endl "\n"

define int long long

typedef long long ll; int MOD = 1e9+7; int mod = 1e9+7; using namespace std;

void solve() { int n;cin>>n; if(n%2==0&&n>=4){ if(n%6==0) cout<<n/6; else cout<<n/6 +1; cout<<" "; cout<<n/4; } else cout<<-1;

cout<<endl;

}

signed main() {

ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);

int _t; cin >> _t;while (_t--)
solve();

}

Tags problem, solution, 900, codeforces round #796

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Sushil07 2022-06-03 23:16:54 462
en2 English Sushil07 2022-06-03 23:14:26 44
en1 English Sushil07 2022-06-03 23:13:22 636 Initial revision (published)