Pagini recente » Cod sursa (job #1876487) | Rating Balaurul Arhirel (arhirel) | Cod sursa (job #3299716) | Rating Edy Stefanita (edy225) | Cod sursa (job #39237)
Cod sursa(job #39237)
#include<fstream.h>
int main()
{
int v[30000];
long n, m, k, i, j, p, u, s;
ifstream in("distincte.in");
ofstream out("distincte.out");
in>>n>>k>>m;
for (i=1; i<=n; i++)
in>>v[i];
for (i=1; i<=m; i++)
{
in>>p>>u;
s=0;
for (j=p; j<=u; j++)
{for (k=j+1; k<=u; k++)
if (v[k]==v[j]) v[k]=0;
s+=v[j];
}
out<<s<<'\n';
}
out.close();
in.close();
return 0;
}