Pagini recente » Cod sursa (job #2855395) | tema | Cod sursa (job #2415810) | Cod sursa (job #920952) | Cod sursa (job #1403146)
#include<cstdio>
#include<list>
#define MOD 23209
using namespace std;
list<int>L[25000];
list<int>::iterator it;
int n,m,i,j,a,b,nr,ok,v[2000];
FILE *f,*g;
int main(){
f=fopen("oite.in","r");
g=fopen("oite.out","w");
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
}
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){
a=m-v[i]-v[j];
if(a>=0){
b=a%MOD;
for(it=L[b].begin();it!=L[b].end();it++){
if(*it==a){
nr++;
}
}
}
}
for(j=1;j<=i-1;j++){
a=v[i]+v[j];
L[a%MOD].push_back(a);
}
}
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}