We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
using namespace std ;
long long arr_anser[1001] ;
long long answer(string s, int k){
for(int i = 0 ; i max){
max = product ;
}
}
return max ;
}
int main(){
int t ;
cin >> t ;
for(int i = 0 ; i> n>> k ;
cin >> s ;
arr_anser[i] = answer(s, k) ;
}
for(int i = 0 ; i
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #8: Largest product in a series
You are viewing a single comment's thread. Return to all comments →
fuct m lừa bố mày
include
include
using namespace std ; long long arr_anser[1001] ; long long answer(string s, int k){ for(int i = 0 ; i max){ max = product ; } } return max ; } int main(){ int t ; cin >> t ; for(int i = 0 ; i> n>> k ; cin >> s ; arr_anser[i] = answer(s, k) ; } for(int i = 0 ; i