Untitled

 avatar
unknown
plain_text
2 years ago
26 kB
11
Indexable
// Hash map
#include<iostream>
#include<string>
#include<unordered_map>
using namespace std;
 
unordered_map<string, string> hashmap; 
int N;
int Q;
 
int main(){
    freopen("input.txt","r",stdin);
    cin >> N;
    string key, value;
     
    for(int i = 0; i<N; i++){
        cin >> key >> value;
        hashmap[key] = value;
    }
    cin >> Q;
    for(int i = 0; i < Q; i++){
        cin >> key;
        cout << hashmap[key] << endl;
    }
    return 0;
}

// max heap
#include<iostream>
#include<algorithm>
#include<queue>
#include<stdlib.h>
using namespace std;
 
struct cmp{
	bool operator() (int a, int b) const {
		return a < b; // max heap (default)
	}
};
priority_queue<int, vector<int>, cmp> pq;

void init(){
    while(!pq.empty())
        pq.pop();
}
void add(int num){
    pq.push(num);
}
int getCurrentMax(){
    if(pq.empty()) return 0;
    int temp = pq.top();
    pq.pop();
    return temp;
}

// min heap
#include<iostream>
#include<algorithm>
#include<queue>
#include<stdlib.h>

using namespace std;

struct cmp{
	bool operator() (int a, int b) const {
		return a > b; // min heap
	}
};
priority_queue<int, vector<int>, cmp> pq;

void init(){
	while (!pq.empty())
		pq.pop();
}

void add(int num){
	pq.push(num);
}
int getCurrentMin(){
	if(pq.empty()) return 0;
	int res = pq.top();
	pq.pop();
	return res;
}
	
// set lower
#include<set>
using namespace std;

struct cmp{
	bool operator() (int a, int b) const {
		return a < b;
	}
};

set<int, cmp> mySet;

void init(){
	mySet.clear();
}

void add(int level){
	mySet.insert(level);
}

int getNextLevel(int currentLevel){
	auto it = mySet.lower_bound(currentLevel);
	if(it == mySet.begin())
		return -1;
    else {
		it--;
        return *it;
    }
}

// set upper
#include<set>
using namespace std;
struct cmp{
	bool operator() (int a, int b) const {
		return a < b;
	}
};
set<int, cmp> mySet;

void init(){
	mySet.clear();
}

void add(int level){
	mySet.insert(level);
}

int getNextLevel(int currentLevel){
	auto it = mySet.upper_bound(currentLevel);
	if(it == mySet.end()) 
		return -1;
    return (*it);
}


// linked list
#include<list>
#include<unordered_map>

using namespace std;

list<int> myList;

struct Node{
	int wid;
	Node* next;
	Node* prev;
} pool[50001];

struct Node* Head;
struct Node* Tail;
int pool_cnt;
unordered_map<int, int> mp;

void init(){
	Head = NULL;
	Tail = NULL;
	mp.clear();
	pool_cnt = 0;
}
void open(int wid){
	if (pool_cnt == 0){
        Head = &pool[0];
        Tail = &pool[0];
        pool[0].prev = NULL;
        pool[0].next = NULL;
        pool_cnt++;
        mp[wid] = 0;
        pool[0].wid = wid;
        return;
    }
    if (mp.size() == 0){
        Head = &pool[pool_cnt];
        Head->prev = NULL;
        Head->next = NULL;
    }
    else{
        Head->prev = &pool[pool_cnt];
        pool[pool_cnt].prev = NULL;
        pool[pool_cnt].next = Head;
        Head = &pool[pool_cnt];
    }
         
    pool[pool_cnt].wid = wid;
    mp[wid] = pool_cnt;
    pool_cnt++;
    return;
}
void close(int wid){
    int t = mp[wid];

    if (pool[t].prev != NULL)
		pool[t].prev->next = pool[t].next;
    else 
		Head = pool[t].next;

    if (pool[t].next != NULL)
		pool[t].next->prev = pool[t].prev;
    else 
		Tail = pool[t].prev;

    mp.erase(wid);
}
void click(int wid){
    int t = mp[wid];
	if (pool[t].prev != NULL)
		pool[t].prev->next = pool[t].next;
    else
        return;
    if (pool[t].next != NULL)
		pool[t].next->prev = pool[t].prev;
    else
		Tail = pool[t].prev;

    pool[t].prev = NULL;
    Head->prev = &pool[t];
	pool[t].next = Head;
    Head = &pool[t];
}
list<int>::iterator get(){
	myList.clear();
    struct Node* current = Head;
    while (current != NULL) {
        myList.push_back(current->wid);
        current = current->next;
    }
	return myList.begin();
}

void shutdown(){
    int n_cnt = 0;
    mp.clear();	
}

