Can someone please point out the mistake? Or at least give hints.
Comments added
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define sortv(v) sort(v.begin(),v.end());
#define sorta(a,n) sort(a,a+n);
#define arrayin(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define arrayout(a,n) for(int i=0;i<n;i++) cout<<" ";cout<<"\n";
#define INF INT_MAX //Infinity
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define MOD 1000000007
#define fi first
#define se second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vi64 vector<lli>
#define viii vector<tuple<int,int,int>>
#define mii map<int,int>
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define nl "\n"
typedef long long int lli;
typedef unsigned long long int ulli;
typedef double ld;
using namespace std;
int main()
{
fio;
int n;
scanf("%d",&n);
vi v;
REP(i,n) //input stored in a vector v
{
int x;
cin>>x;
v.pb(x);
}
multiset<lli> s; //multiset stores all the values of a*b+c
int vsize=v.size();
REP(a,vsize)
{
REP(b,vsize)
{
REP(c,vsize)
{
s.insert(v[a]*v[b]+v[c]); //insertion in the multiset
}
}
}
vi64 v1; //storting the values of (f+e)*d
REP(e,vsize)
{
REP(f,vsize)
{
REP(d,vsize)
{
if(v[d]==0) //ifv[d]==0 continue
continue;
v1.pb(v[d]*(v[f]+v[e]));
}
}
}
int vsize1=v1.size();
int counter=0; //counts occurence in s
REP(i,vsize1)
{
counter+=s.count(v1[i]);
}
printf("%d\n",counter );
}