# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19266 | ansol1111 | 동전 게임 (KOI15_coin) | C++98 | 38 ms | 6980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int k, n, check[1005][1005], p[100005][5];
int input()
{
int i;
scanf("%d",&k);
scanf("%d",&n);
for(i=1 ; i<=n ; i++)
{
scanf("%d %d",&p[i][1],&p[i][2]);
}
return 0;
}
int process()
{
int i, j, num=0, num1=0, num2=0;
for(i=0 ; i<=k ; i++)
{
check[i][i]=1;
if((i-1)>=0)
{
check[i-1][i]=1, check[i][i-1]=1;
}
if((i+1)<=k)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |