Submission #1540655


Source Code Expand

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int x1,x2,x3,x4,x;
    double s1,s2,s3,s4,s,sum;
    scanf("%d%d%d%d%d",&x1,&x2,&x3,&x4,&x);
    s1=x1;
    s2=x2*1.0/2;
    s3=x3*1.0/4;
    s4=x4*1.0/8;
    s=min(s1,s2);
    s=min(s,s3);
    s=min(s,s4);
    if(s==s1)
    {
        sum=s1*4*x;
        printf("%.0lf\n",sum);
        return 0;
    }
    if(s==s2)
    {
        sum=s2*4*x;
        printf("%.0lf\n",sum);
        return 0;
    }
    if(s==s3)
    {
        sum=s3*4*x;
        printf("%.0lf\n",sum);
        return 0;
    }
    if(s==s4)
    {
        sum=x/2*s4*8;
        if(x%2)
        {
            s4=s4*8;
            s=min(s1,s2);
            s=min(s,s3);
            s4=min(s4,s*4);
            sum=sum+s4;
            printf("%.0lf\n",sum);
        }
        printf("%.0lf\n",sum);
    }
    return 0;
}

Submission Info

Submission Time
Task A - Ice Tea Store
User yangshuang
Language C++14 (GCC 5.4.1)
Score 0
Code Size 927 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d%d",&x1,&x2,&x3,&x4,&x);
                                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
WA × 2
AC × 12
WA × 11
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt
Case Name Status Exec Time Memory
sample_01.txt WA 0 ms 128 KB
sample_02.txt WA 0 ms 128 KB
sample_03.txt AC 0 ms 128 KB
sample_04.txt AC 0 ms 128 KB
subtask_1_01.txt WA 0 ms 128 KB
subtask_1_02.txt AC 0 ms 128 KB
subtask_1_03.txt WA 1 ms 128 KB
subtask_1_04.txt AC 0 ms 128 KB
subtask_1_05.txt AC 0 ms 128 KB
subtask_1_06.txt AC 0 ms 128 KB
subtask_1_07.txt AC 0 ms 128 KB
subtask_1_08.txt WA 0 ms 128 KB
subtask_1_09.txt WA 0 ms 128 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 1 ms 128 KB
subtask_1_12.txt AC 0 ms 128 KB
subtask_1_13.txt WA 0 ms 128 KB
subtask_1_14.txt WA 0 ms 128 KB
subtask_1_15.txt WA 0 ms 128 KB