Skip to main content

codeforces-infinite sequence

#include<iostream>
using namespace std;
int main()
{
 long long a,b,c;
 cin>>a>>b>>c;
 if(c==0)
 { 
  if(a==b)
   cout<<"YES";
  else
   cout<<"NO";
 }
 else
 {
  if((b-a)%c==0 and (b-a)/c>=0)
  {
   cout<<"YES";
  }
  else
  {
   cout<<"NO";
  }
 }
 return 0;
}

Comments

Popular posts from this blog

Codeforces-Dubstep solution

#include < bits / stdc ++. h > using namespace std ; int main () { string str ; getline ( cin , str ); int index = str . find ( "WUB" ); int count = 0 ; while ( index !=- 1 ) { str . replace ( index , 3 , " " ); //str.erase(str.begin()+index,str.begin()+index+3); index = str . find ( "WUB" ); } cout << str ; return 0 ; }

codeforces-Anton and Danik

#include < bits / stdc ++. h > using namespace std ; int main () { long n ; string str ; cin >> n ; cin >> str ; long count = 0 , index ; index = str . find ( "A" ); while ( index !=- 1 ) { count ++; str . erase ( str . begin ()+ index , str . begin ()+ index + 1 ); index = str . find ( "A" ); } if ( count > n - count ) cout << "Anton" ; else if ( count < n - count ) cout << "Danik" ; else cout << "Friendship" ; return 0 ; }