Lightoj-solution/lightoj 1008.cpp at master · AshrafulHaqueToni/Lightoj-solution · 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;

#define ll long long


int main()
{
    //freopen("input.txt","r",stdin);

    int t;
    scanf("%d",&t);

    for(int ii=1;ii<=t;ii++)
    {
        ll n,r,c;

        scanf("%lld",&n);

        ll sq=sqrt(n);

        printf("Case %d: ",ii);

        if(n&1 && sq*sq==n)
        {
            printf("1 %lld\n",sq);
            continue;
        }

        if(n%2==0 && sq*sq==n)
        {
            printf("%lld 1\n",sq);
            continue;
        }

        if(sq%2==0)
        {
            ll val=sq+1;
            ll fi=val*val;

            if(n>=fi-val+1)
            {
                c=fi-n+1;
                r=val;
            }
            else{
               c=val;
               ll minas=fi-val+1-n;
               r=val-minas;
            }

            printf("%lld %lld\n",c,r);
            continue;
        }

        else{
            ll fi=(sq+1)*(sq+1);
            ll val=sq+1;

            if(n>=fi-val+1)
            {
                c=val;
                ll pluss=fi-n+1;
                r=pluss;

            }
            else{
                r=val;
                ll minas=fi-val+1-n;
                c=val-minas;

            }

            printf("%lld %lld\n",c,r);
        }
    }

    return 0;
}