Submission #38007352


Source Code Expand

#include<stdio.h>
int main(void)
{
  int n=0;
  scanf("%d",&n);
  int s[9]={0,0,0,0,0,0,0,0,0};
  int count=0;
  for(int a=1;a<=9;a++)
  {
    s[0]=a;
    s[1]=a;
    for(int b=0;b<=9;b++)
    {
      s[2]=b;
      for(int c=0;c<=9;c++)
      {
        s[3]=c;
        for(int d=0;d<=9;d++)
        {
          s[4]=d;
          s[5]=d;
         for(int e=0;e<=9;e++)
         {
           s[6]=e;
           s[8]=e;
           for(int f=0;f<=9;f++)
           {
             s[7]=f;
             count++;
             if(count==n)
             {
               goto clear;
             }
           }
         }
        }
      }
    }
  }
  clear:
  for(int m=0;m<=8;m++)
  {
    printf("%d",s[m]);
  }
      
}

Submission Info

Submission Time
Task A - AABCDDEFE
User beelucario
Language C (GCC 9.2.1)
Score 300
Code Size 758 Byte
Status AC
Exec Time 6 ms
Memory 1720 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:5:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
    5 |   scanf("%d",&n);
      |   ^~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 33
Set Name Test Cases
Sample 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt
All 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt, 02_min_01.txt, 02_min_02.txt, 02_min_03.txt, 02_min_04.txt, 02_min_05.txt, 02_min_06.txt, 02_min_07.txt, 02_min_08.txt, 02_min_09.txt, 02_min_10.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 03_max_10.txt, 04_rand_01.txt, 04_rand_02.txt, 04_rand_03.txt, 04_rand_04.txt, 04_rand_05.txt, 04_rand_06.txt, 04_rand_07.txt, 04_rand_08.txt, 04_rand_09.txt, 04_rand_10.txt
Case Name Status Exec Time Memory
01_sample_01.txt AC 6 ms 1652 KiB
01_sample_02.txt AC 3 ms 1656 KiB
01_sample_03.txt AC 2 ms 1684 KiB
02_min_01.txt AC 1 ms 1716 KiB
02_min_02.txt AC 2 ms 1636 KiB
02_min_03.txt AC 1 ms 1720 KiB
02_min_04.txt AC 2 ms 1716 KiB
02_min_05.txt AC 1 ms 1620 KiB
02_min_06.txt AC 1 ms 1624 KiB
02_min_07.txt AC 1 ms 1620 KiB
02_min_08.txt AC 1 ms 1628 KiB
02_min_09.txt AC 2 ms 1708 KiB
02_min_10.txt AC 1 ms 1632 KiB
03_max_01.txt AC 3 ms 1676 KiB
03_max_02.txt AC 1 ms 1720 KiB
03_max_03.txt AC 3 ms 1704 KiB
03_max_04.txt AC 2 ms 1648 KiB
03_max_05.txt AC 2 ms 1668 KiB
03_max_06.txt AC 2 ms 1652 KiB
03_max_07.txt AC 2 ms 1652 KiB
03_max_08.txt AC 3 ms 1620 KiB
03_max_09.txt AC 2 ms 1676 KiB
03_max_10.txt AC 2 ms 1676 KiB
04_rand_01.txt AC 2 ms 1616 KiB
04_rand_02.txt AC 1 ms 1656 KiB
04_rand_03.txt AC 1 ms 1716 KiB
04_rand_04.txt AC 3 ms 1720 KiB
04_rand_05.txt AC 1 ms 1616 KiB
04_rand_06.txt AC 2 ms 1656 KiB
04_rand_07.txt AC 2 ms 1716 KiB
04_rand_08.txt AC 1 ms 1640 KiB
04_rand_09.txt AC 1 ms 1616 KiB
04_rand_10.txt AC 1 ms 1672 KiB