👍3🔥1
Done with AMAZON exam Successfully through Laptop Access ✅✅✅✅✅
👍3🔥1
❤1
How many of u writing INFOSYS today 10am & 3 pm
Give heart..reactions fast ❤️
Give heart..reactions fast ❤️
❤17
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int dp[n + 1];
memset(dp, 0x3f, sizeof dp);
dp[0] = 0;
for (int i = 0; i < n; i++) {
int digit = S[i] - '0';
for (int j = max(0, i - 2); j < i; j++) {
int sum = 0;
for (int k = j; k <= i; k++) {
sum += S[k] - '0';
}
if (sum % 3 == 0) {
int cost = digit;
for (int k = j; k <= i; k++) {
cost = min(cost, S[k] - '0');
//@Coding_000
}
dp[i + 1] = min(dp[i + 1], dp[j] + cost);
}
}
}
cout << dp[n] << endl;
return 0;
}
C++
INFOSYS EXAM ANS 10AM
Share @Coding_000✅
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int dp[n + 1];
memset(dp, 0x3f, sizeof dp);
dp[0] = 0;
for (int i = 0; i < n; i++) {
int digit = S[i] - '0';
for (int j = max(0, i - 2); j < i; j++) {
int sum = 0;
for (int k = j; k <= i; k++) {
sum += S[k] - '0';
}
if (sum % 3 == 0) {
int cost = digit;
for (int k = j; k <= i; k++) {
cost = min(cost, S[k] - '0');
//@Coding_000
}
dp[i + 1] = min(dp[i + 1], dp[j] + cost);
}
}
}
cout << dp[n] << endl;
return 0;
}
C++
INFOSYS EXAM ANS 10AM
Share @Coding_000✅
👍1