Language: C++

//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int n,m;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>m;
	cout<<6-n-m;
}



//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int n,m;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>m;
	cout<<6-n-m;
}





Compiler output:
a.cc:222:5: error: redefinition of 'int MOD'
  222 | int MOD=1000000007;
      |     ^~~
a.cc:22:5: note: 'int MOD' previously defined here
   22 | int MOD=1000000007;
      |     ^~~
a.cc:223:5: error: redefinition of 'int MOD2'
  223 | int MOD2=998244353;
      |     ^~~~
a.cc:23:5: note: 'int MOD2' previously defined here
   23 | int MOD2=998244353;
      |     ^~~~
a.cc:224:13: error: redefinition of 'std::vector<int> bases'
  224 | vector<int> bases;
      |             ^~~~~
a.cc:24:13: note: 'std::vector<int> bases' previously declared here
   24 | vector<int> bases;
      |             ^~~~~
a.cc:225:10: error: redefinition of 'const ll LLINF'
  225 | const ll LLINF=1ll<<60;
      |          ^~~~~
a.cc:25:10: note: 'const ll LLINF' previously defined here
   25 | const ll LLINF=1ll<<60;
      |          ^~~~~
a.cc:226:12: error: redefinition of 'const char en'
  226 | const char en='\n';
      |            ^~
a.cc:26:12: note: 'const char en' previously defined here
   26 | const char en='\n';
      |            ^~
a.cc:228:9: error: redefinition of 'std::mt19937 rng'
  228 | mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
      |         ^~~
a.cc:28:9: note: 'std::mt19937 rng' previously declared here
   28 | mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
      |         ^~~
a.cc:229:6: error: redefinition of 'void yes()'
  229 | void yes() {cout<<"YES"<<en; exit(0);}
      |      ^~~
a.cc:29:6: note: 'void yes()' previously defined here
   29 | void yes() {cout<<"YES"<<en; exit(0);}
      |      ^~~
a.cc:230:6: error: redefinition of 'void no()'
  230 | void no() {cout<<"NO"<<en; exit(0);}
      |      ^~
a.cc:30:6: note: 'void no()' previously defined here
   30 | void no() {cout<<"NO"<<en; exit(0);}
      |      ^~
a.cc:231:12: error: redefinition of 'int rund()'
  231 | inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
      |            ^~~~
a.cc:31:12: note: 'int rund()' previously defined here
   31 | inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
      |            ^~~~
a.cc:233:6: error: redefinition of 'template<class T> void prVec(std::vector<_Tp>, bool)'
  233 | void prVec(vector<T> w,bool fl=false)
      |      ^~~~~
a.cc:33:6: note: 'template<class T> void prVec(std::vector<_Tp>, bool)' previously declared here
   33 | void prVec(vector<T> w,bool fl=false)
      |      ^~~~~
a.cc:241:6: error: redefinition of 'void M998()'
  241 | void M998()
      |      ^~~~
a.cc:41:6: note: 'void M998()' previously defined here
   41 | void M998()
      |      ^~~~
a.cc:246:4: error: redefinition of 'll raand()'
  246 | ll raand()
      |    ^~~~~
a.cc:46:4: note: 'll raand()' previously defined here
   46 | ll raand()
      |    ^~~~~
a.cc:256:4: error: redefinition of 'll raaand()'
  256 | ll raaand()
      |    ^~~~~~
a.cc:56:4: note: 'll raaand()' previously defined here
   56 | ll raaand()
      |    ^~~~~~
a.cc:261:8: error: redefinition of 'std::string to_upper(std::string)'
  261 | string to_upper(string a)
      |        ^~~~~~~~
a.cc:61:8: note: 'std::string to_upper(std::string)' previously defined here
   61 | string to_upper(string a)
      |        ^~~~~~~~
a.cc:267:8: error: redefinition of 'std::string to_lower(std::string)'
  267 | string to_lower(string a)
      |        ^~~~~~~~
a.cc:67:8: note: 'std::string to_lower(std::string)' previously defined here
   67 | string to_lower(string a)
      |        ^~~~~~~~
a.cc:273:4: error: redefinition of 'll sti(std::string, int)'
  273 | ll sti(string a,int base=10)
      |    ^~~
a.cc:73:4: note: 'll sti(std::string, int)' previously defined here
   73 | ll sti(string a,int base=10)
      |    ^~~
a.cc:285:6: error: redefinition of 'template<class T> void eras(std::vector<_Tp>&, T)'
  285 | void eras(vector<T>& a,T b)
      |      ^~~~
a.cc:85:6: note: 'template<class T> void eras(std::vector<_Tp>&, T)' previously declared here
   85 | void eras(vector<T>& a,T b)
      |      ^~~~
a.cc:290:8: error: redefinition of 'std::string its(ll, int)'
  290 | string its(ll k,int base=10)
      |        ^~~
a.cc:90:8: note: 'std::string its(ll, int)' previously defined here
   90 | string its(ll k,int base=10)
      |        ^~~
