Kattis Solution to Death Knight Hero in CPP

#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n;
int won = n;
for (int i = 0; i < n; ++i)
{
string sequence;
cin >> sequence;
if(sequence.find("CD") != -1){
won--;
}
}
cout << won;
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Basketball One-on-One : Kattis Solution in C++

Image
#include<bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]){ string n; cin >> n; int len = n.length(); int scoreA = 0,scoreB = 0; for (int i = 0; i < len; i+=2) { if(n[i] == 'A'){ int score = n[i+1] - '0'; scoreA += score; }else if(n[i] == 'B'){ int score = n[i+1] - '0'; scoreB += score; } } (scoreA > scoreB) ? cout << 'A' : cout << 'B'; return 0; } question Link :  https://open.kattis.com/problems/basketballoneonone
Read more

Kattis Solution to Reverse Binary in C++

Image
#include<bits/stdc++.h> using namespace std; // using namespace std::chrono; int main(int argc, char const *argv[]) {     int n,i=0,t;     cin >> n;       vector<int>v;       // auto start = high_resolution_clock::now();     while(true){         t = n % 2;         v.push_back(t);         n = n / 2;         if(n == 0 ) break;         i++;     }     // auto stop = high_resolution_clock::now();     // auto duration = duration_cast<microseconds>(stop-start);     // cout << duration.count()<<endl;       reverse(v.begin(),v.end());     int index = 0,sum = 0;     for(auto b : v){         if(b == 1){             sum+=pow(2,index);     ...
Read more