// Trie
struct trie
{
    trie *child[26];
    int isterminal;
    int count;
}trie_node[1000005];
 
int counter;
trie *root;
 
 
trie *createnode()
{
    trie *temp = &trie_node[counter++];
    for (int i = 0; i < 26; i++)
    {
        temp->child[i] = nullptr;
    }
    temp->count = 0;
    temp->isterminal = 0;
    return temp;
}
 
void init_trie()
{
    counter = 0;
    root = createnode();
 
}
 
void Tries_insert(const char *key)
{
    trie *temp = root;
    int i = 0;
    int index;
    while (key[i] != '\0')
    {
        index = key[i] - 'a';
        if (temp->child[index] == nullptr)
        {
            temp->child[index] = createnode();
        }
        temp = temp->child[index];
        temp->count++;
        i++;
 
    }
    temp->isterminal++;
 
}
 
bool Tries_search(const char *key)
{
    trie *temp = root;
    int i = 0;
    int index;
    while (key[i] != '\0')
    {
        index = key[i] - 'a';
        if (temp->child[index] == nullptr)
        {
            return false;
        }
        temp = temp->child[index];
        i++;
    }
    if (temp->isterminal > 0)
        return true;
    else
        return false;
}
 
int Tries_CountofkeysWithPrefix(const char *key)
{
    trie *temp = root;
    int i = 0;
    int index;
    while (key[i] != '\0')
    {
        index = key[i] - 'a';
        if (temp->child[index] == nullptr)
        {
            return 0;
        }
        temp = temp->child[index];
        i++;
    }
 
    return temp->count;
}
 
void Tries_deleteKey(const char *key)
{
    trie *temp = root;
    int i = 0;
    int index;
    if (Tries_search(key))
    {
        while (key[i] != '\0')
        {
            index = key[i] - 'a';
            temp = temp->child[index];
            temp->count--;
            i++;
        }
        temp->isterminal--;
    }
}


// contact DB

***
#include <stdio.h>
#include <string.h>

typedef enum
{
	CMD_INIT,
	CMD_ADD,
	CMD_DELETE,
	CMD_CHANGE,
	CMD_SEARCH
} COMMAND;

typedef enum
{
	NAME,
	NUMBER,
	BIRTHDAY,
	EMAIL,
	MEMO
} FIELD;

typedef struct
{
	int count;
	char str[20];
} RESULT;

////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////

extern void InitDB();
extern void Add(char* name, char* number, char* birthday, char* email, char* memo);
extern int Delete(FIELD field, char* str);
extern int Change(FIELD field, char* str, FIELD changefield, char* changestr);
extern RESULT Search(FIELD field, char* str, FIELD returnfield);

////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////

static int dummy[100];
static int Score, ScoreIdx;
static char name[20], number[20], birthday[20], email[20], memo[20];

static char lastname[10][5] = { "kim", "lee", "park", "choi", "jung", "kang", "cho", "oh", "jang", "lim" };
static int lastname_length[10] = { 3, 3, 4, 4, 4, 4, 3, 2, 4, 3 };

static int mSeed;
static int mrand(int num)
{
	mSeed = mSeed * 1103515245 + 37209;
	if (mSeed < 0) mSeed *= -1;
	return ((mSeed >> 8) % num);
}

static void make_field(int seed)
{
	int name_length, email_length, memo_length;
	int idx, num;

	mSeed = (unsigned int)seed;

	name_length = 6 + mrand(10);
	email_length = 10 + mrand(10);
	memo_length = 5 + mrand(10);

	num = mrand(10);
	for (idx = 0; idx < lastname_length[num]; idx++) name[idx] = lastname[num][idx];
	for (; idx < name_length; idx++) name[idx] = 'a' + mrand(26);
	name[idx] = 0;

	for (idx = 0; idx < memo_length; idx++) memo[idx] = 'a' + mrand(26);
	memo[idx] = 0;

	for (idx = 0; idx < email_length - 6; idx++) email[idx] = 'a' + mrand(26);
	email[idx++] = '@';
	email[idx++] = 'a' + mrand(26);
	email[idx++] = '.';
	email[idx++] = 'c';
	email[idx++] = 'o';
	email[idx++] = 'm';
	email[idx] = 0;

	idx = 0;
	number[idx++] = '0';
	number[idx++] = '1';
	number[idx++] = '0';
	for (; idx < 11; idx++) number[idx] = '0' + mrand(10);
	number[idx] = 0;

	idx = 0;
	birthday[idx++] = '1';
	birthday[idx++] = '9';
	num = mrand(100);
	birthday[idx++] = '0' + num / 10;
	birthday[idx++] = '0' + num % 10;
	num = 1 + mrand(12);
	birthday[idx++] = '0' + num / 10;
	birthday[idx++] = '0' + num % 10;
	num = 1 + mrand(30);
	birthday[idx++] = '0' + num / 10;
	birthday[idx++] = '0' + num % 10;
	birthday[idx] = 0;
}

