P_Sarker Coding House

import java.util.*; import java.math.*; class Main { public static void main (String[] args) { Scanner in = new Scanner(System.in); while(in.hasNext()) { BigInteger x=in.nextBigInteger(),y=in.nextBigInteger(); System.out.println(x.multiply(y)); } } }

/*  My First Big Integer Code in C++.  Verdict :: Accepted and Time: 0.000 */ #include<bits/stdc++.h> using namespace std; int num[1009], numlen; string x_y(string a, string b) {     int alen=a.size(), blen=b.size(),  sum, carry=0, i, j;     numlen=0;     i=alen-1;     j=blen-1;     for(; i>=0; i--)     {         sum = (a[i] - 48);         if(j>=0)         {             sum+=(b[j] - 48);             j--;         }         sum+=carry;         if(sum > 10)         {          ...

Problem Link :: Uva Goldbach and Euler Code:: goes to below..... /* Verdict :: Accepted Time :: 0.176 ****** The best Rank (3rd) i have ever got in Uva online judge. to Solve that Problem.. ******* */ /// Header file begin #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<utility> #include <queue> #include <algorithm> /// End //.......... /// Macro #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,...

// Accepted /// Header file begin #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<utility> #include <queue> #include <algorithm> /// End //.......... /// Macro #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define mem(c,v) memset(c,v,sizeof(c)) #define cp(a) cout<<" "<<a<<" "<<endl #define nl puts("") #define sq(x) ((x)*(x)) ...

import java.util.*; import java.math.*; class Main { public static void main (String[] args) { Scanner in = new Scanner(System.in); while(in.hasNext()) { BigDecimal r=in.nextBigDecimal(); // take BigDecimal() to read a double data. int n=in.nextInt(); r=r.pow(n).stripTrailingZeros(); // stripTrailingZeros() means no any zeros  // at the last of any number. String ans=r.toPlainString(); // toPlainString() means no any Exp answer. if(ans.charAt(0) == '0') { ans=ans.substring(1,ans.length()); } System.out.println(ans); } } }

// Accepted /// Header file begin #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<utility> #include <queue> #include <algorithm> /// End //.......... /// Macro #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define mem(c,v) memset(c,v,sizeof(c)) #define cp(a) cout<<" "<<a<<" "<<endl #define nl puts("") #define sq(x) ((x)*(x)) ...

import java.util.*; import java.math.*; class Main { public static void main (String[] args) { Scanner in = new Scanner(System.in); BigInteger fact[]=new BigInteger [5010]; BigInteger f = fact[0] = BigInteger.valueOf(1); for(int i=1;i<101;i++) // factorial dp { fact[i] = f.multiply(BigInteger.valueOf(i)); f=fact[i]; } while(in.hasNext()) { int n=in.nextInt(),m = in.nextInt(); if(n==0 && m==0) { break; } //System.out.println(fact[n]); int val = n - m; BigInteger ans = fact[n].divide(fact[val].multiply(fact[m])); System.out.println(n+ " things taken " + m + " at a time is " + ans +" exactly."); } } }