AtCoder Beginner Contest 019

Submission #3120707

Source codeソースコード

#include <cstdio>

int main(){
    char s[1001];
    scanf("%s",s);
    char c;
    int count;
    bool check[1001];
    for(int i = 0; i < 1001; i++){
        check[i] = true;
    }

    for(int i = 0; s[i] != '\0'; i++){
        if(check[i] == true){
            c = s[i];
            count = 1;
            check[i] = false;
            for(int j = i + 1; s[j] != '\0'; j++){
                if(s[j] == c){
                    count++;
                    check[j] = false;
                    }else{
                        break;
                    }
            }
            printf("%c%d",c,count);
        }
    }
    printf("\n");

    return 0;
}

Submission

Task問題 B - 高橋くんと文字列圧縮
User nameユーザ名 gifsyn
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 690 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 128 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - subtask0_1.txt,subtask0_2.txt,subtask0_3.txt
All 100 / 100 0.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,23.txt,24.txt,25.txt,26.txt,27.txt,28.txt,29.txt,3.txt,4.txt,5.txt,6.txt,7.txt,8.txt,9.txt,subtask0_1.txt,subtask0_2.txt,subtask0_3.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0.txt AC 1 ms 128 KB
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
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
23.txt AC 1 ms 128 KB
24.txt AC 1 ms 128 KB
25.txt AC 1 ms 128 KB
26.txt AC 1 ms 128 KB
27.txt AC 1 ms 128 KB
28.txt AC 1 ms 128 KB
29.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
subtask0_1.txt AC 1 ms 128 KB
subtask0_2.txt AC
subtask0_3.txt AC 1 ms 128 KB