added 1933
This commit is contained in:
ShazidMahsrafi
parent
c6f2231d73
commit
377a457211
67
Codes/1933 A - Turtle Puzzle Rearrange and Negate/1933A.cpp
Normal file
67
Codes/1933 A - Turtle Puzzle Rearrange and Negate/1933A.cpp
Normal file
@ -0,0 +1,67 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||
#define ll long long
|
||||
#define ull unsigned long long
|
||||
#define endl '\n'
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define pb push_back
|
||||
#define all(x) x.begin(), x.end()
|
||||
#define sz(x) (int)(x).size()
|
||||
#define yes cout<<"YES"<<endl
|
||||
#define no cout<<"NO"<<endl
|
||||
#define neg1 cout<<-1<<endl
|
||||
#define PI 3.141592653589793238
|
||||
#define MIN INT_MIN
|
||||
#define MAX INT_MAX
|
||||
#define INF LONG_LONG_MAX
|
||||
#define MOD 1000000007
|
||||
#define LLM 1000000000000000007
|
||||
|
||||
ll factorial(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||
ll nPr(ll n, ll r) { return factorial(n) / factorial(n - r); }
|
||||
ll nCr(ll n, ll r) { return factorial(n) / (factorial(r) * factorial(n - r));}
|
||||
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||
ull mypow(ull a, ull b) { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
|
||||
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
|
||||
|
||||
#ifndef ONLINE_JUDGE
|
||||
#define dbg(x...) cerr << #x << " : "; _print(x)
|
||||
#else
|
||||
#define dbg(...)
|
||||
#endif
|
||||
void __print(int x) {cerr << x;}void __print(long x) {cerr << x;} void __print(long long x){cerr << x;}
|
||||
void __print(unsigned x){cerr << x;} void __print(unsigned long x){cerr << x;} void __print(unsigned long long x){cerr << x;}
|
||||
void __print(float x){cerr << x;} void __print(double x){cerr << x;} void __print(long double x){cerr << x;}
|
||||
void __print(char x){cerr << x;} void __print(const char *x){cerr << x;} void __print(const string &x){cerr << x;}
|
||||
void __print(bool x){cerr << (x ? "true" : "false");} void _print() { cerr << "\n"; }
|
||||
template <typename A> void __print(const A &x); template <typename A, typename B> void __print(const pair<A, B> &p);
|
||||
template <typename A> void __print(const A &x) {bool f=1; cerr << '['; for (const auto &i : x) {cerr << (f ? "" : ","), __print(i); f = 0;} cerr << ']';}
|
||||
template <typename A, typename B> void __print(const pair<A, B> &p) {cerr << '('; __print(p.first); cerr << ','; __print(p.second); cerr << ')';}
|
||||
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) { __print(H); if (sizeof...(T)) cerr << ", "; _print(T...);}
|
||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
void solve()
|
||||
{
|
||||
int n,sum=0;
|
||||
cin>>n;
|
||||
for(int i=0; i<n; ++i)
|
||||
{
|
||||
int x;
|
||||
cin>>x;
|
||||
sum += abs(x);
|
||||
}
|
||||
cout<<sum<<endl;
|
||||
}
|
||||
|
||||
signed main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
75
Codes/1933 B - Turtle Math Fast Three Task/1933B.cpp
Normal file
75
Codes/1933 B - Turtle Math Fast Three Task/1933B.cpp
Normal file
@ -0,0 +1,75 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||
#define ll long long
|
||||
#define ull unsigned long long
|
||||
#define endl '\n'
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define pb push_back
|
||||
#define all(x) x.begin(), x.end()
|
||||
#define sz(x) (int)(x).size()
|
||||
#define yes cout<<"YES"<<endl
|
||||
#define no cout<<"NO"<<endl
|
||||
#define neg1 cout<<-1<<endl
|
||||
#define PI 3.141592653589793238
|
||||
#define MIN INT_MIN
|
||||
#define MAX INT_MAX
|
||||
#define INF LONG_LONG_MAX
|
||||
#define MOD 1000000007
|
||||
#define LLM 1000000000000000007
|
||||
|
||||
ll factorial(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||
ll nPr(ll n, ll r) { return factorial(n) / factorial(n - r); }
|
||||
ll nCr(ll n, ll r) { return factorial(n) / (factorial(r) * factorial(n - r));}
|
||||
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||
ull mypow(ull a, ull b) { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
|
||||
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
|
||||
|
||||
#ifndef ONLINE_JUDGE
|
||||
#define dbg(x...) cerr << #x << " : "; _print(x)
|
||||
#else
|
||||
#define dbg(...)
|
||||
#endif
|
||||
void __print(int x) {cerr << x;}void __print(long x) {cerr << x;} void __print(long long x){cerr << x;}
|
||||
void __print(unsigned x){cerr << x;} void __print(unsigned long x){cerr << x;} void __print(unsigned long long x){cerr << x;}
|
||||
void __print(float x){cerr << x;} void __print(double x){cerr << x;} void __print(long double x){cerr << x;}
|
||||
void __print(char x){cerr << x;} void __print(const char *x){cerr << x;} void __print(const string &x){cerr << x;}
|
||||
void __print(bool x){cerr << (x ? "true" : "false");} void _print() { cerr << "\n"; }
|
||||
template <typename A> void __print(const A &x); template <typename A, typename B> void __print(const pair<A, B> &p);
|
||||
template <typename A> void __print(const A &x) {bool f=1; cerr << '['; for (const auto &i : x) {cerr << (f ? "" : ","), __print(i); f = 0;} cerr << ']';}
|
||||
template <typename A, typename B> void __print(const pair<A, B> &p) {cerr << '('; __print(p.first); cerr << ','; __print(p.second); cerr << ')';}
|
||||
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) { __print(H); if (sizeof...(T)) cerr << ", "; _print(T...);}
|
||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
void solve()
|
||||
{
|
||||
int n,sum=0,flag=0;
|
||||
cin>>n;
|
||||
for(int i=0; i<n; ++i)
|
||||
{
|
||||
int x;
|
||||
cin>>x;
|
||||
if(x%3==1)
|
||||
flag=1;
|
||||
sum +=x;
|
||||
}
|
||||
dbg(sum);
|
||||
if(sum%3==0)
|
||||
cout<<0<<endl;
|
||||
else if(flag)
|
||||
cout<<1<<endl;
|
||||
else
|
||||
cout<<3-sum%3<<endl;
|
||||
}
|
||||
|
||||
signed main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
@ -0,0 +1,71 @@
|
||||
#include<bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||
#define ll long long
|
||||
#define ull unsigned long long
|
||||
#define endl '\n'
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define pb push_back
|
||||
#define all(x) x.begin(), x.end()
|
||||
#define sz(x) (int)(x).size()
|
||||
#define yes cout<<"YES"<<endl
|
||||
#define no cout<<"NO"<<endl
|
||||
#define neg1 cout<<-1<<endl
|
||||
#define PI 3.141592653589793238
|
||||
#define MIN INT_MIN
|
||||
#define MAX INT_MAX
|
||||
#define INF LONG_LONG_MAX
|
||||
#define MOD 1000000007
|
||||
#define LLM 1000000000000000007
|
||||
|
||||
ll factorial(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||
ll nPr(ll n, ll r) { return factorial(n) / factorial(n - r); }
|
||||
ll nCr(ll n, ll r) { return factorial(n) / (factorial(r) * factorial(n - r));}
|
||||
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||
ull mypow(ull a, ull b) { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
|
||||
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
|
||||
|
||||
#ifndef ONLINE_JUDGE
|
||||
#define dbg(x...) cerr << #x << " : "; _print(x)
|
||||
#else
|
||||
#define dbg(...)
|
||||
#endif
|
||||
void __print(int x) {cerr << x;}void __print(long x) {cerr << x;} void __print(long long x){cerr << x;}
|
||||
void __print(unsigned x){cerr << x;} void __print(unsigned long x){cerr << x;} void __print(unsigned long long x){cerr << x;}
|
||||
void __print(float x){cerr << x;} void __print(double x){cerr << x;} void __print(long double x){cerr << x;}
|
||||
void __print(char x){cerr << x;} void __print(const char *x){cerr << x;} void __print(const string &x){cerr << x;}
|
||||
void __print(bool x){cerr << (x ? "true" : "false");} void _print() { cerr << "\n"; }
|
||||
template <typename A> void __print(const A &x); template <typename A, typename B> void __print(const pair<A, B> &p);
|
||||
template <typename A> void __print(const A &x) {bool f=1; cerr << '['; for (const auto &i : x) {cerr << (f ? "" : ","), __print(i); f = 0;} cerr << ']';}
|
||||
template <typename A, typename B> void __print(const pair<A, B> &p) {cerr << '('; __print(p.first); cerr << ','; __print(p.second); cerr << ')';}
|
||||
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) { __print(H); if (sizeof...(T)) cerr << ", "; _print(T...);}
|
||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
void solve()
|
||||
{
|
||||
ll a,b,l;
|
||||
cin>>a>>b>>l;
|
||||
set<int>st;
|
||||
for(ll x=0; mypow(a,x)<=l; ++x)
|
||||
{
|
||||
for(ll y=0; mypow(b,y)<=l;++y)
|
||||
{
|
||||
ll res=mypow(a,x)*mypow(b,y);
|
||||
if(l%res==0)
|
||||
st.insert(l/res);
|
||||
}
|
||||
}
|
||||
cout<<sz(st)<<endl;
|
||||
}
|
||||
|
||||
signed main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
@ -286,6 +286,9 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
|
||||
| 274 | 1931 A | Recovering a Small String | [Question](https://codeforces.com/problemset/problem/1931/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20A%20-%20Recovering%20a%20Small%20String)
|
||||
| 275 | 1931 B | Make Equal | [Question](https://codeforces.com/problemset/problem/1931/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20B%20-%20Make%20Equal)
|
||||
| 276 | 1931 C | Make Equal Again | [Question](https://codeforces.com/problemset/problem/1931/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20C%20-%20Make%20Equal%20Again)
|
||||
| 277 | 1933 A | Turtle Puzzle Rearrange and Negate | [Question](https://codeforces.com/problemset/problem/1933/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1933%20A%20-%20Turtle%20Puzzle%20Rearrange%20and%20Negate)
|
||||
| 278 | 1933 B | Turtle Math Fast Three Task | [Question](https://codeforces.com/problemset/problem/1933/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1933%20B%20-%20Turtle%20Math%20Fast%20Three%20Task)
|
||||
| 279 | 1933 C | Turtle Fingers Count the Values of k | [Question](https://codeforces.com/problemset/problem/1933/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1933%20C%20-%20Turtle%20Fingers%20Count%20the%20Values%20of%20k)
|
||||
|
||||
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user