static void cmd_init()
{
	scanf("%d", &ScoreIdx);

	InitDB();
}

static void cmd_add()
{
	int seed;
	scanf("%d", &seed);

	make_field(seed);

	Add(name, number, birthday, email, memo);
}

static void cmd_delete()
{
	int field, check, result;
	char str[20];
	scanf("%d %s %d", &field, str, &check);

	result = Delete((FIELD)field, str);
	if (result != check)
		Score -= ScoreIdx;
}

static void cmd_change()
{
	int field, changefield, check, result;
	char str[20], changestr[20];
	scanf("%d %s %d %s %d", &field, str, &changefield, changestr, &check);

	result = Change((FIELD)field, str, (FIELD)changefield, changestr);
	if (result != check)
		Score -= ScoreIdx;
}

static void cmd_search()
{
	int field, returnfield, check;
	char str[20], checkstr[20];
	scanf("%d %s %d %s %d", &field, str, &returnfield, checkstr, &check);

	RESULT result = Search((FIELD)field, str, (FIELD)returnfield);

	if (result.count != check || (result.count == 1 && (strcmp(checkstr, result.str) != 0)))
		Score -= ScoreIdx;
}

static void run()
{
	int N;
	scanf("%d", &N);
	for (int i = 0; i < N; i++)
	{
		int cmd;
		scanf("%d", &cmd);
		switch (cmd)
		{
		case CMD_INIT:   cmd_init();   break;
		case CMD_ADD:    cmd_add();    break;
		case CMD_DELETE: cmd_delete(); break;
		case CMD_CHANGE: cmd_change(); break;
		case CMD_SEARCH: cmd_search(); break;
		default: break;
		}
	}
}

static void init()
{
	Score = 1000;
	ScoreIdx = 1;
}

int main()
{

	int T;
	scanf("%d", &T);

	int TotalScore = 0;
	for (int tc = 1; tc <= T; tc++)
	{
		init();

		run();

		if (Score < 0)
			Score = 0;

		TotalScore += Score;
		printf("#%d %d\n", tc, Score);
	}
	printf("TotalScore = %d\n", TotalScore);

	return 0;
}

***
#include <cstring>
using namespace std;
 
#define MAXPOOL 250000
#define MAX 50000
typedef enum
{
    NAME,
    NUMBER,
    BIRTHDAY,
    EMAIL,
    MEMO
} FIELD;
 
typedef struct
{
    int count;
    char str[20];
} RESULT;
 
int pool;
char record[MAX][5][20];
int ind;
int mark[MAX];
 
void strCpy(char* des, char* src)
{
    int i = 0;
    while (src[i] != '\0')
    {
        des[i] = src[i];
        i++;
    }
    des[i] = src[i];
}
 
int strCmp(char* str1, char* str2)
{
    int i = 0;
    while (str1[i] != '\0')
    {
        if (str1[i] != str2[i]) return str1[i] - str2[i];
        i++;
    }
    return str1[i] - str2[i];
}
 
struct node
{
    int index;
    node* nextNode;
};
 
node* TB[5][MAX];
node Pool[MAXPOOL];
 
int getHash(char* str)
{
    unsigned int h = 96;
    int i = 0;
    while (str[i])
    {
        h = h*31 + str[i++];
    }
    return h%MAX;
}
 
void addNewNode(int id, int h, int field)
{
    node* tmp = &Pool[pool++];
    tmp->index = id;
    tmp->nextNode = nullptr;
    if (TB[field][h] == nullptr)
    {
        TB[field][h] = tmp;
    }
    else
    {
        tmp->nextNode = TB[field][h];
        TB[field][h] = tmp;
    }
}
 
void addToTB(int id)
{
    for (int i = 0; i < 5; i++)
    {
        int h = getHash(record[id][i]);
        addNewNode(id,h,i);
    }
}
 
void InitDB()
{   
    pool = 0;
    ind = 0;
    memset(TB,0,sizeof(TB));
}   
 
void Add(char* name, char* number, char* birthday, char* email, char* memo)
{
    strCpy(record[ind][0],name);
    strCpy(record[ind][1],number);
    strCpy(record[ind][2],birthday);
    strCpy(record[ind][3],email);
    strCpy(record[ind][4],memo);
    addToTB(ind);
    mark[ind] = 1;
    ind++;
}
 
