Submission #1190154
Source Code Expand
#include<stdio.h> #include<string.h> int main(void){ int n,i,l; char s[128],c[4]="abc"; scanf("%d",&n); scanf("%s",s); l = strlen(s); if(l%2 == 0){printf("-1\n");return 0;} if(l%6 == 1){ for(i = 0;i < l;i++){if(s[i] != c[(i+1)%3]){printf("-1\n");return 0;}} } if(l%6 == 3){ for(i = 0;i < l;i++){if(s[i] != c[i%3]){printf("-1\n");return 0;}} } if(l%6 == 5){ for(i = 0;i < l;i++){if(s[i] != c[(i+2)%3]){printf("-1\n");return 0;}} } printf("%d\n",(l-1)/2); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 手芸王 |
User | physics0523 |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 507 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:7:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.c:8: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 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.txt |
All | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 1 ms | 128 KB |
subtask0-sample02.txt | AC | 1 ms | 128 KB |
subtask0-sample03.txt | AC | 1 ms | 128 KB |
subtask0-sample04.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 | 128 KB |
subtask1-08.txt | AC | 1 ms | 128 KB |
subtask1-09.txt | AC | 1 ms | 128 KB |
subtask1-10.txt | AC | 1 ms | 128 KB |
subtask1-11.txt | AC | 1 ms | 128 KB |
subtask1-12.txt | AC | 1 ms | 128 KB |
subtask1-13.txt | AC | 1 ms | 128 KB |
subtask1-14.txt | AC | 1 ms | 128 KB |
subtask1-15.txt | AC | 1 ms | 128 KB |
subtask1-16.txt | AC | 1 ms | 128 KB |
subtask1-17.txt | AC | 1 ms | 128 KB |
subtask1-18.txt | AC | 1 ms | 128 KB |
subtask1-19.txt | AC | 1 ms | 128 KB |
subtask1-20.txt | AC | 1 ms | 128 KB |
subtask1-21.txt | AC | 1 ms | 128 KB |
subtask1-22.txt | AC | 1 ms | 128 KB |
subtask1-23.txt | AC | 1 ms | 128 KB |
subtask1-24.txt | AC | 1 ms | 128 KB |
subtask1-25.txt | AC | 1 ms | 128 KB |