/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 4ms 532.0 KiB
#2 Wrong Answer 94ms 548.0 KiB

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(){
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

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:22:27
Judged At
2025-02-26 07:22:27
Judged By
Score
0
Total Time
94ms
Peak Memory
548.0 KiB