int Delete(FIELD field, char* str)
{
    int count = 0;
    int h = getHash(str);
    node* temp = TB[field][h];
    while (temp)
    {
        if (mark[temp->index] == 1 && strCmp(record[temp->index][field], str) == 0)
        {
            mark[temp->index] = 0;
            count++;
        }
        temp = temp->nextNode;
    }
    return count;
}
int Change(FIELD field, char* str, FIELD changefield, char* changestr) 
{
    int change = 0;
    int h = getHash(str);
    node* temp = TB[field][h];
    while (temp)
    {
        if (mark[temp->index] == 1 && strCmp(record[temp->index][field],str) == 0)
        {
            change++;
            strCpy(record[temp->index][changefield],changestr);
            int h1 = getHash(changestr);
            addNewNode(temp->index,h1,changefield);
        }
        temp = temp->nextNode;
    }
    return change;
}
RESULT Search(FIELD field, char* str, FIELD returnfield)
{
    RESULT res;
    res.count = 0;
    int h = getHash(str);
    node* temp = TB[field][h];
    while (temp)
    {
        if (mark[temp->index] == 1 && strCmp(record[temp->index][field],str) == 0)
        {
            strCpy(res.str, record[temp->index][returnfield]);
            res.count++;
        }
        temp = temp->nextNode;
    }
    return res; 
}

*** 
50
10
0 200
1 757148
1 851001
1 413357
1 971125
4 0 kimgysrtpnjzbp 1 01072086371 1
4 0 leefgujjze 2 19260414 1
4 4 cwjpxrzpsof 2 19260414 1
4 1 01086024865 3 NULL 0
4 3 jqtwx@e.com 4 ccxzhdzymdjpt 1
10
0 250
1 12333
1 257225
1 797441
1 755057
1 646417
4 3 urofugl@f.com 2 19430108 1
4 0 jungeaymdwgakf 4 bkohczp 1
4 2 19230102 1 01047630925 1
2 0 parkuscg 1
20
0 100
1 494529
1 547831
1 998222
1 161665
1 773941
1 724397
1 666286
1 402971
1 581613
4 4 dwbsv 1 01086439476 1
4 2 19650523 3 lokljj@r.com 1
3 4 xunfqctehmhw 3 xwhmsn@c.com 1
3 0 parkub 2 19900609 1
3 1 01097910257 1 01039181953 1
3 2 19951212 2 19811114 1
4 4 xunfqctehmhw 1 01051775539 1
4 0 parkub 4 iqbfrrmwratx 1
4 0 leezmgncw 3 xwhmsn@c.com 1
4 4 dwbsv 1 01086439476 1
20
0 125
1 71424
1 186914
1 244835
1 476636
1 311553
1 546031
1 713617
1 516971
1 951915
1 602407
4 0 leeszqjhgmcs 3 puntsiqps@v.com 1
1 800257
4 1 01005048566 3 bdbdoytbck@f.com 1
4 4 ufkzlaizlt 1 01018746381 1
4 0 leeszqjhgmcs 3 puntsiqps@v.com 1
4 2 19230115 4 gkmjylyyhkkr 1
4 0 jungvmv 4 mldlgk 1
3 2 19410621 3 epjsrdzja@z.com 1
4 0 jungvmv 2 19600604 1
30
0 84
1 372681
1 998981
1 854951
1 749264
1 760961
1 999096
1 757001
1 905331
1 882857
1 474001
1 542653
1 892043
1 95949
1 865644
3 4 mxrfmkttbmomvv 2 19260822 1
1 395692
4 3 hpnscsmjz@r.com 0 kangbbzdshcphog 1
4 0 kangbbzdshcphog 3 hpnscsmjz@r.com 1
4 2 19341021 0 parkqagotb 1
4 0 parkrsbccjbsp 2 19550510 1
4 3 hzihsavj@n.com 2 19550510 1
1 411001
4 0 parkwzdqyo 1 NULL 0
4 1 01001793459 0 kangfbg 1
4 3 zqrgflvcefvf@o.com 2 19600914 1
4 0 limjzoix 4 loqkwkyx 1
4 1 01003991360 4 kwhevxz 1
1 24551
3 3 nivgft@k.com 4 kwhevxz 1
30
0 84
1 73109
1 574081
1 435177
1 764301
1 846734
1 496026
1 633605
1 544848
1 415473
1 312137
1 595209
1 502521
1 563001
1 818981
1 768385
3 0 parkyylueyoeqe 3 mayvudj@l.com 1
3 0 leecsk 3 zudl@t.com 1
4 4 nmwbfty 0 limgcufqjp 1
4 0 parkyzupol 1 01020452508 1
3 2 19760921 4 owkbjzwucwl 1
3 0 choiekaaogozxl 0 ohtoohonagn 1
1 579871
4 2 19860414 0 ohtoohonagn 1
4 3 uhuhrsmiiva@a.com 2 19490309 1
1 970536
4 2 19981002 3 chjdwnujhr@d.com 1
4 3 kbcltfnijs@c.com 4 ooursvtxz 1
3 3 kbcltfnijs@c.com 0 chootzgkubmjrm 1
4 1 01052910135 2 19570912 1
40
0 91
1 51876
1 636341
1 421777
1 699117
1 918913
1 138369
1 753111
1 767966
1 241431
1 410876
1 618483
1 488501
1 491709
1 775230
1 88033
1 726097
1 258783
1 184103
1 975569
4 3 lgxsyqvoxqzoi@d.com 4 arjhzl 1
4 3 xjmmhwgtie@y.com 0 kimqsyos 1
4 3 bbwjb@u.com 1 01001316008 1
4 1 01096118111 4 xtjezqg 1
4 4 erekctjnvshrst 0 kangsbdmslee 1
1 522014
4 3 mqiyfxezi@d.com 4 tpeczxfsybyonu 1
2 1 01017290941 1
1 32521
1 435123
4 0 jungjjbmjzaz 1 01001316008 1
4 4 gksoncmxvhklps 3 enlvqrhum@u.com 1
1 133054
4 1 01066334390 4 ukigugntbn 1
1 159326
1 704871
1 465617
4 4 uxogkxdahiqmrt 0 parksuwunnzcw 1
1 745492
1 727691
40
0 67
1 544555
1 893877
1 162193
1 155858
1 513529
1 206171
1 598165
1 9153
1 511201
1 420991
1 137644
1 40652
1 841561
1 502701
1 770851
1 596783
1 991399
1 289281
1 644084
4 1 01019952397 0 chofikavem 1
4 1 01022270144 2 19920110 1
3 1 01093935003 1 01078148007 1
4 2 19630109 3 alytvtrduzj@a.com 1
4 2 19030914 3 vsxwgceal@b.com 1
4 3 olhxwuimukr@p.com 2 19160621 1
1 752668
1 851681
1 487957
4 1 01008584167 2 19430926 1
4 3 buel@u.com 1 01085300919 1
1 514935
4 4 mwaqx 0 ohcupwufiizrb 1
4 3 yqphb@k.com 1 01047887050 1
4 1 01016095890 2 NULL 0
4 2 19470705 1 01073209543 1
4 4 fyrarxsvkhtqd 1 NULL 0
2 2 19820317 1
4 4 xpnxt 3 zynluzrmenp@s.com 1
1 380950
50
0 48
1 851736
1 860926
1 993201
1 213536
1 412625
1 538083
1 322701
1 540236
1 166830
1 98497
1 156099
1 282169
1 131221
1 164947
1 992321
1 185163
1 313181
1 192137
1 56011
1 114041
1 996013
1 338735
1 217254
1 142976
3 4 hpvmjrqzxo 1 01028601260 1
2 4 njuvvg 1
2 1 01019233387 1
3 2 19700917 1 01022743974 1
1 237982
1 721861
3 3 vghlijr@j.com 3 ssqctydteamd@c.com 1
4 3 rqgvjwkbzcb@m.com 1 01048134111 1
4 3 rqgvjwkbzcb@m.com 1 01048134111 1
4 3 rklppm@y.com 4 taoorl 1
4 2 19990505 0 ohmlvpjqjqkvmh 1
4 0 ohynzybq 4 vzmfpak 1
3 3 ibqw@t.com 1 01019028314 1
4 4 zicyxyvb 0 parklzmkw 1
2 0 parkdmbxj 1
3 3 yrfvvri@v.com 3 rqgvjwkbzcb@m.com 0
1 487137
2 2 19730423 1
3 1 01048134111 4 ckmvmz 1
3 1 01071545096 2 19520624 1
4 1 01056197303 0 kimaxumrzuoz 1
1 339497
4 2 19520624 4 orpayg 2
4 0 chorrgboztkmvu 1 01093923134 1
3 3 fouzhqmxeymyi@r.com 0 jangmhurktr 1
50
0 46
1 30064
1 504436
1 328481
1 148273
1 123338
1 386613
1 67766
1 330921
1 337306
1 14346
1 484859
1 754485
1 199541
1 110416
1 95751
1 852751
1 494618
1 997111
1 734975
1 35073
1 819575
1 296421
1 562072
1 663836
2 1 01026765525 1
4 1 01068239359 4 gtdnebex 1
3 1 01025624868 0 ohsxttobbg 1
4 1 01025624868 4 ivhphymsxwvg 1
4 3 sqhwvf@o.com 1 01005079846 1
4 0 leedlc 3 xakdjrchpbbs@j.com 1
3 0 parkvxvpvd 3 gxuxz@r.com 1
4 1 01021854550 2 19590107 1
3 2 19390625 2 19590717 1
4 3 ptnnmzjgldlur@f.com 1 NULL 0
2 1 01068239359 1
4 0 jungjollmsqsghm 4 NULL 0
4 0 kimxeughvt 4 hmkrt 1
4 4 vyrltqyv 2 19850425 1
4 1 01036554050 2 NULL 0
2 1 01014462172 1
1 961961
4 0 choihjv 2 19570829 1
3 2 19251204 3 evbsiptoxjh@l.com 0
2 0 ohsxttobbg 1
4 2 19020317 0 NULL 0
4 2 19590107 0 parkttyjasos 1
4 1 01056413590 3 qomshau@x.com 1
1 700101
1 209633
50
0 44
1 918711
1 581907
1 376363
1 686977
1 60625
1 386939
1 568501
1 551266
1 385256
1 59921
1 869822
1 542056
1 996142
1 965957
1 752958
1 580455
1 239000
1 595881
1 599193
1 554428
1 579329
1 311431
1 810236
1 250279
4 0 jangwudbo 4 ruoavwi 1
3 1 01014405687 0 kangmb 1
3 2 19700409 2 19940822 1
4 1 01064131716 0 kangbhxbbrszkp 1
4 0 leegpfx 1 01087479896 1
4 0 choiadohmlo 3 qrytkf@e.com 1
4 3 dxwfiuwjc@a.com 4 ltntpdk 1
4 3 lfvftidfo@z.com 4 wfzmzffycil 1
3 4 ophwu 3 gkjisuxh@a.com 1
2 1 01046140822 1
4 3 uclanjbw@z.com 4 porkarme 1
2 1 01046140822 0
3 3 xsxljdvwbexml@g.com 2 19380720 1
2 4 xlcwjxr 1
1 552041
4 0 kangsdwhf 4 pkngwlqwql 1
2 2 19870722 0
4 1 01082270556 0 jangvqgibfx 1
4 0 jungbjtee 2 19290828 1
3 0 kangmb 4 jsaevteqcsk 1
3 3 dxwfiuwjc@a.com 3 kntarjkpxin@o.com 1
3 3 xpvve@h.com 0 leehkw 1
4 4 yyxrupuvo 0 parkaakqc 1
4 4 omnzwjspx 2 19330507 1
1 61039
60
0 39
1 188467
1 998849
1 425771
1 333937
1 225783
1 425596
1 569697
1 131571
1 676718
1 501863
1 567295
1 372009
1 895280
1 459937
1 378543
1 666701
1 635641
1 639293
1 332661
1 55617
1 109161
1 616021
1 332843
1 271196
1 791547
1 208325
1 933401
1 391007
1 818927
3 2 19730824 3 rkopvouf@z.com 1
4 4 fndpaq 1 01006743340 1
1 505641
4 0 limqyvthl 2 19841004 1
4 3 uomv@p.com 1 01065692921 1
3 1 01046447386 1 01079346043 1
4 3 kfdyz@i.com 0 ohtspxtttkbwrf 1
2 3 cvfx@s.com 0
3 3 cecpiph@p.com 0 kimetau 1
1 98591
3 3 ujnw@h.com 4 xxczhpocyknjj 1
4 4 fxbell 0 chojql 1
3 4 bvohjdbscwh 3 vhkwjchfzbp@v.com 1
4 0 leewwphhmc 2 19450729 1
1 308673
4 3 rkopvouf@z.com 4 ucejubgps 2
3 4 bezspkpcecun 0 choisrqtmk 1
4 2 19610921 4 bezspkpcecun 1
4 0 choisrqtmk 3 wkrwwge@v.com 1
4 3 mvuktythoiccx@b.com 0 parkbi 1
4 3 bsemfysu@v.com 1 01051728807 1
4 3 vudqzmsb@j.com 4 qpnck 1
4 4 fxbell 1 01072851938 1
4 0 limqyvthl 1 01049570033 1
2 0 choifdbx 1
3 3 ivgwy@x.com 2 19230211 1
1 297155
3 1 01090994639 3 uomv@p.com 1
4 0 parkjvdhfan 4 tvgqwbcr 1
3 0 choiihyqkxzm 2 19210308 1
70
0 33
1 870241
1 269175
1 562425
1 571626
1 207735
1 871797
1 224385
1 927843
1 724499
1 95439
1 181276
1 696245
1 519701
1 849725
1 952561
1 426945
1 907460
1 827013
1 82497
1 794619
1 392525
1 270564
1 935138
1 622225
1 223046
1 722889
1 965316
1 821641
1 191364
1 416401
1 459414
1 247393
1 668147
1 496577
2 3 jewvbzyak@o.com 1
2 4 jzsegaojw 1
1 395
3 3 uyyzgzzcfeqdw@v.com 0 ohecwgxxpsw 1
4 2 19901023 1 NULL 0
4 2 19610830 1 NULL 0
4 1 01033148091 0 kimnfxlwit 1
4 4 gwtlhlrn 3 rweqwukps@p.com 1
4 1 01006254812 3 jrejcwqbfyfr@i.com 1
3 2 19901105 2 19080726 1
4 4 wsphmmgquzsu 2 19860421 1
4 1 01049085993 4 cpajig 1
4 4 ichgmzvuwoaamm 1 01050876225 1
3 0 jangswwho 4 wsphmmgquzsu 1
3 0 kimqheyfzcbgy 1 01049085993 1
3 2 19420402 0 kimqheyfzcbgy 1
4 3 rweqwukps@p.com 0 parkcsm 1
1 701679
4 4 msfquefieuv 0 parkybcaskw 1
4 1 01090550932 2 19860421 1
4 0 choipcmmqtf 2 19360224 1
3 3 wjywqwqn@h.com 1 01034467181 1
4 1 01017453668 0 limxjols 1
3 0 jangbfuhxp 4 lrdkexdtqu 1
3 0 jungzlfkzr 3 jifvgymkgot@z.com 1
4 3 tuvt@h.com 1 01003405561 1
4 2 19820618 4 wfhxmr 1
1 232448
3 2 19771126 2 19111106 1
4 2 19080726 0 chosmzlbj 2
4 3 hpqnvafqmvr@b.com 1 01095157719 1
4 1 01087577876 0 parkybcaskw 1
4 2 19970610 4 cjeoav 1
1 544095
3 1 01021218638 0 leeoqptqq 1
80
0 33
1 626201
1 355717
1 424139
1 641190
1 490581
1 945011
1 987218
1 922613
1 393153
1 144128
1 366955
1 763784
1 701475
1 394581
1 948457
1 951705
1 868045
1 680816
1 269265
1 632124
1 276366
1 387221
1 711969
1 375326
1 319688
1 263896
1 269621
1 570311
1 192721
1 766501
1 166193
1 949206
1 361789
1 128193
1 181521
1 678783
1 874311
1 932061
1 734200
4 0 leegajzegkgrt 1 01014586433 1
1 274363
2 3 hqgiyybyxs@n.com 1
4 3 yxvqaqwovuzwu@z.com 1 01038951473 1
1 973614
3 4 ayvlbpbbzzlb 4 oaneebwli 1
4 2 19270605 0 NULL 0
3 1 01097578824 1 01009577016 1
1 637497
3 3 lmiwdpukdgh@l.com 2 19141030 1
2 4 bdkpspslxszsw 1
4 1 01056070965 2 19230527 1
3 3 cpgiklzl@i.com 3 bppxpfwnlx@o.com 1
1 953901
2 2 19990727 1
4 3 plcxf@a.com 1 01065954655 1
4 1 01044757853 4 jyvvoyzpj 1
4 0 jungwlb 4 nyukephlxoeug 1
4 1 01068603640 4 tbjcqg 1
3 1 01038157692 3 ebivyezl@j.com 1
1 329234
4 3 xxgvzqmeyrov@f.com 2 NULL 0
1 424413
3 2 19020221 3 zksszjkfwdxu@g.com 1
3 4 ihazrssfszwxbq 4 yrothctkiekdu 0
4 3 bhlitm@w.com 4 cuomgj 1
1 9491
4 1 01041319158 2 19900917 1
4 1 01014949776 3 wjhvoj@h.com 1
3 4 vpkmjgswwi 3 iamqonhyfkpk@g.com 1
1 88749
3 2 19230527 4 ojnzsm 1
2 0 leeazncmo 1
3 2 19990727 1 01082697175 0
4 1 01069968968 0 parkenk 1
4 2 19970411 0 leemfhenul 1
3 0 choiubzteweaxxw 1 01065954655 1
4 2 19560406 0 kimemhpeuws 1
3 4 uivszvcxjvvb 4 bdkpspslxszsw 1
1 431401
90
0 32
1 313604
1 62979
1 504049
1 52016
1 843497
1 257385
1 302034
1 402674
1 547801
1 635113
1 333577
1 565281
1 740829
1 902885
1 718317
1 746170
1 224249
1 446881
1 450045
1 374201
1 670606
1 896656
1 809999
1 222103
1 73975
1 576465
1 417051
1 398489
1 358017
1 759169
1 873211
1 737807
1 515733
1 907521
1 350042
1 484501
1 947030
1 753587
1 528486
1 797253
1 685711
1 869531
1 248549
1 85201
3 3 fxic@l.com 2 19160230 1
2 0 jungce 2
1 58151
4 1 01042661913 4 fogolfcumwqs 1
1 271726
4 0 leedqo 4 xctwrysah 1
4 4 uutvjhrpbkmfh 0 ohvfas 1
4 0 chodkfqdxye 4 jgzdzshuu 1
3 0 jungmgn 0 chohgdmlxukwyz 1
4 2 19970108 4 revzpp 1
1 205934
3 0 jangje 3 bldjie@m.com 1
3 4 btxfeaxesf 3 betdrryhjdxh@k.com 1
4 1 01058542664 2 NULL 0
4 1 01095302835 2 19240514 1
1 659239
4 1 01095620958 4 NULL 0
1 757473
4 0 kimoipkxzyxtd 2 19160230 1
1 102151
4 1 01072840893 0 ohuphmm 1
1 561953
4 4 lolkllf 0 kangybqokhe 1
1 954651
2 3 lylshhtw@q.com 1
4 1 01066054689 0 junguzsjpppok 1
2 0 kangahqatms 0
4 3 dywgcg@s.com 0 NULL 0
3 2 19591122 4 coohwlj 1
1 437138
2 2 19710230 1
4 3 betdrryhjdxh@k.com 2 19460110 2
4 1 01015833669 4 wtoemhr 1
4 2 19860405 3 odxskanncisah@z.com 1
4 2 19860405 3 odxskanncisah@z.com 1
4 1 01027205976 0 limbfqhdesuht 1
3 0 leejttyku 2 19220729 1
3 0 chohgdmlxukwyz 0 choitjzppkwl 1
3 2 19090825 4 bnanhrrbddn 1
1 880267
3 2 19950929 2 19231004 1
4 1 01024729776 3 odxskanncisah@z.com 1
1 398609
1 21193
1 388169
100
0 24
1 746211
1 74001
1 690726
1 385751
1 221761
1 796484
1 665817
1 864833
1 595816
1 896467
1 811623
1 335937
1 583105
1 190204
1 177321
1 779617
1 713623
1 262016
1 832563
1 581076
1 607880
1 570601
1 101871
1 861098
1 14041
1 470723
1 390086
1 576091
1 447216
1 81656
1 476006
1 185857
1 51081
1 685793
1 553321
1 17569
1 323885
1 125481
1 929045
1 53457
1 616737
1 477188
1 98491
1 435929
1 118309
1 349091
1 855681
1 497721
1 707519
4 2 19971223 3 osldtv@g.com 1
2 0 chotjgowk 1
3 2 19280801 3 osldtv@g.com 1
1 119291
4 2 19770616 3 qgamfx@m.com 1
4 0 jangdhtphoa 3 jzvrqtproyftf@n.com 1
4 4 tccjyplry 2 19910520 1
4 0 jungtd 4 kotncp 1
2 3 qponnnawysbn@o.com 1
1 115046
3 3 xzzazmjydyd@y.com 0 ohexggfozhothih 1
3 3 osldtv@g.com 3 rjbfrjpcgdjdr@w.com 2
2 3 fgjjj@b.com 1
3 4 kotncp 2 19441013 0
3 0 kimpqicgr 2 19910520 1
4 2 19251113 1 01064602569 1
1 648391
1 779068
4 3 jkprruyuw@g.com 4 bprwyxxehl 1
4 4 suiqwprqn 0 choxlfic 1
4 4 sondruiajnur 1 NULL 0
3 2 19910520 0 ohsrtuixrcv 2
3 2 19330108 3 jzvrqtproyftf@n.com 1
4 0 kimqcctkbt 3 bsinwvantrwjj@y.com 1
1 502317
1 277478
4 3 fgjjj@b.com 2 NULL 0
3 0 jangefwu 3 qghosyvg@m.com 1
3 4 whubcx 4 kyadxdgzlzkxmu 1
4 2 19311226 1 01061086162 1
1 587841
4 4 deiyeg 1 01087783961 1
4 1 01010707184 0 jungvfzbrthzs 1
4 0 ohsrtuixrcv 4 fgcxjk 3
4 4 svfmjsguc 0 kimziidzs 1
4 4 kotncp 1 NULL 0
3 2 19110321 4 hlvbypec 1
4 2 19060718 4 kyadxdgzlzkxmu 1
3 2 19910520 0 kangdqsvmte 2
4 2 19340607 4 zcdff 1
4 3 zrtr@s.com 4 opyaajz 1
4 2 19940420 3 aojyrd@c.com 1
4 3 xzzazmjydyd@y.com 2 19360722 1
3 4 uvnymsbolqe 4 egkmqltbc 1
2 2 19731017 1
2 1 01069396922 1
4 1 01098909693 2 19030428 1
4 0 chombsijhkl 1 NULL 0
4 1 01044601341 3 wxlhsgkwnelj@q.com 1
4 3 khlrbxbluzcpo@n.com 4 zcdff 1
Editor is loading...
Leave a Comment