P_Sarker Coding House

#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<string> #include<bitset> #define sf scanf #define pf printf #define mx 1010 using namespace std; bitset<mx>bs; int prm[mx], plen=0; void sieve() {     int i,j;     bs.set();     bs[0]=bs[1]=0;     for(i=2; i<mx; i++)     {         if(bs[i])         {             prm[plen++] = i;             for(j=i*i; j<mx; j+=i)             {                 bs[j] = 0;             }         }    ...

// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <string> #include <cmath> #include <vector> #define N 100 #define sf scanf #define pf printf using namespace std; int stats[(N/2)+1],arr[N],len=1; void prime () {     int i,j,qrt;     for (i=2;i<=N>>1;i++)     {         stats[i] = 0;     }     qrt = int (sqrt(double (N)));     for (i=3;i<=qrt;i+=2)     {         if (stats[i>>1] == 0) {         for (j=i*i;j<=N;j+=i+i)         {             stats[j>>1] = 1;         }         }     }     arr[0] = 2;  ...

#include<bits/stdc++.h> #define mx 110 using namespace std; string str[mx]; int num[mx]; struct my {     int velo,posi; }; my tmp[mx]; int BS(int lo, int hi, int itm) {     int mid;     while(lo <= hi)     {         mid = (lo + hi) / 2;         if(num[mid] == itm) return mid;         else if(num[mid] > itm) hi = mid - 1;         else if(num[mid] < itm) lo = mid + 1;     }     if(lo > hi) return -1;     else return lo; } void Right(int n) {     for(int i=0; i<n; i++)     {         cout << "right of ";     } } void Left(int n) {     for(int i=0; i<n; i++)     {         cout ...

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #include<string> #include<stack> #define sf scanf #define pf printf #define mx 20010 #define white 0 #define gray 1 #define black 2 using namespace std; typedef map<string, int>mpsi; typedef vector < vector <int> >vvii; typedef vector<int>vi; vi G[mx]; int color[mx]; bool cycle = false; void graph_clear() {     for(int i=0; i<mx; i++)     {         G[i].clear();     } } void DFS_Visit(int u) {     color[u] = gray;     int i , v;     for(i=0; i<G[u].size(); i++)     {         v = G[u][i];         if(color[v] == white)         {        ...

#include<bits/stdc++.h> using namespace std; typedef long long LL; typedef unsigned long long ull; void fun() {     for(int i=0; ; i++)     {         if((i * 123456) > 1000000000)         {             cout << i;             break;         }     } } int main() {     LL n;     //fun();     while(cin >> n)     {         int i,j;         LL ans=0;         bool possible=false;         for(i=0; i<=811; i++)         {      ...

#include<bits/stdc++.h> using namespace std; typedef long long LL; template<class T> T gcd(T a, T b) {     if(b==0)     {         return a;     }     else     {         return gcd(b, a%b);     } } int main() {     LL n, a, b , p , q;     while(cin >> n >> a >> b >> p >> q)     {         LL tile = (a / gcd(a,b)) * b; // lcm for n. if n=5 then, 1/2 or 1/3 + 2/2 + 3/3+4/2+5/2 or 5/3..so, lcm(a,b);         LL total = ( (n / a) * p ) + ( (n / b) * q );         tile = n / tile; // for n tile         LL ans = total - ( tile * min(p,q) );         cout << ans << "\n"; ...

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> using namespace std; #define sf scanf #define pf printf typedef long long LL; int main() {     LL n,k;     while(~sf("%lld %lld", &n, &k))     {         if(n < k)         {             pf("%lld\n", k);         }         else         {             //LL quotient = n / k;             //k = k*(quotient+1);             k = k * ( (n/k) + 1 );             ...

#include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include<vector> #include<cstring> #include<string> #include<map> #define sf scanf #define pf printf using namespace std; typedef long long LL; int main() {     ios_base::sync_with_stdio(0);     string ms, sb;     while(cin >> ms)     {         cin >> sb;         LL mlen=ms.length() , sblen=sb.length(), i , cnt=0;         for(i=0; i<mlen; i++)         {             if(ms.substr(i,sblen) == sb)             {                 i+=(sblen-1);       ...

// Accepted // Time: 0.156 // Accepted #include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include<vector> #include<cstring> #include<string> #include<map> #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; //LL ar[2147516417]; vll dp; void sequence() {     LL i , sum=2;     //dp[2]=1;     dp.push_back(1);     dp.push_back(2);     for(i=2; i<=2147483648; i++)     {         sum += i;         if(sum > 2147483648)         {             //dp[sum] = 1;             //cout << sum;             break; ...

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<string> #include<vector> #include<map> #include<algorithm> using namespace std; typedef vector<int>vii; typedef map<int, int>mpii; int ar[1100]; struct my {     int num, velo; }; my myar[1100]; bool cmp(my a, my b) {     return a.velo > b.velo; } int main() {     mpii mp;     int x,i;     while(cin >> x)     {         int arlen=0;         mp.clear();         if(mp.count(x) == 0)         {             ar[arlen++] = x;             mp[x] = 1;         }    ...

#include<bits/stdc++.h> using namespace std; int main() {     int number=0 , p = 131071;     char ch;     while(cin >> ch)     {         if(ch=='#')         {             if(number)             {                 cout << "NO\n";             }             else             {                 cout << "YES\n";             }        ...

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #define sf scanf #define pf printf #define S 1000100 using namespace std; typedef long long LL; typedef pair<LL, LL> pll; const int mod = 1000000007; int prime[(S>>6) + 1] , prm[(S>>1) + 9], plen=0; #define setbit(n) (prime[n>>6] |= (1 << ((n>>1)&31))) #define checkbit(n) (prime[n>>6] & (1 << ((n>>1)&31))) void sieve() {     LL i,j;     for(i=3; i*i<S; i+=2)     {         if(!checkbit(i))         {             for(j=i*i; j<S; j+=(2*i))             {               ...

#include<iostream> #include<cstring> #include<string> #include<cstdio> #include<cmath> #include<vector> #include<algorithm> #include<map> #define sf scanf #define pf printf using namespace std; char ch[1100]; int ar[1100]; int main() {     while(~sf("%s" , &ch))     {         int len = strlen(ch) , i , maxi = -1 , tmp , arlen=0 ;         for(i=0; i<len; i++)         {             if(ch[i]>='1' and ch[i]<='4')             {                 tmp = ch[i] - 48;                 ar[arlen++] = tmp;         ...

#include<iostream> #include<cstring> #include<string> #include<cstdio> #include<cmath> #include<vector> #include<map> #define sf scanf #define pf printf using namespace std; char ek[1100] , dui[1100]; int main() {     while(~sf("%s %s" , &ek, &dui))     {         int eklen = strlen(ek) , duilen = strlen(dui) , i;         for(i=0; i<eklen; i++)         {             if(ek[i] >='A' and ek[i]<='Z')             {                 ek[i] = ek[i] + 32;             }         }         for(i=0; i<d...

#include<iostream> #include<cstdio> #include<cmath> #include<vector> #include<map> #include<bitset> #define high 1000010 using namespace std; typedef long long LL; typedef vector<LL>vll; bitset<high>bs; LL prm[(high>>1)+9] , plen=0; int len; vll v; void sieve() {     LL i,j;     bs[0] = bs[1] = 0;     bs.set();     for(i=2; i<high; i++)     {         if(bs[i])         {             prm[plen++] = i;             for(j=i*i; j<high; j+=i)             {                 bs[j] = 0;             }  ...

// Accepted #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<map> #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef map<LL, bool> mpbll; LL f[22]; void factorial() {     int i;     f[0] = 1;     f[1] = 1;     for(i=2; i<21; i++)     {         f[i] = f[i-1] * i;     }     //for(i=1; i<21; i++) cout << f[i] << " "; } int Search_Binary(LL itm) {     int lo=1, hi=20, mid;     while(lo <= hi)     {         mid = (lo + hi) / 2;         if(f[mid] == itm)         {             return mid;    ...