C++ ¶
¶
한..ㅠ.ㅜ
하 ~
탁해 .^^
해 .^^
하 ~
탁해 .^^
해 .^^
// ... 한?ㅎ
.ㅎㅎㅎ
, .. ~!!
13 태 50 태 7 하??ㅎㅎㅎ
..ㅎㅎㅎ
..ㅎㅎㅎ
~ ..ㅎㅎ( !ㅎㅎ)
, .. ~!!
13 태 50 태 7 하??ㅎㅎㅎ
..ㅎㅎㅎ
..ㅎㅎㅎ
~ ..ㅎㅎ( !ㅎㅎ)
¶
~cpp
#include <iostream>
#include <conio.h>
using namespace std;
const int BACK_SPACE=8;
const int CHAR_TO_NUMBER=48;
void main()
{
cout << "호 '-' 해>>";
int cursur=0;
int input_number[13];
while (cursur<13)
{
char number;
number=getche();
if (47<number && number<58)
{
number-=CHAR_TO_NUMBER;
if (12==cursur)
{
int sum=0;
for (register int i=0; i<12; ++i)
sum+=input_number[i];
if ((11-sum%11)%10==number)
cout << "\n한 ~ ^^ 하!\n";
else
cout << "\n ???? -_-;;\n";
}
else input_number[cursur]=number*(cursur%8+2);
++cursur;
}else if (BACK_SPACE==number)
{
cout << " \b";
--cursur;
}
}
}
했.^^ ¶
~cpp
#include <iostream>
#include <conio.h>
using namespace std;
const int BACK_SPACE=8;
const int CHAR_TO_NUMBER=48;
void main()
{
cout << "호 '-' 해>>";
int cursur=0;
int put_num[13];
while (cursur<13)
{
char number;
number=getche();
if (47<number && number<58)
{
number-=CHAR_TO_NUMBER;
if (12==cursur)
{
int sum=0;
for (register int i=0; i<12; ++i)
sum+=put_num[i]*(i%8+2);;
if ((11-sum%11)%10==number && put_num[2]*10+put_num[3]<13 && put_num[4]*10+put_num[5]<32 && put_num[6]<3)
cout << "\n한 ~ ^^ 하!\n";
else
cout << "\n ???? -_-;;\n";
}
else put_num[cursur]=number;
++cursur;
}else if (BACK_SPACE==number)
{
cout << " \b";
--cursur;
}
}
}
¶
~cpp
#include <iostream>
#include <conio.h>
using namespace std;
const int BACK_SPACE=8;
const int CHAR_TO_NUMBER=48;
void main()
{
cout << "호 '-' 해>>"; // 한.
int cursur=0; // 한.
int input_number[13];
while (cursur<13) //13 키 .
{
char number;
number=getche();
if (47<number && number<58) // 확한.
{
number-=CHAR_TO_NUMBER;
if (12==cursur)// 확한.
{
int sum=0;
for (register int i=0; i<12; ++i)
sum+=input_number[i]; // 한.
if ((11-sum%11)%10==number) // 호 확한.
cout << "\n한 ~ ^^ 하!\n";
else
cout << "\n ???? -_-;;\n";
}
else input_number[cursur]=number*(cursur%8+2); // 한 한.
++cursur; // 한 .
}else if (BACK_SPACE==number) // 페 확한.
{
cout << " \b"; // 한.
--cursur; // 한 .
}
}
}
Erlang ¶
¶
2007 . ROR 한 Erlang 한 하 . ( 히 하) --
해 -_ -ㅎ
해 -_ -ㅎ
Erlang 해 -_ -ㅎ
¶
* pr_6.erl
-module(pr_6). -export([checkNum/1]). mulAndSum([], []) -> 0; mulAndSum([FirstOne|RemainOne], [FirstAnother|RemainAnother]) -> FirstOne * FirstAnother + mulAndSum(RemainOne, RemainAnother). sumList([], []) -> []; sumList([FirstOne|RemainOne], [FirstAnother|RemainAnother]) -> [FirstOne + FirstAnother] ++ sumList(RemainOne, RemainAnother). checkNumSub(List) -> 11 - (mulAndSum(List, [2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 4, 5, 0]) rem 11) == lists:last(List). checkNum(List) -> checkNumSub(sumList(List, lists:duplicate(13, -48))).
* shell
62> c(pr_6).
{ok,pr_6}
65> c(pr_6).
{ok,pr_6}
66> pr_6:checkNum("2222222222222").
false
67> pr_6:checkNum("2222222222223").
false
68> pr_6:checkNum("2222222222224").
false
69> pr_6:checkNum("2222222222225").
true
