算法概论-作业3-席景科老师 E 凯撒加密法

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
typedef long long LL;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        string k;
        int c;
        cin>>k>>c;
   
            rep(i,0,k.size()-1)
             if(k[i]>='a'&&k[i]<='z')
             {
                k[i]='a'+((k[i]-'a'-c)%26+26)%26;
             }
             else if(k[i]>='A'&&k[i]<='Z')
             {
                k[i]='A'+((k[i]-'A'-c)%26+26)%26;
             }
            cout<<k<<endl;
           
    }
       
}