Submission #34053


Source Code Expand

Copy
#include <iostream>
using namespace std;

int e[10], l[10], b;

int hit() {
    int ret = 0;
    for(int i=0; i<10; ++i)
        if(e[i] > 0 && l[i] > 0)
            ret++;
    return ret;
}

int main() {
    int p;
    for(int i=0; i<6; ++i) {
        cin>>p;
        e[p]++;
    }

    cin>>b;

    for(int i=0; i<6; ++i) {
        cin>>p;
        l[p]++;
    }

    int h = hit();
    if(h == 6) {
        cout<<'1'<<endl;
        return 0;
    }

    e[b]++;
    if(hit() == 6) {
        cout<<2<<endl;
        return 0;
    }
    e[b]--;

    h = hit();
    switch(h) {
    case 6:
        cout<<'2'<<endl;
        break;
    case 5:
        cout<<3<<endl;
        break;
    case 4:
        cout<<4<<endl;
        break;
    case 3:
        cout<<5<<endl;
        break;
    default:
        cout<<0<<endl;
        break;
    }
    return 0;
}

Submission Info

Submission Time
Task A - 宝くじ
User chir
Language C++ (G++ 4.6.4)
Score 100
Code Size 910 Byte
Status AC
Exec Time 24 ms
Memory 820 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 51
Set Name Test Cases
All 00_1_01.txt, 00_1_02.txt, 00_2_01.txt, 00_2_02.txt, 00_3_01.txt, 00_3_02.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.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, 01_rand_30.txt, 01_rand_31.txt, 01_rand_32.txt, 01_rand_33.txt, 01_rand_34.txt, 01_rand_35.txt, 01_rand_36.txt, 01_rand_37.txt, 01_rand_38.txt, 01_rand_39.txt
Case Name Status Exec Time Memory
00_1_01.txt AC 21 ms 812 KB
00_1_02.txt AC 21 ms 788 KB
00_2_01.txt AC 22 ms 768 KB
00_2_02.txt AC 21 ms 792 KB
00_3_01.txt AC 21 ms 792 KB
00_3_02.txt AC 22 ms 796 KB
00_sample_01.txt AC 21 ms 768 KB
00_sample_02.txt AC 21 ms 816 KB
00_sample_03.txt AC 22 ms 732 KB
00_sample_04.txt AC 24 ms 788 KB
00_sample_05.txt AC 20 ms 792 KB
01_rand_00.txt AC 21 ms 784 KB
01_rand_01.txt AC 21 ms 788 KB
01_rand_02.txt AC 22 ms 788 KB
01_rand_03.txt AC 21 ms 776 KB
01_rand_04.txt AC 22 ms 760 KB
01_rand_05.txt AC 22 ms 784 KB
01_rand_06.txt AC 22 ms 796 KB
01_rand_07.txt AC 21 ms 820 KB
01_rand_08.txt AC 22 ms 772 KB
01_rand_09.txt AC 21 ms 788 KB
01_rand_10.txt AC 21 ms 788 KB
01_rand_11.txt AC 21 ms 796 KB
01_rand_12.txt AC 22 ms 768 KB
01_rand_13.txt AC 22 ms 772 KB
01_rand_14.txt AC 21 ms 792 KB
01_rand_15.txt AC 21 ms 784 KB
01_rand_16.txt AC 21 ms 808 KB
01_rand_17.txt AC 21 ms 788 KB
01_rand_18.txt AC 21 ms 796 KB
01_rand_19.txt AC 21 ms 788 KB
01_rand_20.txt AC 21 ms 760 KB
01_rand_21.txt AC 22 ms 792 KB
01_rand_22.txt AC 22 ms 764 KB
01_rand_23.txt AC 20 ms 792 KB
01_rand_24.txt AC 21 ms 788 KB
01_rand_25.txt AC 20 ms 792 KB
01_rand_26.txt AC 22 ms 780 KB
01_rand_27.txt AC 21 ms 732 KB
01_rand_28.txt AC 22 ms 764 KB
01_rand_29.txt AC 20 ms 788 KB
01_rand_30.txt AC 22 ms 788 KB
01_rand_31.txt AC 21 ms 760 KB
01_rand_32.txt AC 19 ms 788 KB
01_rand_33.txt AC 22 ms 816 KB
01_rand_34.txt AC 22 ms 808 KB
01_rand_35.txt AC 22 ms 756 KB
01_rand_36.txt AC 22 ms 788 KB
01_rand_37.txt AC 20 ms 788 KB
01_rand_38.txt AC 21 ms 788 KB
01_rand_39.txt AC 21 ms 788 KB