Submission #2384604
Source Code Expand
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#include <limits.h>
#define inf (INT_MAX-1)
#define INF 9223372036854775807
#define EPS 1e-10
#define sq(n) ((n)*(n))
#define rep(i,n) for(i=0;i<n;i++)
#define rev(i,n) for(i=n-1;i>=0;i--)
#define sort(a,n) qsort(a,n,sizeof(TYPE),cmp)
#define sort_r(a,n) qsort(a,n,sizeof(TYPE),cmp_r);
#define chsort(s,n) qsort(s,n,sizeof(char),cmp)
#define chsort_r(s,n) qsort(s,n,sizeof(char),char_cmp_r);
#define TYPE int
#define MEMSET(a) memset(a,0,sizeof(a))
const int mod=(int)1e09+7;
int in(void){
int i;scanf("%d",&i);
return i;
}
long long llin(void){
long long i;scanf("%lld",&i);
return i;
}
double din(void){
double i;scanf("%lf",&i);
return i;
}
void chin(char s[]){
scanf("%s",s);
}
void print(int a){
printf("%d\n",a);
}
void llprint(long long a){
printf("%lld\n",a);
}
void dprint(double a){
printf("%.10f\n",a);
}
void print2(int a,int b){
printf("%d %d\n",a,b);
}
long long max(long long a,long long b){
return a>b?a:b;
}
long long min(long long a,long long b){
return a<b?a:b;
}
long long llabs(long long a){
return a>0?a:-a;
}
double dmax(double a,double b){
return a>b?a:b;
}
int cmp(const void *a,const void *b){
return *(TYPE *)a-*(TYPE *)b;
}
int cmp_r(const void *a,const void *b){
return *(TYPE *)b-*(TYPE *)a;
}
int char_cmp(const void *a,const void *b){
return strcmp((char *)a,(char *)b);
}
int char_cmp_r(const void *a,const void *b){
return strcmp((char *)b,(char *)a);
}
void swap(int *a,int *b){
int t=*a;
*a=*b;
*b=t;
}
long long gcd(long long x,long long y){
return x%y?gcd(y,x%y):y;
}
long long lcm(long long x,long long y){
return x/gcd(x,y)*y;
}
// konoshita kara kaku
int main(void){
int n=in(),i=0,m;
long long ans=1;
char s[2][60];
chin(s[0]);
chin(s[1]);
if(s[0][0]==s[1][0]){
ans=3;
m=0;
i=1;
}
else{
ans=6;
m=1;
i=2;
}
for(;i<n;i++){
if(m==0){
ans=ans*2%mod;
if(s[0][i]!=s[1][i]){
m=1;
i++;
}
}
else if(s[0][i]!=s[1][i]){
ans=ans*3%mod;
i++;
}
else m=0;
}
llprint(ans);
return 0;
}
Submission Info
Submission Time
2018-04-21 09:18:04+0900
Task
D - Coloring Dominoes
User
f_t_ikt
Language
C (GCC 5.4.1)
Score
400
Code Size
2236 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘in’:
./Main.c:23:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
int i;scanf("%d",&i);
^
./Main.c: In function ‘llin’:
./Main.c:27:14: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
long long i;scanf("%lld",&i);
^
./Main.c: In function ‘din’:
./Main.c:31:11: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
double i;scanf("%lf",&i);
^
./Main.c: In function ‘chin’:
./Main.c:35:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
1.txt
AC
1 ms
128 KB
10.txt
AC
1 ms
128 KB
11.txt
AC
1 ms
128 KB
12.txt
AC
1 ms
128 KB
13.txt
AC
1 ms
128 KB
14.txt
AC
1 ms
128 KB
15.txt
AC
1 ms
128 KB
16.txt
AC
1 ms
128 KB
17.txt
AC
1 ms
128 KB
18.txt
AC
1 ms
128 KB
19.txt
AC
1 ms
128 KB
2.txt
AC
1 ms
128 KB
20.txt
AC
1 ms
128 KB
21.txt
AC
1 ms
128 KB
22.txt
AC
1 ms
128 KB
3.txt
AC
1 ms
128 KB
4.txt
AC
1 ms
128 KB
5.txt
AC
1 ms
128 KB
6.txt
AC
1 ms
128 KB
7.txt
AC
1 ms
128 KB
8.txt
AC
1 ms
128 KB
9.txt
AC
1 ms
128 KB
sample1.txt
AC
1 ms
128 KB
sample2.txt
AC
1 ms
128 KB
sample3.txt
AC
1 ms
128 KB