# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253430 | Badrangiikh | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include <deque>
#include <cmath>
using namespace std;
#define ll long long
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
long long n , i ;
long long shoes [ 200045 ] ;
int main() {
scanf ( "%lld" , & n ) ;
for ( i = 0 ; i < 2 * n ; i ++ ) {
scanf ( "%lld" , & shoes [ i ] ) ;
}
printf ( "%lld" , n * ( n - 1 ) / 2 ) ;
}