Manohar Codes

Search This Blog

CodingBat makeTags Solution

April 05, 2017

Get link
Facebook
X
Pinterest
Email
Other Apps

public String makeTags(String tag, String word) {
return "<"+tag+">"+word+"</"+tag+">";
}

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Timus OJ 1709 Penguin-Avia Solution

#include <iostream> #include <vector> #include <bitset> // #include <algorithm> // #include <stack> using namespace std; vector<vector<int> > a(101,vector<int>(101)); vector<vector<char> > b(101,vector<char>(101,'0')); int n,d,aa; long long int cost=0; bitset<101> vis; void dfs(int u,int p){ vis[u]=1; for(int i=1;i<=n;i++) if(a[u][i]){ if(!vis[i]) dfs(i,u); else if(i>u&&i!=p) { b[u][i]=b[i][u]='d'; a[u][i]=a[i][u]=0; ...

Timus 1106 Two Teams Solution

#include <iostream> #include <vector> // #include <bitset> #include <algorithm> // #include <map> // #include <queue> using namespace std; vector<int> team(101,-1); vector<vector<int> > a(101); vector<int> ans; void dfs(int u,int k){ team[u]=k; if(k)ans.push_back(u); for(int i=0;i<a[u].size();i++){ if(team[a[u][i]]==-1) dfs(a[u][i],1-k); } } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ int x; cin>>x; while(x){ a[i].push_back(x); cin>>x; ...

Hackerrank Roads in HackerLand Solution

#include <iostream> #include <vector> #include <bitset> #include <queue> #include <algorithm> #include <cstdlib> #include <functional> #include <utility> using namespace std; vector<int> p(100001),rnk(100001,1),child(100001); vector<long long int> sum(400020); vector<pair<int,pair<int,int> > > ed; vector<vector<pair<int,int> > > mst(100001); int n,e; bitset<100001> vis; int find(int a){ return p[a]==a?a:p[a]=find(p[a]); } bool same(int a,int b){ return find(a)==find(b); } void merge(int a,int b){ if(!same(a,b)){ if(rnk[find(a)]>rnk[find(b)]){ p[find(b)]=find(a); } else { p[find(a)]=find(b); ...

Powered by Blogger

CodingBat makeTags Solution

Comments

Post a Comment