video

Video: 
Update...... 

মন্তব্যসমূহ

একটি মন্তব্য পোস্ট করুন

এই ব্লগটি থেকে জনপ্রিয় পোস্টগুলি

Dictionaries and Maps

Dictionaries and Maps:  problems link :   Dictionaries and Maps code:  #include<stdio.h> #include<stdlib.h> #include<string.h> int main() {     char ins[100000][50],inc[50];     int intp[100000];     int i,j,n;     scanf("%d",&n);     for(i=0;i<n;i++)         scanf("%s %d%*c",ins[i],&intp[i]);     for(i=0;i<n;i++)     {         scanf("%s%*c",inc);         for(j=0;j<n;j++)         {             if(strcmp(ins[j],inc)==0)             {                 printf("%s=%d\n",inc,intp[j]);     ...
Next>>>

1022 TDA Rational(Play with oop)

URI 1022 TDA Rational : It is so easy problem. so after see solution try your self. It can be solve various way.But i am use OOP for practicing OOP.And i am use some extra thing. If you solve the problem.But it is not accepted than use uDebug to find out the BUG. Here is the problem  uDebug Link . C++ code:   #include<iostream> #include<math.h> using namespace std; int GCD(int num1,int num2){     if(num1%num2==0){         return num2;     }else{         return GCD(num2,num1%num2);     } } class rational{ private:     int numerator{0};     int denominator{0}; public:     void setData(int numerator,int denominator){         this->numerator = numerator;         this->denominator = denominator;     }friend ostream& operator<<(ostream& out,rational &ob);     rational operator+(rational ro)...
Next>>>

Big Big mod

Here divisor is integer but the number is very very big number. Then it will work. This is the solution of LightOJ problem Link :  Click Here .   #include< iostream > using   namespace  std ; int  main (){      int  T ;     cin >> T ;      for ( int  tc = 1 ; tc <= T ; tc ++){         string a ;          long   long  b ;         cin >> a >> b ;          if ( b < 0 ){             b*=- 1 ;          }          int  p = 0 ;          if ( a [ 0 ]== '-' ){           ...
Next>>>