Submission #33339


Source Code Expand

Copy
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
using namespace std;
const double PI = 3.14159265358979323846;

int main(){
	int a[6],b[6],c,ans=0,l=0;
	for(int i = 0; i < 6; i++)cin>>a[i];
	cin>>c;
	for(int i = 0; i < 6; i++)cin>>b[i];
	for(int i = 0; i < 6; i++){
		for(int j = 0; j < 6; j++){
			if(a[i]==b[j]){
				ans++;
			}
			else l = b[j]==c;
		}
	}
	if(ans==6)cout<<1;
	else if(ans==5&&l)cout<<2;
	else if(ans==5)cout<<3;
	else if(ans==4)cout<<4;
	else if(ans==3)cout<<5;
	else cout<<0;
	cout<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - 宝くじ
User Lepton
Language C++ (G++ 4.6.4)
Score 0
Code Size 841 Byte
Status WA
Exec Time 23 ms
Memory 896 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 49
WA × 2
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 20 ms 752 KB
00_1_02.txt AC 20 ms 784 KB
00_2_01.txt AC 21 ms 788 KB
00_2_02.txt WA 21 ms 772 KB
00_3_01.txt AC 22 ms 780 KB
00_3_02.txt AC 22 ms 788 KB
00_sample_01.txt AC 22 ms 784 KB
00_sample_02.txt AC 21 ms 788 KB
00_sample_03.txt AC 21 ms 892 KB
00_sample_04.txt AC 21 ms 764 KB
00_sample_05.txt AC 21 ms 796 KB
01_rand_00.txt AC 21 ms 796 KB
01_rand_01.txt AC 21 ms 760 KB
01_rand_02.txt AC 21 ms 788 KB
01_rand_03.txt AC 21 ms 764 KB
01_rand_04.txt AC 21 ms 764 KB
01_rand_05.txt AC 21 ms 792 KB
01_rand_06.txt AC 20 ms 788 KB
01_rand_07.txt AC 21 ms 788 KB
01_rand_08.txt AC 20 ms 788 KB
01_rand_09.txt AC 20 ms 784 KB
01_rand_10.txt AC 21 ms 792 KB
01_rand_11.txt AC 21 ms 760 KB
01_rand_12.txt AC 21 ms 784 KB
01_rand_13.txt AC 22 ms 768 KB
01_rand_14.txt AC 21 ms 792 KB
01_rand_15.txt AC 21 ms 788 KB
01_rand_16.txt AC 21 ms 792 KB
01_rand_17.txt AC 21 ms 784 KB
01_rand_18.txt AC 21 ms 768 KB
01_rand_19.txt AC 21 ms 812 KB
01_rand_20.txt AC 20 ms 792 KB
01_rand_21.txt AC 20 ms 784 KB
01_rand_22.txt AC 21 ms 792 KB
01_rand_23.txt AC 20 ms 788 KB
01_rand_24.txt AC 21 ms 788 KB
01_rand_25.txt AC 23 ms 780 KB
01_rand_26.txt AC 20 ms 788 KB
01_rand_27.txt AC 20 ms 788 KB
01_rand_28.txt AC 21 ms 784 KB
01_rand_29.txt AC 21 ms 796 KB
01_rand_30.txt AC 21 ms 732 KB
01_rand_31.txt AC 23 ms 788 KB
01_rand_32.txt AC 22 ms 736 KB
01_rand_33.txt AC 21 ms 792 KB
01_rand_34.txt WA 21 ms 736 KB
01_rand_35.txt AC 21 ms 788 KB
01_rand_36.txt AC 21 ms 792 KB
01_rand_37.txt AC 21 ms 808 KB
01_rand_38.txt AC 21 ms 788 KB
01_rand_39.txt AC 21 ms 896 KB