oj.uz

Submission #16808

# Submission time Handle Problem Language Result Execution time Memory
16808 2015-09-30T05:36:43 Z Namnamseo 카드 (tutorial6) C++
100 / 100
 324 ms 43276 KB 
#include"jeehak.h"

void jeehak(int A[])
{
	int as=0;
	int i;
	for(i=1;i<=5;++i) as+=A[i];
	as%=10;
	send(as%5+1,as/5);
}

#include"friends.h"
#include<cstdio>

void friends(int A[],int N,int X[],int Y[])
{
	int as=1;
	int i;
	for(i=1;i<=5;++i) as+=A[i];
	int ras = X[1]-1 + Y[1]*5;
	guess((ras-as+1000)%10);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 43276 KB Output is correct - 최대 카드수 : 1

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 43276 KB Output is correct - 최대 카드수 : 1