CodeForces-code/CF_1679_A.cpp at main · codesmith25103/CodeForces-code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
        ll n;
        cin>>n;
        if(n%2==1)
        {
            cout<<-1<<endl;
            return;
        }
        if(n<4)
        {
            cout<<-1<<endl;
            return;
        }
        if(n==4)
        {
            cout<<1<<" "<<1<<endl;
            return;
        }
        if(n==6)
        {
            cout<<1<<" "<<1<<endl;
            return;
        }
        if(n==8)
        {
            cout<<2<<" "<<2<<endl;
            return;
        }
        if(n%4==0 && n%6==0)
        {
            cout<<n/6<<" "<<n/4<<endl;
            return;
        }
        if(n%4==0 && n%6==4)
        {
            cout<<n/6+1<<" "<<n/4<<endl;
            return;
        }
        if(n%4==0 && n%6==2)
        {
            cout<<n/6+1<<" "<<n/4<<endl;
            return;
        }
        if(n%4==2 && n%6==2)
        {
            cout<<n/6+1<<" "<<n/4<<endl;
            return;
        }
        if(n%6==0 && n%4==2)
        {
            cout<<n/6<<" "<<n/4<<endl;
            return;
        }
        if(n%6==4 && n%4==2)
        {
            cout<<n/6+1<<" "<<n/4<<endl;
            return;
        }


}
int main()
{
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();

    }

    return 0;
}