글 읽기 - hey hongjun! I will beat you!

acrush 6년 전 11

@appa

Hey hongjun! I will beat you!!

If you can, hack this code ^^

#include<stdio.h>

#define hongjun main
#define hongjun2 for
#define hongjun3 while
#define hongjun4 if
#define hongjun5 int
#define hongjun6 char
#define hongjun7 scanf
#define hongjun8 printf
#define hongjun11 "%d"
#define hongjun12 "%s"
#define hongjun17 return
#define hongjun18 false
#define hongjun19  ;
#define hongjun20 {
#define hongjun21 }
#define hongjun22 (
#define hongjun23 )
#define hongjun24 =
#define hongjun25 <=
#define hongjun26 ==
#define hongjun27 !=
#define hongjun28 [
#define hongjun29 ]
#define hongjun30 ,
#define hongjun31 ++
#define hongjun32 +
#define hongjun33 -
#define hongjun34 %
#define hongjun35 1
#define hongjun37 0
#define hongjun38 &&
#define hongjun39 1001000
#define hongjun40 "#%d %d\n"

hongjun6 hongjun9 hongjun28 hongjun39 hongjun29 hongjun19
hongjun5 hongjun10 hongjun28 hongjun39 hongjun29 hongjun19

hongjun5 hongjun13 hongjun19
hongjun5 hongjun hongjun22 hongjun23 hongjun20
	hongjun5 hongjun14 hongjun19
		hongjun7 hongjun22 hongjun11 hongjun30  &hongjun14 hongjun23 hongjun19
		hongjun2 hongjun22 hongjun5 hongjun15 hongjun24 hongjun35 hongjun19 hongjun15 hongjun25 hongjun14 hongjun19 hongjun15 hongjun31  hongjun23 hongjun20
		hongjun7 hongjun22 hongjun12 hongjun30  hongjun9 hongjun23 hongjun19
		hongjun13 hongjun24 hongjun37 hongjun19
		hongjun3 hongjun22 hongjun9[hongjun13 hongjun29  hongjun27 hongjun37 hongjun23 hongjun13 hongjun31  hongjun19
		hongjun10 hongjun28 hongjun37 hongjun29  hongjun24  hongjun33 hongjun35 hongjun19
		hongjun2 hongjun22 hongjun5 hongjun36 hongjun24 hongjun35 hongjun19 hongjun36 hongjun25 hongjun13 hongjun19 hongjun36 hongjun31  hongjun23  hongjun20
		hongjun10 hongjun28 hongjun36 hongjun29  hongjun24 hongjun10 hongjun28 hongjun36  hongjun33  hongjun35 hongjun29   hongjun32  hongjun35 hongjun19
		hongjun3 hongjun22 hongjun10 hongjun28 hongjun36 hongjun29  hongjun27 hongjun37 hongjun38 hongjun9 hongjun28 hongjun36  hongjun33  hongjun35 hongjun29  hongjun27 hongjun9 hongjun28 hongjun10 hongjun28 hongjun36 hongjun29   hongjun33  hongjun35 hongjun29  hongjun23 hongjun10 hongjun28 hongjun36 hongjun29  hongjun24 hongjun10 hongjun28 hongjun10 hongjun28 hongjun36 hongjun29   hongjun33  hongjun35 hongjun29   hongjun32  hongjun35 hongjun19
		hongjun21
		hongjun5 hongjun16 hongjun24 hongjun35 hongjun19
		hongjun4 hongjun22 hongjun13 hongjun34  hongjun22 hongjun13  hongjun33  hongjun10 hongjun28 hongjun13 hongjun29  hongjun23  hongjun26 0 hongjun23 hongjun16 hongjun24 hongjun13 / hongjun22 hongjun13  hongjun33  hongjun10 hongjun28 hongjun13 hongjun29  hongjun23  hongjun19
		hongjun8 hongjun22 hongjun40 hongjun30  hongjun15 hongjun30  hongjun16 hongjun23  hongjun19
	hongjun21
	hongjun17 hongjun18 hongjun19
hongjun21

gunwookim 6년 전 0

와 소름... ㄷㄷ

ryute 5년 전 0

좀 무섭네요 ㄷㄷㄷ

#include <stdio.h>

char str[1001000];
int arr[1001000];

int len;
int main()
{
    int k;
    scanf("%d",&k);
    for (int i=1; i<=k; i++)
    {
        scanf("%s",str);
        len=0;
        while(str[len]!=0)
            len++;
        arr[0]=-1;
        for (int j=1; j<=len; j++)
        {
            arr[j]=arr[j-1]+1;
            while(arr[j]!=0 && str[j-1] != str[arr[j]-1])
                arr[j]=arr[arr[j]-1]+1;
        }
        int ret=1;
        if(len%(len-arr[len])==0)
            ret=len/(len-arr[len]);
        printf("#%d %d\n",i,ret);
    }
    return false;
}

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

hey hongjun! I will beat you!

acrush 6년 전 11

gunwookim 6년 전 0

ryute 5년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말