Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- long long int tc , nofDiv , test= 1 , sum = 1 ,s ;
- int flag = 1 ;
- cin>> tc ;
- for ( int i = 1 ; i<= tc ; i ++)
- {
- cin>>nofDiv ;
- test = 1 ;
- long long int ar[nofDiv] ;
- for(int k = 0 ; k<nofDiv ; k ++ )
- {
- cin>>test ;
- if(nofDiv==1 )
- {
- cout<<"Case "<<i+1<<": "<<test*test<<endl;
- flag =0;
- // break ;
- }
- else {
- flag = 1 ;
- ar[k] = test ;
- // cout<<sum<<endl;
- }
- }
- long long int n = sizeof(ar)/sizeof(ar[0]);
- sort(ar, ar+n);
- if( flag== 1)
- {
- cout<<"Case "<<i<<": "<<ar[0]*ar[nofDiv-1]<<endl;
- }
- sum = 1 ;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement