Submission #1672454
Source Code Expand
#include<stdio.h>
#include<string.h>
int c[20]={1};
char sa[100010],sb[100010],d[20][10]={"0"};
int f(int a,int b){//printf("%2d %2d %c %s\n",a,b,sa[a],sb+b);
if(sa[a]+sb[b]==0)return 1;
if(sa[a]*sb[b]==0)return 0;
int i,j,n=sa[a]-'0';
if(c[n]){//printf("!!%d\n",n);
for(i=0;d[n][i];i++){
if(d[n][i]-sb[b+i])return 0;
}
c[n]++;
if(f(a+1,b+i))return 1;
c[n]--;
return 0;
}
for(i=1;i<4;i++){
for(j=0;j<i;j++)d[n][j]=sb[b+j];
d[n][j]=0;
c[n]++;
if(f(a+1,b+i))return 1;
c[n]--;
}
return 0;
}
int main(){
int n,m,i;
char a[10010],b[10010];
sa[0]=sb[0]=0;
scanf("%d %d",&n,&m);
for(i=0;i<m;i++){
scanf("%s %s",a,b);
strcat(sa,a);
strcat(sa,"0");
strcat(sb,b);
strcat(sb,"0");
}
//printf("%s\n%s\n",sa,sb);printf("%s\n",d[0]);
//printf("%d\n",f(0,0));;
f(0,0);
for(i=0;i<n;i++)printf("%s\n",d[i+1]);
return 0;
}
Submission Info
Submission Time
2017-10-09 19:24:54+0900
Task
D - 語呂合わせ
User
yuiop
Language
C (GCC 5.4.1)
Score
100
Code Size
963 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:31:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
./Main.c:33:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s %s",a,b);
^
Judge Result
Set Name
Sample
Subtask1
Subtask2
Score / Max Score
0 / 0
40 / 40
60 / 60
Status
Set Name
Test Cases
Sample
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1
sample-02.txt, sample-03.txt, sample-04.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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt
Subtask2
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt
Case Name
Status
Exec Time
Memory
sample-01.txt
AC
1 ms
128 KB
sample-02.txt
AC
1 ms
128 KB
sample-03.txt
AC
1 ms
128 KB
sample-04.txt
AC
1 ms
128 KB
subtask1-01.txt
AC
1 ms
128 KB
subtask1-02.txt
AC
1 ms
128 KB
subtask1-03.txt
AC
1 ms
128 KB
subtask1-04.txt
AC
1 ms
128 KB
subtask1-05.txt
AC
1 ms
128 KB
subtask1-06.txt
AC
1 ms
128 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
subtask1-16.txt
AC
1 ms
256 KB
subtask1-17.txt
AC
1 ms
256 KB
subtask1-18.txt
AC
1 ms
256 KB
subtask1-19.txt
AC
1 ms
256 KB
subtask1-20.txt
AC
1 ms
256 KB
subtask2-01.txt
AC
1 ms
128 KB
subtask2-02.txt
AC
1 ms
128 KB
subtask2-03.txt
AC
1 ms
128 KB
subtask2-04.txt
AC
1 ms
256 KB
subtask2-05.txt
AC
1 ms
128 KB
subtask2-06.txt
AC
1 ms
256 KB
subtask2-07.txt
AC
1 ms
256 KB
subtask2-08.txt
AC
1 ms
256 KB
subtask2-09.txt
AC
1 ms
256 KB
subtask2-10.txt
AC
1 ms
256 KB
subtask2-11.txt
AC
1 ms
256 KB
subtask2-12.txt
AC
1 ms
256 KB
subtask2-13.txt
AC
1 ms
256 KB
subtask2-14.txt
AC
1 ms
128 KB
subtask2-15.txt
AC
1 ms
256 KB
subtask2-16.txt
AC
1 ms
256 KB
subtask2-17.txt
AC
1 ms
256 KB
subtask2-18.txt
AC
1 ms
256 KB
subtask2-19.txt
AC
1 ms
256 KB
subtask2-20.txt
AC
1 ms
256 KB