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

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 ; }

Gcd using recursion

#include<iostream> #include<algorithm> using namespace std; int gcd(int m,int n) { if(max(m,n)%min(m,n)==0) { return min(m,n); } else { gcd(max(m,n)%min(m,n),min(m,n)); } } int main() { int m,n; cin>>m>>n; cout<<gcd(m,n); return 0; }

Finding the mother node of a graph

#include<bits/stdc++.h> using namespace std; class graph { int v; list<int> *adj; public: graph(int v) { this->v=v; adj=new list<int>[v]; } void add_edge(int v,int w) { adj[v].push_back(w); } void dfs(int start,bool visited[]); int find_mother(); }; void graph::dfs(int start,bool visited[]) { visited[start]=true; for(auto itr=adj[start].begin();itr!=adj[start].end();itr++) { if(!visited[*itr]) { dfs(*itr,visited); } } } int ...

All about programming, algorithms and data structures!

Search This Blog