Wrong Answer
Code
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n,sum=0,i,bin=11;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n-1;j++){
sum = arr[i]+arr[j];
}
}
sum = bin;
int product = bin%10;
cout<<product<<endl;
}
int main(){
solve();
}
Information
- Submit By
- Type
- Submission
- Problem
- P1175 Maximum binary product of sum pairs
- Contest
- Intra LU IEEE Beginner Programming Contest
- Language
- C++11 (G++ 13.2.0)
- Submit At
- 2025-02-26 07:16:51
- Judged At
- 2025-02-26 07:16:51
- Judged By
- Score
- 0
- Total Time
- 5ms
- Peak Memory
- 576.0 KiB