P_Sarker Coding House

// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 100005 #define N 10005 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr clear #define bn begin() #define ed end() using namespace std; double

/* Find the Prime Numbers using Seieve Eratonthenis. And then find the Prime factorization of your desired number. */ /*     Uva 583  Prime Factors     Verdict:: Accepted */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #d

/*     Uva 10539 - Almost Prime Number     Verdict :: Accepted     Time:: 0.066      Solving Tips ::  http://psshi.blogspot.com/2015/10/almost-prime-numbers.html */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 10000005 #define N 100 #define MOD 10000000007

       [ ট্রায়ালিং জিরো বলতে আমি যা বুঝলাম, কোন একটা সংখ্যাকে এমন কোন সংখ্যা দিয়ে ভাগ করলে তার ভাগফল জিরো হবে । এবং ওই সংখ্যাটাই হবে তার বেইস । ] [ A number you will get mod zero to divide another number. Then, that number will be the base of 1st number....] formula:: 9=3*3; (x+1)*(y+1)=(0+1)*(2+1)=3; where, x and y is the power of  2 and 3. Then the result is = 3-1=2; so, again, x,y,z are represented bt the power of 2,3 and 5..... /*     LightOj 1028 - Trailing Zeroes (I)     Verdict :: Accepted */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&a

/*     Uva 673 - Parentheses Balance     Verdict:: Accepted */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 100000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #de

/*     LightOj 1042-Secret Origin     Verdict:: Accepted */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr clear #define bn begin() #def

// Verdict:: Accepted #include <iostream> #include <cstdio> #include <cstring> #include <string> #include <vector> #include <cmath> #include <cctype> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define L long #define LL long long #define N 10000 #define nl puts("") #define MOD 10000000007 #define pb push_back #define ps push #define clr clear #define bn begin() #define ed end()   using namespace std ;   int main ( ) {     int tc,t ;     char ch1 [ 10 ] ,ch2 [ 10 ] ,ch3 [ 10 ] ,ch4 [ 10 ] ;     sf ( "%d" , & tc ) ;     for ( t = 1 ; t <= tc ; t ++ )     {         int a,b,c,d ;         LL b1,b2,b3,b4 ;         sf ( "%d.%d.%d.%d" , & a, & b, & c, & d ) ;         sf ( &qu

 // Verdict:: Accepted // Do some modify and get AC on the "Uva 12403 -Save Satu" problem. #include <iostream> #include <cstdio> #include <cstring> #include <string> #include <vector> #include <cmath> #include <cctype> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define L long #define LL long long #define N 10000 #define nl puts("") #define MOD 10000000007 #define pb push_back #define ps push #define clr clear #define bn begin() #define ed end() using namespace std ; int main ( ) {     int tc,t,ar [ 101 ] ;     char ch [ 8 ] ;     sf ( "%d" , & tc ) ;     for ( t = 1 ; t <= tc ; t ++ )     {         int n,len = 0 ;         LL amount,r = 0 ;         sf ( "%d" , & n ) ;

        // Verdict : Accepted import java.util.* ; import java.math.* ; class Main {     public static void main ( String [ ] args )     {         Scanner in = new Scanner ( System . in ) ;         long tc,t ;         tc = in. nextInt ( ) ;         for ( t = 1 ; t <= tc ; t ++ )         {             BigInteger a = in. nextBigInteger ( ) ,b = in. nextBigInteger ( ) ,m ;             a = a. abs ( ) ; b = b. abs ( ) ;             m = a. mod ( b ) ;             if ( m. equals ( BigInteger . valueOf ( 0 ) ) )             {                 System . out . println ( "Case " + t + ": " + "divisible" ) ;             }             else             {                 System . out . println ( "Case " + t + ": " + "not divisible" ) ;             }         }     } }

/*     Lightoj 1035 - Intelligent Factorial Factorization     Verdict:: Accepted */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop (i,n) for (i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr cle

/* Uva 324 - Factorial Frequencies Verdict:: Accepted Time: 0.078 */ import java.util.*; import java.math.*; class Main {     public static void main (String[] args)     {         Scanner in = new Scanner (System.in);         int n;         //BigInteger f=BigInteger.ONE;         while(in.hasNext())         {             n = in.nextInt();             if (n==0) break;             int len=0,zero=0,one=0,two=0,three=0,four=0,five=0,six=0,seven=0,eight=0,nine=0;             BigInteger a,b,p=BigInteger.valueOf(10),t;             BigInteger fact[]=new BigInteger[850];             //int fact[]=new int [850];             BigInteger f=BigInteger.ONE;             for (int i=1;i<=n;i++)             {                 f=f.multiply(BigInteger.valueOf(i));             }             //System.out.print(f);             a=f; b=f;             while(a!=BigInteger.ZERO)             {                 a=a.mod(p);                 //fact[len++]=a;                 if (a.e