Skip to main content

Manohar Codes

Search This Blog

CodingBat makeTags Solution

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

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

bat coding codingbat solution

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

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; } } for(int i=1;i<=n;i++) if(team[i]==-1) dfs(i,0); cout<<ans.size()<<endl; cout<<ans[0]; for(int i=1;i<ans.size();i++) cout<<' '<<ans[i]; }

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; cost+=d; } } } int main(){ cin>>n>>d>>aa; for(int i=1;i<=n;i++){ ws(cin); for(int j=1;j<=n;j++) { char c; cin>>c; a[i][j]=c-'0'; } } dfs(1,1); for(int i=2;i<=n;i++){ if(!vis[i]){

Timus 1208. Legendary Teams Contest Solution

#include <iostream> #include <vector> #include <bitset> #include <deque> #include <algorithm> #include <cstdlib> #include <string> #include <map> using namespace std; int k,n=0; vector<vector<string> > a(18,vector<string>(3)); map<string,int> m; bitset<55> vis; int rec(int i){ if(i==k)return 0; int ans1=0; if(vis[m[a[i][0]]]||vis[m[a[i][1]]]||vis[m[a[i][2]]])return rec(i+1); else{ vis[m[a[i][0]]]=vis[m[a[i][1]]]=vis[m[a[i][2]]]=1; ans1=1+rec(i+1); } vis[m[a[i][0]]]=vis[m[a[i][1]]]=vis[m[a[i][2]]]=0; int ans2=rec(i+1); return max(ans1,ans2); } int main(){ cin>>k; for(int i=0;i<k;i++){ ws(cin); for(int j=0;j<3;j++){ string s; cin>>s; if(m.find(s)==m.end()) m.insert({s,n++}); a[i][j]=s; } } cout<<rec(0)<<endl; }

Powered by Blogger