odws, C++ (gcc) - rextester

Language: Layout:

//#include<bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>

#define fr(i,m,n) for(i=m;i<n;i++)
#define ifr(i,m,n) for(i=m;i>n;i--)
#define ll long long
#define ull unsigned ll
#define sc scanf
#define pf printf
#define var(x) x i=0,j=0,k=0,tmp1=0,tmp2=0,tmp3=0,tmp=0,tmp4=0,tmp5=0,flag=0,T=0,N
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvii vector<vector<pair<int,int> > >
#define vl vector<ll>
#define vll vector<pair<ll,ll> >
#define all(c) c.begin(), c.end() 
#define br cout<<"\n"
#define MOD 1000000007

using namespace std;

template <typename T>
T modpow(T base, T exp, T modulus) {
  base %= modulus;
  T result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}

int main()
{
	var(int);
	char s[101], t[101];
	int dif[101];
	cin>>T;
	fr(k,1,T+1)
	{
		cin>>s;
		cin>>t;
		int n = strlen(s);
		int b = 0;
		ifr(i,n-1,-1)
		{
			int a = t[i], b = s[i];
			if(a<b)
			{
				a=a*26+a;
				t[i - 1]--;
			}
			dif[i] = a - b;
		}

ll sum = 0;
		ifr(i,n-1,-1)
			sum = (sum + (dif[i]*modpow(26,n-1-i,MOD))%MOD );
		cout<<"Case "<<k<<": ";
		if(sum <= 1)
			cout<<"0\n";
		else
			cout<<sum-1<<"\n";
	} 
}

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 1.02 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 4 Mb, absolute service time: 1.2 sec