Codeforces 268A. A. Games Solution

Solve in C++:

//AH Tonmoy
//Department of CSE ,Islamic University
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[1000],b[1000],i,c=0,j;
    while(cin>>n)
    {
        for(i=0; i<n; i++)
        {
           cin>>a[i]>>b[i];
        }
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
                if(a[i]==b[j])
                c++;
        }
        cout<<c<<endl;
        c=0;
    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.