KT-Yeh

#include <cstdio>
#include <cstring>
using namespace std;
char Mir[]="AAE3HHIIJLLJMMOOS2TTUUVVWWXXYYZ500112S3E5Z88";
bool isMirrored (char a, char b){
    for (int i=0; Mir[i+1]; i++)
        if (Mir[i]==a && Mir[i+1]==b) return 1;
    return 0;
}
bool isPalindrome (char a,char b){

KT-Yeh

#include <cstdio>
using namespace std;
int main()
{
  //  freopen ("input.txt","rt",stdin);
    char c;
    int num=0;
    while (c=getchar()){
        if (c == EOF) break;
        if (c == '\n' || c == '!')

KT-Yeh

#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
 //   freopen ("input.txt","rt",stdin);
    char sentence[101][101];
    int N=0,length[101];
    int Max_length=0;
    while (gets(sentence[N])) {

KT-Yeh

#include <cstdio>
using namespace std;
int main()
{
//    freopen ("input.txt","rt",stdin);
    int N;
    while (scanf("%d",&N)){
        if (!N) break;
        int nOfX[20]={0},Max = 0;
        char line[30];

KT-Yeh

#include <cstdio>
using namespace std;
int main()
{
  //  freopen("input.txt","rt",stdin);
    char keyboard[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./";
    char line[1000];
    while (gets(line)){
        for (int i=0; line[i]; i++){
            if (line[i] == ' ') printf(" ");

KT-Yeh

#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

int N,x[200001],y[200001];
double a_dis[200001],b_dis[200001];
int ax,ay,bx,by,Q,R1,R2;

int BS (int R,double dis[])

KT-Yeh

#include <cstdio>
#include <cmath>
using namespace std;
typedef long long int llt;

llt sum0 (llt n)
{
    llt N = n,sum = 0;
    int left=1,mid,right=1;
    while (N >= 10){

KT-Yeh

#include <cstdio>
#include <cstring>
using namespace std;
char APU[1000];

int parsing (int front, int back)
{
    // 0:Mutant
    // 1:Simple
    // 2:Fully-Grown

KT-Yeh

#include <cstdio>
using namespace std;

void bangla(long long int n)
{
    if (n >= 10000000){
        bangla (n / 10000000);
        printf (" kuti");
        n %= 10000000;
    }

KT-Yeh

#include <cstdio>
using namespace std;
int fn[101]={0};

int f91 (int N){
    if (N > 100) return N-10;
    if (fn[N] != 0) return fn[N];
    fn[N] = f91(f91(N+11));
    return fn[N];
}