Submission #33795


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <complex>

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cfloat>
#include <ctime>

using namespace std;

#define DBG(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__);
#define DUMP(val) cerr << #val << " : " << (val) << endl

#define REP(a,b) for(a = 0; a < b; a++)
#define FOR(a,b,c) for(a = b; a < c; a++)
#define FOREACH(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)

#define PUSH(e) push_back(e)
#define POP(e) pop_back(e)
#define MP(a,b) make_pair(a,b)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(a) sort((a).begin(),(b).end())
#define FILL(a,b) fill((a).begin(),(a).end(),b)

typedef pair<int,int> point;
#define F first
#define S second



int main() {
   
    unsigned char number[6];
    unsigned char bonus;
    unsigned char mynumber[6];

    int i = 0;
    int j = 0;
    int ret = 0;

    REP(i, 6) {
        scanf("%c ", &number[i]);
        number[i] -= '0';
    }
    scanf("%c ", &bonus);
    bonus -= '0';
    REP(i, 6) {
        scanf("%c ", &mynumber[i]);
        mynumber[i] -= '0';

    }
/*
    REP(i, 6) {
        printf("%c", number[i]+'0');
    }
    printf("\n%c\n", bonus+'0');
    REP(i, 6) {
        printf("%c", mynumber[i]+'0');
    }*/

    int count = 0;
    REP(i, 6) {
        REP(j,6) {
            if(mynumber[i] == number[j]) {
                count++;
            }
        }
    }
    switch(count) {
        case 3:
            ret = 5;
            break;
        case 4:
            ret = 4;
            break;
        case 5:
            REP(i, 6) {
                if(mynumber[i] == bonus) {
                    ret = 2;
                }
            }
            if(!ret) ret = 3;
            break;
        case 6:
            ret = 1;
            break;
        default:
            ret = 0;
    };

    printf("%d\n", ret);

    return 0;
}

Submission Info

Submission Time
Task A - 宝くじ
User stoikheia
Language C++ (GCC 4.4.7)
Score 100
Code Size 2190 Byte
Status AC
Exec Time 25 ms
Memory 824 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:54: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./Main.cpp:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./Main.cpp:60: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result

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 22 ms 812 KB
00_1_02.txt AC 21 ms 788 KB
00_2_01.txt AC 21 ms 788 KB
00_2_02.txt AC 20 ms 796 KB
00_3_01.txt AC 20 ms 792 KB
00_3_02.txt AC 25 ms 776 KB
00_sample_01.txt AC 22 ms 784 KB
00_sample_02.txt AC 22 ms 792 KB
00_sample_03.txt AC 20 ms 784 KB
00_sample_04.txt AC 19 ms 784 KB
00_sample_05.txt AC 20 ms 792 KB
01_rand_00.txt AC 19 ms 784 KB
01_rand_01.txt AC 20 ms 792 KB
01_rand_02.txt AC 22 ms 824 KB
01_rand_03.txt AC 21 ms 796 KB
01_rand_04.txt AC 20 ms 792 KB
01_rand_05.txt AC 21 ms 796 KB
01_rand_06.txt AC 21 ms 792 KB
01_rand_07.txt AC 21 ms 792 KB
01_rand_08.txt AC 21 ms 788 KB
01_rand_09.txt AC 22 ms 764 KB
01_rand_10.txt AC 21 ms 792 KB
01_rand_11.txt AC 21 ms 780 KB
01_rand_12.txt AC 23 ms 792 KB
01_rand_13.txt AC 22 ms 756 KB
01_rand_14.txt AC 22 ms 792 KB
01_rand_15.txt AC 22 ms 792 KB
01_rand_16.txt AC 24 ms 816 KB
01_rand_17.txt AC 22 ms 792 KB
01_rand_18.txt AC 22 ms 768 KB
01_rand_19.txt AC 25 ms 784 KB
01_rand_20.txt AC 22 ms 788 KB
01_rand_21.txt AC 21 ms 788 KB
01_rand_22.txt AC 21 ms 792 KB
01_rand_23.txt AC 21 ms 788 KB
01_rand_24.txt AC 21 ms 788 KB
01_rand_25.txt AC 20 ms 816 KB
01_rand_26.txt AC 22 ms 796 KB
01_rand_27.txt AC 22 ms 780 KB
01_rand_28.txt AC 22 ms 752 KB
01_rand_29.txt AC 20 ms 788 KB
01_rand_30.txt AC 21 ms 788 KB
01_rand_31.txt AC 24 ms 792 KB
01_rand_32.txt AC 22 ms 784 KB
01_rand_33.txt AC 21 ms 788 KB
01_rand_34.txt AC 21 ms 796 KB
01_rand_35.txt AC 22 ms 784 KB
01_rand_36.txt AC 20 ms 792 KB
01_rand_37.txt AC 21 ms 792 KB
01_rand_38.txt AC 21 ms 792 KB
01_rand_39.txt AC 20 ms 812 KB