It is clashing with Codeforces Round 324 and I would like to do both contests.
11 Likes
#include <stdio.h>
long long int M(long long int W[],int s,int e)
{
int i = s;
long long int m = 0;
while(i <= e)
{
if(W[i] > m)
{
m = W[i];
}
i++;
}
return m;
}
int main(void) {
int t,i;
scanf("%d",&t);
while(t--)
{
int n,cn = 0;
scanf("%d",&n);
char A[n + 1],G[n + 1];
long long int W[n + 1],an;
scanf("%s\n%s",A,G);
i = 0;
while(i <= n)
{
scanf("%lld",&W[i++]);
}
i = 0;
while(i < n)
{
if(A[i] == G[i])
cn++;
i++;
}
if(cn == 0)
an = W[0];
else if(cn == n)
an = W[n];
else
{
an = M(W,0,cn);
}
printf("%lld\n",an);
}
return 0;
}
Same request from my side too
1 Like