Pagini recente » Cod sursa (job #2455306) | Cod sursa (job #1681082) | Cod sursa (job #1432255) | Istoria paginii runda/rar5 | Cod sursa (job #730736)
Cod sursa(job #730736)
#include<iostream>
#include<fstream>
#include<vector>
#include<string.h>
using namespace std;
struct oita {
int val;
short a,b;
};
vector <oita> v[50021];
int a[1025];
char c[10001];
inline int cauta(oita x)
{
int i,k,n,s;
k=x.val%50021;
n=v[k].size()-1;
s=0;
for(i=0;i<=n;i++) {
if((v[k][i].val==x.val)&&(v[k][i].a!=x.a)&&(v[k][i].a!=x.b)&&(v[k][i].b!=x.a)&&(v[k][i].b!=x.b))
s++;
}
return s;
}
inline void adauga(oita x)
{
v[x.val%50021].push_back(x);
}
void citire(int &n, int &s)
{
int i,m,b,l;
ifstream f("oite.in");
f>>n>>s;
f.get();
f.get(c,10000);
m=strlen(c)-1;
l=0;
for(i=0;i<=m;i++) {
b=0;
while((c[i]>='0')&&(c[i]<='9')) {
b=b*10+(c[i]-48);
i++;
}
l++;
a[l]=b;
}
f.close();
}
int main ()
{
int n,i,j,s;
long long nr;
oita x;
ofstream g("oite.out");
citire(n,s);
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if((a[i]+a[j])<=s) {
x.val=a[i]+a[j];
x.a=i;
x.b=j;
adauga(x);
}
nr=0;
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++) {
x.val=s-(a[i]+a[j]);
if(x.val>=0) {
x.a=i;
x.b=j;
nr=nr+cauta(x);
}
}
g<<nr/6;
g.close();
return 0;
}