a.cc:303:4: error: redefinition of 'll min(ll, int)'
  303 | ll min(ll a,int b)
      |    ^~~
a.cc:103:4: note: 'll min(ll, int)' previously defined here
  103 | ll min(ll a,int b)
      |    ^~~
a.cc:309:4: error: redefinition of 'll min(int, ll)'
  309 | ll min(int a,ll b)
      |    ^~~
a.cc:109:4: note: 'll min(int, ll)' previously defined here
  109 | ll min(int a,ll b)
      |    ^~~
a.cc:315:4: error: redefinition of 'll max(ll, int)'
  315 | ll max(ll a,int b)
      |    ^~~
a.cc:115:4: note: 'll max(ll, int)' previously defined here
  115 | ll max(ll a,int b)
      |    ^~~
a.cc:321:4: error: redefinition of 'll max(int, ll)'
  321 | ll max(int a,ll b)
      |    ^~~
a.cc:121:4: note: 'll max(int, ll)' previously defined here
  121 | ll max(int a,ll b)
      |    ^~~
a.cc:327:4: error: redefinition of 'll gcd(ll, ll)'
  327 | ll gcd(ll a,ll b)
      |    ^~~
a.cc:127:4: note: 'll gcd(ll, ll)' previously defined here
  127 | ll gcd(ll a,ll b)
      |    ^~~
a.cc:333:4: error: redefinition of 'll lcm(ll, ll)'
  333 | ll lcm(ll a,ll b)
      |    ^~~
a.cc:133:4: note: 'll lcm(ll, ll)' previously defined here
  133 | ll lcm(ll a,ll b)
      |    ^~~
a.cc:339:11: error: redefinition of 'template<class T, class K> std::pair<_T1, _T2> mp(T, K)'
  339 | pair<T,K> mp(T a,K b)
      |           ^~
a.cc:139:11: note: 'template<class T, class K> std::pair<_T1, _T2> mp(T, K)' previously declared here
  139 | pair<T,K> mp(T a,K b)
      |           ^~
a.cc:344:12: error: redefinition of 'int mult(ll, ll)'
  344 | inline int mult(ll a,ll b)
      |            ^~~~
a.cc:144:12: note: 'int mult(ll, ll)' previously defined here
  144 | inline int mult(ll a,ll b)
      |            ^~~~
a.cc:349:12: error: redefinition of 'int pot(int, int)'
  349 | inline int pot(int n,int k)
      |            ^~~
a.cc:149:12: note: 'int pot(int, int)' previously defined here
  149 | inline int pot(int n,int k)
      |            ^~~
a.cc:358:5: error: redefinition of 'int divide(int, int)'
  358 | int divide(int a,int b)
      |     ^~~~~~
a.cc:158:5: note: 'int divide(int, int)' previously defined here
  158 | int divide(int a,int b)
      |     ^~~~~~
a.cc:363:12: error: redefinition of 'int sub(int, int)'
  363 | inline int sub(int a,int b)
      |            ^~~
a.cc:163:12: note: 'int sub(int, int)' previously defined here
  163 | inline int sub(int a,int b)
      |            ^~~
a.cc:369:12: error: redefinition of 'int add(int, int)'
  369 | inline int add(int a,int b)
      |            ^~~
a.cc:169:12: note: 'int add(int, int)' previously defined here
  169 | inline int add(int a,int b)
      |            ^~~
a.cc:375:6: error: redefinition of 'bool prime(ll)'
  375 | bool prime(ll a)
      |      ^~~~~
a.cc:175:6: note: 'bool prime(ll)' previously defined here
  175 | bool prime(ll a)
      |      ^~~~~
a.cc:385:11: error: redefinition of 'const int N'
  385 | const int N=300010;
      |           ^
a.cc:185:11: note: 'const int N' previously defined here
  185 | const int N=300010;
      |           ^
a.cc:386:5: error: redefinition of 'int n'
  386 | int n,m;
      |     ^
a.cc:186:5: note: 'int n' previously declared here
  186 | int n,m;
      |     ^
a.cc:386:7: error: redefinition of 'int m'
  386 | int n,m;
      |       ^
a.cc:186:7: note: 'int m' previously declared here
  186 | int n,m;
      |       ^
a.cc:387:5: error: redefinition of 'int dx []'
  387 | int dx[]={0,1,0,-1};
      |     ^~
a.cc:187:5: note: 'int dx [4]' previously defined here
  187 | int dx[]={0,1,0,-1};
      |     ^~
a.cc:388:5: error: redefinition of 'int dy []'
  388 | int dy[]={1,0,-1,0};
      |     ^~
a.cc:188:5: note: 'int dy [4]' previously defined here
  188 | int dy[]={1,0,-1,0};
      |     ^~
a.cc:390:5: error: redefinition of 'int main()'
  390 | int main()
      |     ^~~~
a.cc:190:5: note: 'int main()' previously defined here
  190 | int main()
      |     ^~~~