Skip to content

Instantly share code, notes, and snippets.

Avatar

Kazi Fardin Islam Abir fardinabir

View GitHub Profile
View UVA_10132_FileFragment.cpp
#include <bits/stdc++.h>
#define mxs 100005
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define print_case printf("Case %lld: ",ts++)
using namespace std;
int arr[3005],brr[300005],n,m,cnt;
View uva_10755.cpp
#include <bits/stdc++.h>
#define mxs 100005
#define ll long long int
#define print_case printf("Case %lld: ",ts++)
using namespace std;
ll arr[100005],n,m,cnt;
ll qube[21][21][21],cum[21][21][21],sum[21];
View timus_1414.cpp
#include <bits/stdc++.h>
#define mxs 100005
#define ll long long int
#define print_case printf("Case %lld: ",ts++)
using namespace std;
ll arr[100005],n,m,cnt;
vector <string> svc;
string str;
View toph_MSIS_BIT.cpp
#include <bits/stdc++.h>
#define mxs 100005
#define ll long long int
using namespace std;
int arr[100005],n,m;
ll node[100005];
pair <int,int> pi[100005];
ll query(int ind)
View toph_JumpingFrogII.cpp
#include <bits/stdc++.h>
using namespace std;
struct nn
{
int lazy,cnt;
nn()
{
lazy=0;
View timus_1439.cpp
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ordered_set sett;
View timus_1090_PBDS.cpp
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define test_case printf("Case %d:\n",id++);
using namespace std;
using namespace __gnu_pbds;
ll arr[100005],fq[100000],node[100005],ind[26],ind1[26],n,m;
View timus_1090_BIT.cpp
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define test_case printf("Case %d:\n",id++);
using namespace std;
using namespace __gnu_pbds;
ll arr[100005],fq[100000],node[100005],ind[26],ind1[26],n,m;
View timus_1521.cpp
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define test_case printf("Case %d:\n",id++);
using namespace std;
using namespace __gnu_pbds;
ll arr[1000000],fq[1000000],dp[1000000],ind[26],ind1[26],n,m;
View timus_1028_BIT.cpp
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define test_case printf("Case %d:\n",id++);
using namespace std;
using namespace __gnu_pbds;
ll arr[100005],fq[100000],node[400005],ind[26],ind1[26],n,m;