Submission #68737212

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

    // Typedef
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef map<ll, ll> mll;
typedef set<int> si;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
/*
    greater<int> for large to small
    less_equal for not unique
    finding k-th element --> os.find_by_order(k);                           // O(log n)
    finding the number of elements smaller than x --> os.order_by_key(x);   // O(log n)
    os.erase(x);
*/



    // Macros
#define PB push_back
#define IN insert
#define all(x) x.begin(), x.end()
#define trav(i, a) for (auto &i : a)
#define GCD __gcd
#define MP make_pair
#define F first
#define S second
#define endl '\n'
#define sz(x) (ll)x.size()
#define LB lower_bound
#define UB upper_bound
#define DEBUG(i) cout << "DEBUG " << i << "\n";
#define CASE(i) cout << "Case " << i << ": ";
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REV(i, a, b) for (int i = a; i >= b; i--)
#define GT(x) greater<x>()
#define setpre(n) fixed << setprecision(n)
#define print(x) for(auto &i : x) cout << i << " " ; cout '\n'
#define SZ(x) x.size()
#define LEN(s) s.length()
#define MEM(arr, val) memset(arr, val, sizeof(arr));

    // Functions
template <typename T>
void pv(vector<T> &a){
    for (T u : a) cout << u << ' ';
    cout << '\n';
}

template <typename T>
void pv2(vector<vector<T>> &a){
    for (auto &aa : a) {
        pv(aa);
    }
}


    // Constants
const ll MOD7 = 1e9 + 7;
const ll MOD9 = 998244353;
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};


    // Custom Functions
void fast() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}

ll binpow(ll a, ll b, ll m){
    ll res = 1; 

    while (b){
        if (b & 1) res = (res * a) % m; 
        a = (a * a) % m; 
        b >>= 1;
    }
    return res;
}

ull LCM(ull a, ull b){
   return (a * b) / GCD(a, b);
}

    // Custom Comparator
bool cmp(const pair<ll, ll>& x, const pair<ll, ll>& y){
    if (x.F == y.F) return x.S > y.S;
    else return x.F < y.F;
}


    // Extra Info
// INT_MAX for max value... min_diff = INT_MAX
// INT_MIN for min value... max_sum = INT_MIN --> for Kadane's Algorithm

    // Global Variables

bool isOk(int l, int r, ll k, vvi &v){

    ll sum = 0;
    FOR(i, 0, 30){
        if (v[i][r + 1] - v[i][l] == 0) sum += (1 << i);
    }

    if (sum >= k) return 1;
    else return 0;

}


void solve(ll tc){

    int x,y;
    cin >> x >> y;

    int ans = (x + y) % 12;

    if (ans == 0) ans = 12;

    cout << ans << '\n';

}




int main(void){

    fast(); 

    // precal();

    // freopen("fenceplan.in", "r", stdin);
    // freopen("fenceplan.out", "w", stdout);

    ll t = 1;
    int i = 1;
    // cin >> t;

    // for (ll i = 1; i <= t; i++) 
        solve(i);

}

Submission Info

Compile Error

Main.cpp: In function ‘void solve(ll)’:
Main.cpp:131:15: warning: unused parameter ‘tc’ [-Wunused-parameter]
  131 | void solve(ll tc){
      |            ~~~^~
Main.cpp: In function ‘int main()’:
Main.cpp:156:8: warning: unused variable ‘t’ [-Wunused-variable]
  156 |     ll t = 1;
      |        ^

Judge Result