#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
#ifdef LOCAL
#define DTP(x, y) \
auto operator<<(auto &o, auto a)->decltype(y, o) \
{ \
o << "("; \
x; \
return o << ")"; \
}
DTP(o << a.first << ", " << a.second, a.second);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define debug(...) 42
#endif
stringstream os;
void testing()
{
/*
Here create tests by pushing to os (<<).
*/
os = stringstream();
os.seekg(0, ios::beg);
cin.rdbuf(os.rdbuf());
}
int red(int x)
{
if (x > 1000)
return x - 1000;
if (x <= 0)
return x + 1000;
return x;
}
pii code(int a, int b)
{
if (abs(b - a) == 1 || (max(a, b) == 1000 && min(a, b) == 1))
return {red(a + 2), red(b + 2)};
else
return {red(a + 1), red(b + 1)};
}
pii decode(int a, int b)
{
if (abs(b - a) == 1 || (max(a, b) == 1000 && min(a, b) == 1))
return {red(a - 2), red(b - 2)};
else
return {red(a - 1), red(b - 1)};
}
void solve()
{
string S;
cin >> S;
int a, b;
cin >> a >> b;
if (S == "Algosia")
cout << code(a, b).first << ' ' << code(a, b).second << endl;
else
cout << decode(a, b).first << ' ' << decode(a, b).second << endl;
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int Z = 1;
// cin >> Z;
while (Z--)
solve();
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = a; i < (b); ++i) #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() #define YES cout << "YES\n" #define NO cout << "NO\n" typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vl; typedef long double ld; #ifdef LOCAL #define DTP(x, y) \ auto operator<<(auto &o, auto a)->decltype(y, o) \ { \ o << "("; \ x; \ return o << ")"; \ } DTP(o << a.first << ", " << a.second, a.second); DTP(for (auto i : a) o << i << ", ", all(a)); void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; } #define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x) #else #define debug(...) 42 #endif stringstream os; void testing() { /* Here create tests by pushing to os (<<). */ os = stringstream(); os.seekg(0, ios::beg); cin.rdbuf(os.rdbuf()); } int red(int x) { if (x > 1000) return x - 1000; if (x <= 0) return x + 1000; return x; } pii code(int a, int b) { if (abs(b - a) == 1 || (max(a, b) == 1000 && min(a, b) == 1)) return {red(a + 2), red(b + 2)}; else return {red(a + 1), red(b + 1)}; } pii decode(int a, int b) { if (abs(b - a) == 1 || (max(a, b) == 1000 && min(a, b) == 1)) return {red(a - 2), red(b - 2)}; else return {red(a - 1), red(b - 1)}; } void solve() { string S; cin >> S; int a, b; cin >> a >> b; if (S == "Algosia") cout << code(a, b).first << ' ' << code(a, b).second << endl; else cout << decode(a, b).first << ' ' << decode(a, b).second << endl; } int main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); int Z = 1; // cin >> Z; while (Z--) solve(); } |
English