Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- //freopen("input1.txt","r",stdin);
- //freopen("output1.txt","w",stdout);
- long long int cnt,n,a,t,cas,i,j,k,ans,arr[10000];
- scanf("%lld",&t);
- for(cas=1; cas<=t; cas++)
- {
- scanf("%lld",&n);
- for(i=0; i<n; i++)
- scanf("%lld",&arr[i]);
- sort(arr,arr+n);
- cnt=0;
- for(i=0; i<n-2; i++)
- {
- k=i+2;
- for(j=i+1; j<n; j++)
- {
- ans=arr[i]+arr[j];
- while(k<n && ans>arr[k])
- {
- k++;
- }
- cnt=cnt+k-j-1;
- }
- }
- printf("Case %lld: %lld\n",cas,cnt);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement