Submission #3690923


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
long long a1,a2,a3,b1,b2,b3,c1,c2,c3,c4,c5,c6,maxx;
int main() {
    scanf("%lld%lld%lld%lld%lld%lld",&a1,&a2,&a3,&b1,&b2,&b3);
    c1=(a1/b1)*(a2/b2)*(a3/b3);
    c2=(a1/b1)*(a3/b2)*(a2/b3);
    c3=(a2/b1)*(a1/b2)*(a3/b3);
    c4=(a2/b1)*(a3/b2)*(a1/b3);
    c5=(a3/b1)*(a1/b2)*(a2/b3);
    c6=(a3/b1)*(a2/b2)*(a1/b3);
    if(c1>c2)
    	maxx=c1;
    else
    	maxx=c2;
    if(c3>maxx)
    	maxx=c3;
    if(c4>maxx)
    	maxx=c4;
    if(c5>maxx)
    	maxx=c5;
    if(c6>maxx)
    	maxx=c6;
    cout<<maxx<<endl;
    return 0;
}

Submission Info

Submission Time
Task A - 梱包できるかな?
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 100
Code Size 598 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:5:62: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld%lld%lld%lld",&a1,&a2,&a3,&b1,&b2,&b3);
                                                              ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rand_00.txt, 01_rand_01.txt, 01_rand_02.txt, 01_rand_03.txt, 01_rand_04.txt, 01_rand_05.txt, 01_rand_06.txt, 01_rand_07.txt, 01_rand_08.txt, 01_rand_09.txt, 01_rand_10.txt, 01_rand_11.txt, 01_rand_12.txt, 01_rand_13.txt, 01_rand_14.txt, 01_rand_15.txt, 01_rand_16.txt, 01_rand_17.txt, 01_rand_18.txt, 01_rand_19.txt, 01_rand_20.txt, 01_rand_21.txt, 01_rand_22.txt, 01_rand_23.txt, 01_rand_24.txt, 01_rand_25.txt, 01_rand_26.txt, 01_rand_27.txt, 01_rand_28.txt, 01_rand_29.txt, 99_min.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
01_rand_00.txt AC 1 ms 256 KB
01_rand_01.txt AC 1 ms 256 KB
01_rand_02.txt AC 1 ms 256 KB
01_rand_03.txt AC 1 ms 256 KB
01_rand_04.txt AC 1 ms 256 KB
01_rand_05.txt AC 1 ms 256 KB
01_rand_06.txt AC 1 ms 256 KB
01_rand_07.txt AC 1 ms 256 KB
01_rand_08.txt AC 1 ms 256 KB
01_rand_09.txt AC 1 ms 256 KB
01_rand_10.txt AC 1 ms 256 KB
01_rand_11.txt AC 1 ms 256 KB
01_rand_12.txt AC 1 ms 256 KB
01_rand_13.txt AC 1 ms 256 KB
01_rand_14.txt AC 1 ms 256 KB
01_rand_15.txt AC 1 ms 256 KB
01_rand_16.txt AC 1 ms 256 KB
01_rand_17.txt AC 1 ms 256 KB
01_rand_18.txt AC 1 ms 256 KB
01_rand_19.txt AC 1 ms 256 KB
01_rand_20.txt AC 1 ms 256 KB
01_rand_21.txt AC 1 ms 256 KB
01_rand_22.txt AC 1 ms 256 KB
01_rand_23.txt AC 1 ms 256 KB
01_rand_24.txt AC 1 ms 256 KB
01_rand_25.txt AC 1 ms 256 KB
01_rand_26.txt AC 1 ms 256 KB
01_rand_27.txt AC 1 ms 256 KB
01_rand_28.txt AC 1 ms 256 KB
01_rand_29.txt AC 1 ms 256 KB
99_min.txt AC 1 ms 256 KB