From b17c3378bec69022ebfaf8fefda2d5d9e6463d57 Mon Sep 17 00:00:00 2001 From: ShazidMahsrafi Date: Fri, 23 Aug 2024 00:16:44 +0600 Subject: [PATCH] feat: Add solution for Codeforces problem 1475A --- Codes/1475 A - Odd Divisor/1475A.cpp | 41 ++ Readme.md | 569 ++++++++++++++------------- 2 files changed, 326 insertions(+), 284 deletions(-) create mode 100644 Codes/1475 A - Odd Divisor/1475A.cpp diff --git a/Codes/1475 A - Odd Divisor/1475A.cpp b/Codes/1475 A - Odd Divisor/1475A.cpp new file mode 100644 index 0000000..fb66170 --- /dev/null +++ b/Codes/1475 A - Odd Divisor/1475A.cpp @@ -0,0 +1,41 @@ +#include +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + int n; + cin>>n; + yn(n&(n-1)); +} + +signed main() +{ + FAST; + int TCS = 1; + cin >> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "<