Submission #1872246


Source Code Expand

#include <iostream>

using namespace std;

int main() {
	int a[3],b[3];
	for (int i = 0; i < 3; i++)
	{
		cin >> a[i];
	}
	int max = 0;
	int min = 101;
	for (int i = 0; i < 3; i++)
	{
		if(max < a[i]) max = a[i], b[i] = 1;
	}
	for (int i = 0; i < 3; i++)
	{
		if(a[i] != max){
			if (min > a[i]) min = a[i], b[i] = 3;
		}
	}
	for (int i = 0; i < 3; i++)
	{
		if(a[i] != max && a[i] != min) b[i] = 2;
	}
	for (int i = 0; i < 3; i++)
	{
		cout << b[i] << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task A - 豆まき
User canan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 505 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 17
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt
All subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 1 ms 256 KB
subtask0-sample02.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB