KT-Yeh

#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
void Hanoi(int,vector<int>&,vector<int>&,vector<int>&,vector<int> **);
void Move(vector<int>&,vector<int>&,vector<int> **);
int n,m;
int num;
int main()
{

KT-Yeh

#include <cstdio>
#include <algorithm>
using namespace std;
//English to number
int EtoN[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9};
int main()
{
    int Case,n,i,j,k;
    int tel[100005];   //用int來存電話
    char line[200];

KT-Yeh

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

llt mod(llt B,llt P,llt M);
int main()
{
    llt B,P,M;
    while(scanf("%lld %lld %lld",&B,&P,&M)!=EOF){
        printf("%lld\n",mod(B,P,M));

KT-Yeh

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

struct ana_type{
    char word[30];
    long long int value;
    int num;
};
bool cmp(ana_type a,ana_type b){

KT-Yeh

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

int main()
{
    int n;
    char a[76];

KT-Yeh

#include<algorithm>
#include<cstdio>
using namespace std;
struct Node{
    double tf;
    int order;
};
bool cmp(Node a,Node b){
    return a.tf>b.tf;
}

KT-Yeh

#include<cstdio>
using namespace std;
void mergesort(int l,int h,int a[]);
void combine(int l,int mid,int h,int a[]);

long long int ans=0;
int buffer[500001];

int main()
{

KT-Yeh

#include<cstdio>
using namespace std;

int main()
{
    int T,t,N,M,K,k,i;
    scanf("%d",&T);
    for(t=1;t<=T;t++)
    {
        int e[100000],w[100000];

KT-Yeh

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

struct city{
    int e;
    int w;
};

bool cmp(city a,city b);

KT-Yeh

#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;

struct dictionary_type
{
    char word[250];
}dic[100000];