Submission #715095

#TimeUsernameProblemLanguageResultExecution timeMemory
715095EmmaKamenčići (COCI21_kamencici)C++11
0 / 70
0 ms212 KiB
#include<bits/stdc++.h> using namespace std; int main (){ int n; bool answ = true; int antun = 0; int counter=0; int turn = 0; int branka = 0; int k; cin>>n>>k; k = k*2-1; string pebbles; cin>>pebbles; while (antun<k&&branka<k){ if(pebbles[counter]==80){ turn++; counter++; } else if(pebbles[n-counter-1]==80){ turn++; counter++; } else { if(turn%2==1){ branka++; } else{ antun++; } turn++; } } if(antun>branka){ answ = false; } if (answ==true){ cout<<"DA"; } else{ cout<<"NE"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...