Atcoder A,B,C

A
---
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define sp(y) fixed<<setprecision(y)
#define w(t) int t;cin>>t;while(t--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define mp make_pair
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
ll pow(ll c,ll d){return d==0?:c*pow(c,d-1);}
ll gcd(ll a,ll b) {return b==0? a:gcd(b,a%b);}
ll lcm(ll a,ll b) {return ((a*b)/gcd(a,b));}
//solution
#define mx 1000005
#define m7 1000000007
int prime[mx];

void seive(){
    prime[0]=1;
    prime[1]=1;
    for(ll i=2;i<mx;i++){
        if(prime[i]==0){
            for(ll j=i*i;j<mx;j+=i){
                prime[j]=1;
            }
        }

    }
}




int solve(){
   int a,b,c;
   cin>>a>>b>>c;
   if(a==1){
        a=6;

    }else if(a==4){
             a=3;
    }else if(a== 5){
          a=2;
    }else if(a==6){
       a=1;
    }else if(a==3){
        a=4;
    }else if(a==2){
        a=5;
    }
    if(b==1){
        b=6;

    }else if(b==4){
             b=3;
    }else if(b== 5){
          b=2;
    }else if(b==6){
       b=1;
    }else if(b==3){
        b=4;
    }else if(b==2){
        b=5;
    }

    if(c==1){
        c=6;

    }else if(c==4){
             c=3;
    }else if(c== 5){
          c=2;
    }else if(c==6){
       c=1;
    }else if(c==3){
        c=4;
    }else if(c==2){
        c=5;
    }
    cout<<a+b+c;






return 0;
}
//end solution
int main(){
solve();
}
B
---
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define sp(y) fixed<<setprecision(y)
#define w(t) int t;cin>>t;while(t--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define mp make_pair
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
ll pow(ll c,ll d){return d==0?:c*pow(c,d-1);}
ll gcd(ll a,ll b) {return b==0? a:gcd(b,a%b);}
ll lcm(ll a,ll b) {return ((a*b)/gcd(a,b));}
//solution
#define mx 1000005
#define m7 1000000007
int prime[mx];

void seive(){
    prime[0]=1;
    prime[1]=1;
    for(ll i=2;i<mx;i++){
        if(prime[i]==0){
            for(ll j=i*i;j<mx;j+=i){
                prime[j]=1;
            }
        }

    }
}




int solve(){
   string str;
   cin>>str;
   int len= str.size();
   reverse(all(str));

   REP(i,0,len-1){
       if(str[i]=='6'){
          str[i]='9';
       }else if(str[i]=='9'){
          str[i]='6';
       }

   }
   cout<<str;





return 0;
}
//end solution
int main(){
solve();
}
C
---
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define sp(y) fixed<<setprecision(y)
#define w(t) int t;cin>>t;while(t--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define mp make_pair
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
//ll pow(ll c,ll d){return d==0?:c*pow(c,d-1);}
ll gcd(ll a,ll b) {return b==0? a:gcd(b,a%b);}
ll lcm(ll a,ll b) {return ((a*b)/gcd(a,b));}
//solution
#define mx 1000005
#define m7 1000000007
int prime[mx];
int arr[mx];
void seive(){
    prime[0]=1;
    prime[1]=1;
    for(ll i=2;i<mx;i++){
        if(prime[i]==0){
            for(ll j=i*i;j<mx;j+=i){
                prime[j]=1;
            }
        }

    }
}




int solve(){
   int n;

   cin>>n;
   int a[n+5],b[n+5],c[n+5];
   REP(i,0,n-1){
     cin>>a[i];
     arr[a[i]]++;
   }
   ll cou=0;
   REP(i,0,n-1){
     cin>>b[i];

   }
     REP(i,0,n-1){
     cin>>c[i];
     cou+=arr[b[c[i]-1]];

   }



   cout<<cou;





return 0;
}
//end solution
int main(){
solve();
}