Submission #9549

#TimeUsernameProblemLanguageResultExecution timeMemory
9549mrcamelVeni, vidi, vici (kriii2_V)C++98
4 / 4
0 ms1664 KiB
#include <cstdio> #include <iostream> #include <fstream> #include <deque> #include <algorithm> #include <utility> #include <vector> #include <cmath> #include <queue> #include <string> using namespace std; #define in cin #define out cout #define PII pair<int, int> #define x first #define y second #define pi 3.14159265358979323846 #define REP(i, v) for(int i=0; i<v; i++) #define REPEQ(i, s, e) for(int i=s; i<=e; i++) #define REPRV(i, s, e) for(int i=s; i>=e; i--) #define all(v) v.begin(), v.end() #define long long int int64 #define BIG(a, b) ( (a>b?a:b) ) int main() { //freopen("in.txt", "r+", stdin); ios::sync_with_stdio(false); int n; in >> n; char al[] = "abcdefghijklmnopqrstuvwxyz"; string str; while( in >> str ) { int len = str.size(); REP(i, len/2) { char a = str[i*2]; char b = str[i*2+1]; //out << ( ((a - 'a') + (b - 'a')) - n) + 26 % 26 << endl; out << al[(( ((a - 'a') + (b - 'a')) - n) + 26) % 26]; } out << " "; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...