added 1916D

This commit is contained in:
ShazidMahsrafi 2024-01-01 03:22:09 +06:00
parent 5bc6ad588a
commit 3a32646ce4
2 changed files with 103 additions and 2 deletions

View File

@ -0,0 +1,100 @@
#include<bits/stdc++.h>
using namespace std;
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define int long long
#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 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); cerr << endl;
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
#else
#define dbg(x)
#define dbgin(x)
#endif
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
void solve()
{
int n;
cin>>n;
if(n==1)
{
cout<<1<<endl;
return;
}
unordered_set<string>st,ans;
ans.insert("169");
ans.insert("196");
ans.insert("961");
for(int x=5; x<=n; x+=2)
{
st=ans;
ans.clear();
for(auto ele:st)
{
string s;
s = ele+"00";
ans.insert(s);
}
string a,b,s;
for(int i=0; i<(x-3)/2; ++i)
s.pb('0');
a = "1"+s+"6"+s+"9";
b = "9"+s+"6"+s+"1";
ans.insert(a);
ans.insert(b);
}
for(auto x:ans)
cout<<x<<endl;
}
int32_t main()
{
FAST_IO;
int TC = 1;
cin >> TC;
while (TC--)
solve();
}

View File

@ -226,8 +226,9 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
| 214 | 1916 A | 2023 | [Question](https://codeforces.com/problemset/problem/1916/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20A%20-%202023)
| 215 | 1916 B | Two Divisors | [Question](https://codeforces.com/problemset/problem/1916/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20B%20-%20Two%20Divisors)
| 216 | 1916 C | Training Before the Olympiad | [Question](https://codeforces.com/problemset/problem/1916/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20C%20-%20Training%20Before%20the%20Olympiad)
| 217 | 1917 A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20A%20-%20Least%20Product)
| 218 | 1917 B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20B%20-%20Erase%20First%20or%20Second%20Letter)
| 217 | 1916 D | Mathematical Problem | [Question](https://codeforces.com/problemset/problem/1916/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20D%20-%20Mathematical%20Problem)
| 218 | 1917 A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20A%20-%20Least%20Product)
| 219 | 1917 B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20B%20-%20Erase%20First%20or%20Second%20Letter)