Pagini recente » Cod sursa (job #2172832) | Cod sursa (job #97639) | Cod sursa (job #2957796) | Cod sursa (job #2399059) | Cod sursa (job #1998279)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
int n,l,st,dr,mid,k,i,j,oite[1025],csum,alfa,beta,grupuri_de_oite;
vector<pair<int,int> >sume[1010];
int main(){
in >> n >> l;
for( i = 1; i <= n; i ++ ){
in >> oite[i];
}
sume[(oite[1] + oite[2] ) %1009].push_back( make_pair (1,2));
for( i = 3; i <= n-1; i ++ ){
for( j = i+1; j <= n; j ++ ){
csum = l -oite[i] - oite[j];
if( csum > 0 ){
for( k = 0; k < sume[csum%1009].size(); k ++ ){
if( oite[sume[csum%1009][k].first] + oite[sume[csum%1009][k].second] == csum ){
grupuri_de_oite++;
}
}
}
}
for( j = 1; j <= i-1; j ++ ){
sume[ (oite[i] + oite[j] ) %1009 ].push_back( make_pair(i,j) );
}
}
out<<grupuri_de_oite;
return 0;
}