-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1327A.cpp
82 lines (59 loc) · 1.13 KB
/
1327A.cpp
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
80
81
82
/**#include <bits/stdc++.h>
#include<conio.h>
using namespace std;
//#define ll long long int
void findDistinctOddSum(int n, int k)
{
if ((k * k) <= n &&
(n + k) % 2 == 0){
int val = 1;
int sum = 0;
for(int i = 1; i < k; i++){
cout << val << " ";
sum += val;
val += 2;
}
//cout << n - sum << endl;
cout<<endl;
cout<<"YES"<<endl;
}
else
cout << "NO"<<endl;
}
int main(){
int n,m;
int t;
cin>>t;
while (t -- )
{
/* code
cin>>n>>m;
findDistinctOddSum(n, m);
}
// ll n = 100;
// ll k = 4;
getch();
return 0;
//return 0;
}
**/
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i, j, k;
long long int n, m, t;
cin>>t;
while(t--){
cin>>n>>k;
if(n %2 == k % 2){
if(k * k > n)
cout<<"No"<<endl;
else
cout<<"YES";
}
else
cout<<"NO"<<endl;
}
return 0;
}