#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve();
int main()
{
//@cpsolutions
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
ll int t=1;
/*is Single Test case?*/
cin >> t;
// t=1;
//single test case -= Delete if t testCases =-
while (t--) {
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
int z;
cin>>z;
return 0;
}
void solve()
{
ll n;cin>>n;
if(n%4 == 0) cout<<"NO";
else cout<<"YES";
}
using namespace std;
#define ll long long
void solve();
int main()
{
//@cpsolutions
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
ll int t=1;
/*is Single Test case?*/
cin >> t;
// t=1;
//single test case -= Delete if t testCases =-
while (t--) {
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
int z;
cin>>z;
return 0;
}
void solve()
{
ll n;cin>>n;
if(n%4 == 0) cout<<"NO";
else cout<<"YES";
}
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while(t--)
{
int i, num;
cin >> num;
for(i = 1; i <= num; i++) {
cout << i << " ";
}
cout<<"\n";
}
return 0;
}
using namespace std;
int main() {
int t;
cin >> t;
while(t--)
{
int i, num;
cin >> num;
for(i = 1; i <= num; i++) {
cout << i << " ";
}
cout<<"\n";
}
return 0;
}
Competitive Programming Solutions
Message
FAKE SWAPS SOLUTION
Number of Valid Move Combinations On Chessboard solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Number of Valid Move Combinations On Chessboard solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Number of Valid Move Combinations On Chessboard solution leetcode
Plates Between Candles solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Plates Between Candles solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Plates Between Candles solution leetcode
Two Best Non-Overlapping Events solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Two Best Non-Overlapping Events solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Two Best Non-Overlapping Events solution leetcode
Kth Distinct String in an Array solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Kth Distinct String in an Array solution leetcode
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Kth Distinct String in an Array solution leetcode
ERA CODEFORCES SOLUTION
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
ERA CODEFORCES SOLUTION IN THE ARTICLE
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
ERA CODEFORCES SOLUTION IN THE ARTICLE
XOR Specia-LIS-t solution codeforces
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
XOR Specia-LIS-t solution codeforces in the article
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
XOR Specia-LIS-t solution codeforces in the article
Di-visible Confusion solution codeforces
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Di-visible Confusion solution codeforces
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Di-visible Confusion solution codeforces
Moderate Modular Mode solution codeforces
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Moderate Modular Mode solution codeforces
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Moderate Modular Mode solution codeforces
Extreme Extension solution codeforces in the article
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Extreme Extension solution codeforces in the article
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Extreme Extension solution codeforces in the article
Artistic Partition solution codeforces in the article
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Artistic Partition solution codeforces in the article
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Artistic Partition solution codeforces in the article
Leetcode solutions
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Leetcode solutions
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
https://tinyurl.com/jb233422
Leetcode solutions