blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 3
357
| content_id
stringlengths 40
40
| detected_licenses
listlengths 0
58
| license_type
stringclasses 2
values | repo_name
stringlengths 4
115
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringlengths 4
58
| visit_date
timestamp[ns]date 2015-07-14 21:31:45
2023-09-06 10:45:08
| revision_date
timestamp[ns]date 1970-01-01 00:00:00
2023-09-05 23:26:37
| committer_date
timestamp[ns]date 1970-01-01 00:00:00
2023-09-05 23:26:37
| github_id
int64 966
689M
⌀ | star_events_count
int64 0
209k
| fork_events_count
int64 0
110k
| gha_license_id
stringclasses 24
values | gha_event_created_at
timestamp[ns]date 2012-06-07 00:51:45
2023-09-14 21:58:52
⌀ | gha_created_at
timestamp[ns]date 2008-02-03 21:17:16
2023-08-24 19:49:39
⌀ | gha_language
stringclasses 180
values | src_encoding
stringclasses 35
values | language
stringclasses 1
value | is_vendor
bool 1
class | is_generated
bool 2
classes | length_bytes
int64 6
10.4M
| extension
stringclasses 121
values | filename
stringlengths 1
148
| content
stringlengths 6
10.4M
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
bb95b7f31307f48dca1a1d538c5a3977bc4f7b23
|
c362c8d1803719f499f326649cf96b258a858825
|
/ue5/src/linalg.h
|
cda02aa4f3d0c9521d47e4612b7dff9bec76ae08
|
[] |
no_license
|
Klump3n/compphysthree
|
951291fad0c34604a28aa177f0c58d4151ff5d1e
|
646e2bcb852a2d8e0609f3dc1c429301f5055cfb
|
refs/heads/master
| 2020-03-16T08:40:45.768890 | 2018-07-23T14:01:27 | 2018-07-23T14:01:27 | 132,600,306 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,380 |
h
|
linalg.h
|
#ifndef LINALG_H
#define LINALG_H
extern void random_vector(double *p);
extern double norm_sqr(double *v);
extern double vector_prod(double *v, double *w);
extern void assign_v2v(double *v, double *w);
extern void mul_add(double *v, double a, double *w);
extern void update_p(double *r, double b, double *p);
extern void laplace_2d(double *w, double *v);
extern __global__ void reduceUnrolling (double *g_idata, double *g_odata, unsigned int n);
extern __global__ void assign_v2v_gpu(double *v, double *w, int nx, int ny);
extern __global__ void mul_add_gpu(double *v, double a, double *w, int nx, int ny);
extern __global__ void update_p_gpu(double *r, double b, double *p, int nx, int ny);
extern __global__ void laplace_2d_gpu(double *w, double *v, int nx, int ny);
/* our stuff */
extern double vector_add(double *v, const int n);
extern void norm_sqr_gpu(double *res, double *d_r, double *d_intmed1, double *d_intmed2, int Nx, int Ny);
extern __global__ void vector_multiply_entries_gpu(double *res, double *v, double *w, int nx, int ny);
extern __global__ void vector_square_entries_gpu(double *v, double *w, int nx, int ny);
extern void vector_prod_gpu(double *res, double *d_v, double *d_w, double *d_intmed1, double *d_intmed2, double *d_intmed3, int nx, int ny);
extern __global__ void alt_vect_prod(double *d_res, double *d_v, double *d_w, int nx, int ny);
#endif
|
c81380f393e36654898945a60bad89053d05ff09
|
185a188f56d32da7cc323f1befffaddd72d70287
|
/midi/message_format.h
|
020227158701f280a4973b72ddbc775f41cc1772
|
[
"BSD-2-Clause"
] |
permissive
|
g-coder/midikit
|
6629e76ba6480be2bd8f05ca2e0db1df294ad21f
|
dc3b97df531e59c0226cb2709113fd6f60bfa281
|
refs/heads/master
| 2021-01-18T12:10:50.889172 | 2015-11-04T11:50:51 | 2015-11-04T11:50:51 | 45,519,319 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,838 |
h
|
message_format.h
|
#ifndef MIDIKIT_MIDI_MESSAGE_FORMAT_H
#define MIDIKIT_MIDI_MESSAGE_FORMAT_H
#include "midi.h"
#define MIDI_MESSAGE_DATA_BYTES 4
struct MIDIMessageData {
unsigned char bytes[MIDI_MESSAGE_DATA_BYTES];
size_t size;
void * data;
};
struct MIDIMessageFormat * MIDIMessageFormatDetect( void * buffer );
struct MIDIMessageFormat * MIDIMessageFormatDetectRunningStatus( void * buffer, MIDIRunningStatus * status );
struct MIDIMessageFormat * MIDIMessageFormatForStatus( MIDIStatus status );
int MIDIMessageFormatTest( struct MIDIMessageFormat * format, void * buffer );
int MIDIMessageFormatGetSize( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
size_t * size );
int MIDIMessageFormatSet( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
MIDIProperty property, size_t size, void * value );
int MIDIMessageFormatGet( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
MIDIProperty property, size_t size, void * value );
int MIDIMessageFormatEncodeRunningStatus( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
MIDIStatus * status, size_t size, void * buffer, size_t * written );
int MIDIMessageFormatDecodeRunningStatus( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
MIDIStatus * status, size_t size, void * buffer, size_t * read );
int MIDIMessageFormatEncode( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
size_t size, void * buffer, size_t * written );
int MIDIMessageFormatDecode( struct MIDIMessageFormat * format, struct MIDIMessageData * data,
size_t size, void * buffer, size_t * read );
#endif
|
0c3cc5c74dac3af0e881e02ea560c940cf36278d
|
ca6118566c571791da5db47f2510ff320894a8bc
|
/NinePatch.h
|
da811245fcdf0483fa82ee29938e31d8faf4caea
|
[] |
no_license
|
nebomuk/QtNinePatch
|
70915da9f347aec8c191758491b3de10a5daceea
|
52acd71869ff01ce4856bdd2af1cffd666c1623e
|
refs/heads/master
| 2021-09-25T16:50:04.822569 | 2016-10-23T07:49:06 | 2016-10-23T07:49:06 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 179 |
h
|
NinePatch.h
|
#ifndef NINEPATCH_H
#define NINEPATCH_H
#include <QImage>
#include <QPixmap>
QPixmap createPixmapFromNinePatchImage(QImage const &image, int dw, int dh);
#endif // NINEPATCH_H
|
4874e99e4e7bc9f7e16dee6729f978a39e0d9b78
|
faf49db763dc3f83628d36ea2b52a16a4cf51c4f
|
/bareMetalC/mvin_mvout_acc_full.c
|
f000fd2af7a659ecebb50a52ab4df8283f3b1ad7
|
[
"BSD-2-Clause"
] |
permissive
|
ucb-bar/gemmini-rocc-tests
|
0d44cbe0d16639660ea5bcd6b75e2cc8999631d1
|
8649305e2ce73b882c4349178e34bd5c3739b8fa
|
refs/heads/dev
| 2023-08-31T18:06:20.878238 | 2023-07-24T05:17:09 | 2023-07-24T05:17:09 | 173,883,315 | 47 | 38 |
NOASSERTION
| 2023-07-24T05:17:10 | 2019-03-05T05:54:14 |
C
|
UTF-8
|
C
| false | false | 2,638 |
c
|
mvin_mvout_acc_full.c
|
// See LICENSE for license details.
#include <stdint.h>
#include <stddef.h>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#ifndef BAREMETAL
#include <sys/mman.h>
#endif
#include "include/gemmini_testutils.h"
#define N 4
#if (N*DIM) > ACC_ROWS
#error not enough accumulator space
#endif
int main() {
#ifdef ACC_READ_FULL_WIDTH
#ifndef BAREMETAL
if (mlockall(MCL_CURRENT | MCL_FUTURE) != 0) {
perror("mlockall failed");
exit(1);
}
#endif
gemmini_flush(0);
static acc_t In[N][DIM][DIM] row_align_acc(1);
static acc_t Out[N][DIM][DIM] row_align_acc(1);
// printf("Initializing matrices\n");
for (size_t n = 0; n < N; ++n)
for (size_t i = 0; i < DIM; ++i)
for (size_t j = 0; j < DIM; ++j) {
#ifndef ELEM_T_IS_FLOAT
In[n][i][j] = 0;
#ifdef FAST
#define RAND (j + i)
#else
#define RAND rand()
#endif
int bytes = RAND % 2 ? sizeof(acc_t) : sizeof(elem_t);
for (size_t b = 0; b < bytes; ++b) {
In[n][i][j] |= (RAND % 255) << (b*8);
}
#else
acc_t_bits data;
do {
data = 0;
int bytes = rand() % 2 ? sizeof(acc_t) : sizeof(elem_t);
for (size_t b = 0; b < bytes; ++b) {
data |= (uint64_t)(rand() % 255) << (b*8);
}
In[n][i][j] = acc_t_bits_to_acc_t(data);
} while (acc_t_isnan(In[n][i][j]));
#endif
}
const uint32_t acc_addr = 5 << (ADDR_LEN-3);
// printf("Config\n");
gemmini_config_ld(DIM*sizeof(acc_t));
gemmini_config_ex(0, NO_ACTIVATION, 0);
gemmini_config_st(DIM*sizeof(acc_t));
// printf("Mvin and mvout\n");
for (size_t n = 0; n < N; ++n) {
// printf("Mvin n: %u\n", n);
gemmini_mvin(In[n], acc_addr + n*DIM);
// printf("Mvout n: %u\n", n);
gemmini_mvout(Out[n], acc_addr + n*DIM);
}
// printf("Fence\n");
gemmini_fence();
// printf("Check\n");
for (size_t n = 0; n < N; ++n)
if (!MAT_IS_EQUAL(DIM, DIM, Out[n], In[n])) {
printf("Matrix %u:\n", n);
for (size_t i = 0; i < DIM; ++i) {
for (size_t j = 0; j < DIM; ++j)
#ifndef ELEM_T_IS_FLOAT
printf("%d ", In[n][i][j]);
#else
printf("%llx ", acc_t_to_acc_t_bits(In[n][i][j]));
#endif
printf("\n");
}
printf("\nMatrix %u output:\n", n);
for (size_t i = 0; i < DIM; ++i) {
for (size_t j = 0; j < DIM; ++j)
#ifndef ELEM_T_IS_FLOAT
printf("%d ", Out[n][i][j]);
#else
printf("%llx ", acc_t_to_acc_t_bits(Out[n][i][j]));
#endif
printf("\n");
}
printf("\n");
exit(1);
}
#endif // #ifdef ACC_READ_FULL_WIDTH
exit(0);
}
|
cfa7de189e152ed14dba8b2f540c3e481cf80e0a
|
8f31c70facd7dcf67c9b673743ee958505d8fdc7
|
/exswitch.c
|
5cf856d05cb45e60cfdf7a3aaa0afe6e7041177e
|
[] |
no_license
|
rubenvasconcelos19/sexta
|
3b05c5ef454fba8a69fbc1cd47ad2986dcc35c46
|
b975fa63096c8dd9b51304973724d18a38b4889d
|
refs/heads/master
| 2020-09-25T00:01:24.218314 | 2020-01-15T13:35:25 | 2020-01-15T13:35:25 | 225,874,671 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 980 |
c
|
exswitch.c
|
#include <stdio.h>
int main(void){
char estado;
char nome [100];
printf("Insira o seu nome: ");
scanf("%s", nome);
printf("Insira o seu estado('S','C','U','D','V'): ");
scanf(" %c", &estado);
if (estado == 's' || estado == 'S' || estado == 'V' || estado == 'v' || estado == 'U' || estado == 'u' || estado == 'C' || estado == 'c' || estado == 'D' || estado == 'd'){
switch(estado){
case 's':
case 'S':
printf("Estado: Solteiro \n");
break;
case 'c':
case 'C':
printf("Estado: Casado \n");
break;
case 'u':
case 'U':
printf("Estado: União \n");
break;
case 'd':
case 'D':
printf("Estado: Divorciado \n");
break;
case 'v':
case 'V':
printf("Estado: Viuvo \n");
break;
}
} else {
printf("Insira um estado válido!!! \n");
}
return 0;
}
|
992b311e033bcc4a143738d41899ea1be09af991
|
cff15d54cb8096373815a86372a4b5f7b2d9a38c
|
/DEBUGGER/DeBug.h
|
4551adc0abb991b9421bcc59ccb5127aae1bdeb5
|
[] |
no_license
|
ZXNA/WindowsDebugger
|
c2e5ec536d567f6ead8a68c81fb4873d1531743a
|
31e62d748d1e26b2d3ef60aa505156523149747b
|
refs/heads/master
| 2020-04-04T10:37:36.047394 | 2018-11-02T12:15:54 | 2018-11-02T12:15:54 | 155,861,477 | 3 | 0 | null | null | null | null |
GB18030
|
C
| false | false | 251 |
h
|
DeBug.h
|
#pragma once
#include "stdafx.h"
//界面头
void SoftPage(void);
//根据用户的输入调用相应的API
void SelInvokApi(void);
//接收调试事件
void RecvExceptionInfo(void);
//处理异常信息
DWORD OnException(EXCEPTION_RECORD* pExcept);
|
e5ee6921b32e28990865d23be9027f09b4d2267a
|
0521c08f493e0473fc2dee115e5be9cd1894452f
|
/week4.c
|
32bcd05fcb3ab8f7752e44ac278660ed2bf6e4f0
|
[] |
no_license
|
SparkiexZist/CS113-git101
|
41df4bded7930a6cf63c2fe69138b23ee11bfc48
|
56e26f65545aa4e7354f15f15b33fd4beab2533f
|
refs/heads/master
| 2022-04-04T00:07:14.167667 | 2020-02-14T11:27:22 | 2020-02-14T11:27:22 | 239,154,815 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,820 |
c
|
week4.c
|
#include <stdio.h>
//pointer//
int main()
{
int x = 100;
// int a = 0144; //Octal
// int b = 0x64; //Hexadecimal
// printf("x = %d",x);
// printf("reference x = %lu\n", &x); //& will return addrass
// printf("reference x = %p\n", &x); //%p and & will print Hexadecimal address
// int number[] = {3, 4, 5, 6, 7};
// int number[100];
// int number[100] = {3, 4, 5, 6, 7};
// printf("index 1 = %d\n", number[1]);
// printf("reference number[1] = %p\n", &number[1]+1); //move 1 address. int = 4 bit = move 4 bit.
// printf("reference number[0] = %p\n", &number[0]); //print address in Hexadecimal.
// printf("reference number = %p\n", &number); //print Hexadecimal address.
// printf("reference number[2000] = %p\n", &number[2000]);
int number[] = {3, 4, 5, 6, 7}; //address = {00, 04, 08 ,12, 16}
int *ptr = &x;
int *arrPtr;
arrPtr = number; // point to number[0]
arrPtr += 2; // move address 2 place.
*arrPtr = *arrPtr + 10; //change number at *arrPtr address
printf("arrptr = %p, *arrPtr = %d",arrPtr, *arrPtr);
printf("arrptr = %p, *arrPtr = %d",arrPtr, *arrPtr);
// int number[] = {3, 4, 5, 6, 7};
// for (int *ptr = number; ptr <= &number[4]; ptr++)
// printf("[%p] = %d\n",ptr, *ptr);
// int *ptr2 = number;
// for (int i = 0; i < 5; i++)
// printf("[%p] = %d\n",ptr2+i, *(ptr2+i));
// char input[100];
// int count = 0;
// char c;
// while ((c = getchar()) != '\n')
// {
// input[count] = c;
// ++count;
// }
// input[count] = '\0';
// for (char *cPtr = input;*cPtr != '\0' ; cPtr++)
// printf("%c\n", *cPtr);
// char c;
// int i;
// char s[100];
// scanf("%d-%c-%s",&i ,&c ,s);
// printf("%d %c %s", i, c, s);
}
|
4890ecbd638aac73494ab60d668e46045d2e51d6
|
3ff6b4e2fab2326e316e623e15b865802bab08b3
|
/RDC2-0032_DSP_TAS3251x2/Src/ADC.c
|
b7c97360d7add117e226deab4223ccd61b68c4b4
|
[] |
no_license
|
chipdipru/N7DAMP-digital-power-amplifier-TAS325-x-2-quadro-
|
1262a88ccb06721e1fd87233467ffe45a8798c79
|
30316c83ea1f0f42be448e4f6ef756be4a8d8b2c
|
refs/heads/master
| 2020-09-21T03:29:16.164303 | 2019-12-10T14:38:27 | 2019-12-10T14:38:27 | 224,665,508 | 2 | 1 | null | null | null | null |
WINDOWS-1251
|
C
| false | false | 4,082 |
c
|
ADC.c
|
/*
********************************************************************************
* COPYRIGHT(c) ЗАО «ЧИП и ДИП», 2019
*
* Программное обеспечение предоставляется на условиях «как есть» (as is).
* При распространении указание автора обязательно.
********************************************************************************
*/
#include "ADC.h"
static void (*ADCValuesChanged)(uint16_t);
static ADCType ADCs[ADC_CHANNELS];
static uint16_t ADCRawValues[ADC_CHANNELS] = {0};
void ADC_Init(void (*ADCValuesChangedCallback)(uint16_t))
{
ADCValuesChanged = ADCValuesChangedCallback;
ADC_GPIO->MODER |= (3 << (2 * ADC_0_PIN)) | (3 << (2 * ADC_1_PIN)) | (3 << (2 * ADC_2_PIN)) | \
(3 << (2 * ADC_3_PIN)) | (3 << (2 * ADC_4_PIN)) | (3 << (2 * ADC_5_PIN)) | \
(3 << (2 * ADC_6_PIN)) | (3 << (2 * ADC_7_PIN));
ADC_GPIO2->MODER |= (3 << (2 * ADC_8_PIN));// | (3 << (2 * ADC_9_PIN));
RCC->ADC_ENR |= ADC_CLK_EN;
ADC_USED->CR = ADC_CR_ADCAL;
while(((ADC_USED->CR) & ADC_CR_ADCAL) == ADC_CR_ADCAL);
ADC_USED->CFGR2 = ADC_CFGR2_CKMODE_1;
ADC_USED->SMPR = ADC_SMPR_SMP_2 | ADC_SMPR_SMP_1 | ADC_SMPR_SMP_0;
#if defined(TAS3251_DSP)
ADC_USED->CHSELR = ADC_0_CHNL | ADC_1_CHNL;// | ADC_2_CHNL | ADC_3_CHNL | ADC_4_CHNL | \
ADC_5_CHNL | ADC_6_CHNL | ADC_7_CHNL | ADC_8_CHNL | ADC_9_CHNL;
#elif defined(TAS3251_DSPx2)
ADC_USED->CHSELR = ADC_0_CHNL | ADC_1_CHNL | ADC_2_CHNL;// | ADC_3_CHNL | ADC_4_CHNL | \
ADC_5_CHNL | ADC_6_CHNL | ADC_7_CHNL | ADC_8_CHNL | ADC_9_CHNL;
#elif defined(ADAU1761_DSP) || defined(ADAU1701_DSP)
ADC_USED->CHSELR = ADC_0_CHNL | ADC_1_CHNL | ADC_2_CHNL | ADC_3_CHNL | ADC_4_CHNL | \
ADC_5_CHNL | ADC_6_CHNL | ADC_7_CHNL | ADC_8_CHNL;// | ADC_9_CHNL;
#endif
ADC_USED->CFGR1 = ADC_CFGR1_DMAEN | ADC_CFGR1_DMACFG | ADC_CFGR1_CONT;
ADC_USED->CR |= ADC_CR_ADEN;
while(((ADC_USED->ISR) & ADC_ISR_ADRDY) != ADC_ISR_ADRDY);
RCC->DMA_FOR_ADC_ENR |= DMA_FOR_ADC_CLK_EN;
DMA_CNL_FOR_ADC->CPAR = (uint32_t)(&(ADC_USED->DR));
DMA_CNL_FOR_ADC->CMAR = (uint32_t)(ADCRawValues);
DMA_CNL_FOR_ADC->CNDTR = ADC_CHANNELS;
DMA_CNL_FOR_ADC->CCR |= DMA_CCR_MINC | DMA_CCR_MSIZE_0 | DMA_CCR_PSIZE_0 | DMA_CCR_CIRC;
DMA_CNL_FOR_ADC->CCR |= DMA_CCR_EN;
for (uint8_t chnl = 0; chnl < ADC_CHANNELS; chnl++)
{
ADCs[chnl].CurValue = ADC_MAX_VALUE;
ADCs[chnl].Filter.Result = 0;
for (uint8_t i = 0; i < SMA_SAMPLES; i++)
ADCs[chnl].Filter.Data[i] = 0;
}
RCC->ADC_TIMER_ENR |= ADC_TIMER_CLK_EN;
ADC_TIMER->PSC = ADC_TIMER_PSC;
ADC_TIMER->ARR = ADC_TIMER_ARR;
ADC_TIMER->EGR = TIM_EGR_UG;
NVIC_EnableIRQ(ADC_TIMER_IRQ);
NVIC_SetPriority(ADC_TIMER_IRQ, 1);
ADC_TIMER->SR = 0;
ADC_TIMER->DIER = TIM_DIER_UIE;
}
//------------------------------------------------------------------------------
void ADC_Start()
{
ADC_USED->CR |= ADC_CR_ADSTART;
ADC_TIMER->CR1 |= TIM_CR1_CEN;
}
//------------------------------------------------------------------------------
void TIM14_IRQHandler(void)
{
ADC_TIMER->SR = 0;
uint16_t ADCStatus = 0;
for (uint8_t chnl = 0; chnl < ADC_CHANNELS; chnl++)
{
SMAFilter(ADCRawValues[chnl], &ADCs[chnl].Filter);
if (((ADCs[chnl].CurValue > ADCs[chnl].Filter.Result) && ((ADCs[chnl].CurValue - ADCs[chnl].Filter.Result) >= ADC_THRESHOLD))
|| ((ADCs[chnl].CurValue < ADCs[chnl].Filter.Result) && ((ADCs[chnl].Filter.Result - ADCs[chnl].CurValue) >= ADC_THRESHOLD)))
{
ADCs[chnl].CurValue = ADCs[chnl].Filter.Result;
ADCStatus |= 1 << chnl;
}
}
if (ADCStatus != 0)
ADCValuesChanged(ADCStatus);
}
//------------------------------------------------------------------------------
uint16_t ADC_GetValue(uint8_t ADCChnl)
{
return ADCs[ADCChnl].CurValue;
}
|
69f09943af947387a61b0d9c76897c6b18180035
|
ab7283973224412b641ceb4204a87dade0674ecc
|
/Day 3/solution2.c
|
5f30eed400edab12a49417b4e82c8d4e1eb59708
|
[] |
no_license
|
BradHacker/AdventOfCode2020
|
87bbe3f17beca9b0816d0918b14ec6fe866ff1f9
|
c4573130cf07c36a8d0b1e5b0fadeb911bcf1c11
|
refs/heads/main
| 2023-01-31T16:37:25.129242 | 2020-12-16T01:44:43 | 2020-12-16T01:44:43 | 317,768,060 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,564 |
c
|
solution2.c
|
#include <stdlib.h>
#include <stdio.h>
int main(int argc, char* argv[])
{
if (argc % 2 != 1) {
printf("USAGE: ./sol2 [Slope X 1] [Slope Y 1] [Slope X 2] [Slope Y 2] [...]\n");
exit(EXIT_SUCCESS);
}
FILE* fp;
char* line = NULL;
size_t len = 0;
ssize_t read;
int num_slopes = (argc - 1) / 2;
int* trees = (int*)malloc(sizeof(int) * num_slopes);
int* locations = (int*)malloc(sizeof(int) * num_slopes);
int* xSlopes = (int*)malloc(sizeof(int) * num_slopes);
int* ySlopes = (int*)malloc(sizeof(int) * num_slopes);
// Parse in slopes
for (int a = 0; a < num_slopes; a++) {
xSlopes[a] = atoi(argv[a * 2 + 1]);
ySlopes[a] = atoi(argv[a * 2 + 2]);
}
// Open file
fp = fopen("input.txt", "r");
if (fp == NULL)
exit(EXIT_FAILURE);
// Loop over lines of input
int line_num = 0;
int num_trees = 0;
while ((read = getline(&line, &len, fp)) != -1) {
if (feof(fp))
break;
for (int i = 0; i < num_slopes; i++) {
if (line_num % ySlopes[i] == 0) {
if (line[locations[i]] == '#')
trees[i]++;
locations[i] = (locations[i] + xSlopes[i]) % 31;
}
}
line_num++;
}
// Print product and cleanup
int product = 1;
for (int i = 0; i < num_slopes; i++) {
printf("Right %d, down %d\n", xSlopes[i], ySlopes[i]);
printf("Hit %d trees\n-----\n", trees[i]);
product *= trees[i];
}
printf("Product: %d\n", product);
free(trees);
free(locations);
free(xSlopes);
free(ySlopes);
fclose(fp);
if (line)
free(line);
return 0;
}
|
e2d95b6fbe50818cf4bae03df9a5bd20329eaaab
|
ae4178cee989bb049fa1eb9de2ab9f1e5ac2de23
|
/src/multiplex.h
|
53637a2315135fe795a33c0d572d38fdd1c46ecc
|
[
"MIT"
] |
permissive
|
xsc/fd-multiplex
|
aee015723a2f8ae9933bcbe86fa7d71eb173f389
|
f7ed2bafefcdd94a049235f595e64f0afee50345
|
refs/heads/master
| 2016-09-09T19:27:02.734926 | 2013-09-30T08:52:17 | 2013-09-30T08:52:17 | 12,968,413 | 2 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 3,751 |
h
|
multiplex.h
|
/* The MIT License (MIT)
*
* Copyright (c) 2013 Yannick Scherer
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
* the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef MULTIPLEX_H
#define MULTIPLEX_H
#define CHANNEL_INITIAL_BUFFER_SIZE 256
#define CHANNEL_IGNORED -255
#define CHANNEL_TIMEOUT -77
#define CHANNEL_CLOSED -1
#ifndef NO_MUTEX
#include <pthread.h>
#endif
typedef struct ChannelBuffer {
char * data; // receive buffer
int offset; // current read offset
int length; // current read length
int capacity; // capacity of receive buffer
int initial; // minimum capacity
int newData; // 0 = no new data since last 'select'
} ChannelBuffer;
typedef struct Multiplex {
int fd; // file descriptor
struct ChannelBuffer * channels[256]; // O(1) lookup for channels
#ifndef NO_MUTEX
pthread_mutex_t mutex; // for exclusive access
#endif
} Multiplex;
// Multiplexing Operations (these are not thread-safe!)
Multiplex * multiplex_new(int fd);
void multiplex_enable(Multiplex * c, unsigned char channelId, int initialBufferSize);
void multiplex_enable_range(Multiplex * c, unsigned char minChannelId, unsigned char maxChannelId, int initialBufferSize);
void multiplex_disable(Multiplex * c, unsigned char channelId);
// -- send data; returns result of 'write'
int multiplex_send(Multiplex * c, unsigned char channelId, char const * src, int length);
int multiplex_send_string(Multiplex * c, unsigned char channelId, char const * str);
// -- select channel; returns the channel ID (>= 0) or a status code (< 0)
int multiplex_select(Multiplex * c, int timeoutMs);
// -- receive data with timeout
int multiplex_receive(Multiplex * c, int timeoutMs, unsigned char channelId, char * dst, int offset, int length);
// -- get length of channel buffer
int multiplex_length(Multiplex * c, unsigned char channelId);
// -- get length of data received in last select
int multiplex_last_received(Multiplex * c, unsigned char channelId);
// -- get channel buffer
char const * multiplex_get(Multiplex * c, unsigned char channelId);
// -- create copy of (part of) channel buffer
char * multiplex_strdup(Multiplex * c, unsigned char channelId);
// -- write to/read from channel buffer
void multiplex_write(Multiplex * c, unsigned char channelId, char * data, int offset, int length);
int multiplex_read(Multiplex * c, unsigned char channelId, char * dst, int offset, int length);
int multiplex_copy(Multiplex * c, unsigned char channelId, char * dst, int offset, int length);
// -- clear buffer
void multiplex_clear(Multiplex * c, unsigned char channelId);
// -- remove select status, keep data
void multiplex_ignore(Multiplex * c, unsigned char channelId);
#endif
|
c92ebfef3ad9a87d8aaa809512c969019f59eec0
|
65f9576021285bc1f9e52cc21e2d49547ba77376
|
/LINUX/android/vendor/qcom/proprietary/mm-audio/qsthw_api/qsthw_defs.h
|
415f321e76a6ddd953d8cf2a31f745d1ac129e08
|
[
"Apache-2.0"
] |
permissive
|
AVCHD/qcs605_root_qcom
|
183d7a16e2f9fddc9df94df9532cbce661fbf6eb
|
44af08aa9a60c6ca724c8d7abf04af54d4136ccb
|
refs/heads/main
| 2023-03-18T21:54:11.234776 | 2021-02-26T11:03:59 | 2021-02-26T11:03:59 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,646 |
h
|
qsthw_defs.h
|
/* qsthw_defs.h
*
* Copyright (c) 2016-2017 Qualcomm Technologies, Inc.
* All Rights Reserved.
* Confidential and Proprietary - Qualcomm Technologies, Inc.
*
*/
#include <system/sound_trigger.h>
#ifndef QTI_ST_HW_DEFS_H
#define QTI_ST_HW_DEFS_H
/*
* Below are the parameter definitions that are used by ST HAL and
* qti ST HAL wrapper client.
*/
/* sound trigger recognition event type */
typedef enum {
QSTHW_RC_EVENT_TYPE_NON_TIMESTAMP = 0,
QSTHW_RC_EVENT_TYPE_TIMESTAMP = 1
} qsthw_recognition_event_type_t;
/*
* QTI enhanced recognition event with detection timestamp
*/
struct qsthw_phrase_recognition_event {
struct sound_trigger_phrase_recognition_event phrase_event; /* key phrase recognition event */
uint64_t timestamp; /* event time stamp */
};
struct qsthw_source_tracking_param
{
int target_angle_L16[2];
int interf_angle_L16[2];
char polarActivityGUI[360];
};
struct qsthw_target_channel_index_param
{
int target_chan_idx;
};
typedef union {
struct qsthw_source_tracking_param st_params;
struct qsthw_target_channel_index_param ch_index_params;
} qsthw_get_param_payload_t;
/* sound trigger set parameter keys */
#define QSTHW_PARAMETER_CUSTOM_CHANNEL_MIXING "st_custom_channel_mixing"
#define QSTHW_PARAMETER_SESSION_PAUSE "st_session_pause"
#define QSTHW_PARAMETER_BAD_MIC_CHANNEL_INDEX "st_bad_mic_channel_index"
#define QSTHW_PARAMETER_DIRECTION_OF_ARRIVAL "st_direction_of_arrival"
#define QSTHW_PARAMETER_CHANNEL_INDEX "st_channel_index"
#define QSTHW_PARAMETER_EC_REF_DEVICE "st_ec_ref_device"
#endif //QTI_ST_HW_DEFS_H
|
56567a2907654e6e13f299bb0787dc04db9502b7
|
e247fb4542d57d81e0cf8a750f5020e9e247028a
|
/CS/311/project3/extract.h
|
8b62844c9260f6ada1c959396ac0c39999b41154
|
[] |
no_license
|
rlphillipsiii/oregonstate
|
9bef7d236cb568f6abd74ce24a632552eee24625
|
12ff94bfa6859dd45b9008fef45e0cd77dc9921b
|
refs/heads/master
| 2021-01-13T01:57:44.791495 | 2017-07-01T05:51:45 | 2017-07-01T05:51:45 | 24,665,671 | 0 | 1 | null | null | null | null |
UTF-8
|
C
| false | false | 361 |
h
|
extract.h
|
#include <unistd.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include "read.h"
#include "write.h"
int cmp_hdr_name(struct ar_hdr *hdr, char *name);
int extract(int a_fd, char *name, struct ar_hdr *hdr);
int delete_files(char *aname, char **files, int count);
int extract_files(char *aname, char **names, int count);
|
986fe8f11562f6579772157580e81e45eee79c12
|
e65a4dbfbfb0e54e59787ba7741efee12f7687f3
|
/audio/s3mod/files/patch-main.h
|
048263ffdbde12db3b27834fb21dc509465a4e7a
|
[
"BSD-2-Clause"
] |
permissive
|
freebsd/freebsd-ports
|
86f2e89d43913412c4f6b2be3e255bc0945eac12
|
605a2983f245ac63f5420e023e7dce56898ad801
|
refs/heads/main
| 2023-08-30T21:46:28.720924 | 2023-08-30T19:33:44 | 2023-08-30T19:33:44 | 1,803,961 | 916 | 918 |
NOASSERTION
| 2023-09-08T04:06:26 | 2011-05-26T11:15:35 | null |
UTF-8
|
C
| false | false | 238 |
h
|
patch-main.h
|
--- main.h.orig 1995-10-21 06:56:32 UTC
+++ main.h
@@ -43,7 +43,7 @@ extern uint32 mixspeed;
void help(void);
void get_audio_device(void);
-void main(int argc, char **argv);
+int main(int argc, char **argv);
#endif /* _MAIN_H */
|
cd05631557e53c7b0d76a0e5db4185255ed7524d
|
ccbe041a107c2e04b2bd33dc8f6e1ffd1204f607
|
/ft_toupper.c
|
255fd65b47636ebd9cf3416bc63903161e2b2331
|
[] |
no_license
|
vikagabriel/Libftall
|
8fd60ac24f2ccbfb5574748e12e02a3b0e711f4c
|
aa28b68d423040d10e868b9e68effe94c479a0f7
|
refs/heads/master
| 2023-03-25T14:45:12.028037 | 2021-03-22T13:36:27 | 2021-03-22T13:36:27 | 350,355,650 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 981 |
c
|
ft_toupper.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_toupper.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: vgabriel <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/03/15 17:14:07 by vgabriel #+# #+# */
/* Updated: 2021/03/16 16:58:36 by vgabriel ### ########.fr */
/* */
/* ************************************************************************** */
int ft_toupper(int c)
{
if (c >= 97 && c <= 122)
return (c - 97 + 65);
return (c);
}
|
cd2b8d693ff7960d35bbab09a93cadb97c1968ec
|
5cdd92d48a4c9a9c2c26ae26c15684683749784e
|
/TP 2/ArrayEmployees.c
|
6c27f50d09d9a8a2d30a842adfadebd192bcfe70
|
[] |
no_license
|
Mazzu98/tp_laboratorio_1
|
b4071c31434b47b60cfd00b0824d626f42ff6c3d
|
e565c8d7eb024cbd1a8124a7e3edf358965d99d8
|
refs/heads/master
| 2021-05-21T22:45:06.927305 | 2020-06-30T22:01:22 | 2020-06-30T22:01:22 | 252,840,292 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 8,893 |
c
|
ArrayEmployees.c
|
#include "ArrayEmployees.h"
#define STR_TAM 51
int initEmployees(Employee list[], int len)
{
int i;
for(i=0;i<len;i++)
{
list[i].isEmpty = 1;
list[i].id = 0;
}
return 0;
}
int addEmployee(Employee list[], int len, int id, char name[],char lastName[],float salary,int sector)
{
int index;
index = getEmptyPosition(list,len);
if(index != -1 )
{
list[index].id = id;
strcpy(list[index].name,name);
strcpy(list[index].lastName,lastName);
list[index].salary = salary;
list[index].sector = sector;
list[index].isEmpty = 0;
return 0;
}
else
{
return -1;
}
return -1;
}
int nuevoEmpleado(Employee list[],int len)
{
int id,sector,retorno = -1;
float salario;
char nombre[STR_TAM],apellido[STR_TAM];
if(getEmptyPosition(list,len) != -1)
{
id = newId(list,len);
getStringLetras("\nIngresar nombre: ",nombre);
getStringLetras("\nIngresar apellido: ",apellido);
salario = getFloat("\nIngresar salario: ");
sector = getInt("\nIngresar sector: ");
retorno = addEmployee(list, len, id, nombre,apellido,salario, sector);
}
return retorno;
}
int findEmployeeById(Employee list[], int len,int id)
{
int i, index = -1;
for(i=0;i<len;i++)
{
if(list[i].isEmpty == 0 && list[i].id == id)
{
index = i;
break;
}
}
return index;
}
int removeEmployee(Employee list[], int len, int id)
{
int index;
index = findEmployeeById(list,len,id);
if(index != -1)
{
list[index].isEmpty = 1;
return 0;
}
else
{
return -1;
}
}
int sortEmployees(Employee list[], int len, int order) //2 mayor a menor, 1 menor a mayor
{
Employee aux;
int i,j;
if(order == 0) //menor a mayor
{
for(i=0;i<len;i++)
{
for(j=i+1;j<len-1;j++)
{
if(strcmp(list[i].lastName,list[j].lastName) > 0)
{
aux = list[i];
list[i] = list[j];
list[j] = aux;
}
if(strcmp(list[i].lastName,list[j].lastName) == 0 && list[i].sector > list[j].sector)
{
aux = list[i];
list[i] = list[j];
list[j] = aux;
}
}
}
}
if(order == 1) //mayor a menor
{
for(i=0;i<len;i++)
{
for(j=i+1;j<len-1;j++)
{
if(strcmp(list[i].lastName,list[j].lastName) > 0)
{
aux = list[i];
list[i] = list[j];
list[j] = aux;
}
if(strcmp(list[i].lastName,list[j].lastName) == 0 && list[i].sector < list[j].sector)
{
aux = list[i];
list[i] = list[j];
list[j] = aux;
}
}
}
}
return 0;
}
int printEmployees(Employee list[], int length)
{
int i,cantSupProm,cantEmpleados;
float totalSalary,promSalary;
printf("\n ID Nombre Apellido Salario Sector");
for(i=0;i<length;i++)
{
if(list[i].isEmpty == 0)
{
printf("\n %5d %15s %20s \t%12.2f %10d",list[i].id,list[i].name,list[i].lastName,list[i].salary,list[i].sector);
}
}
printf("\n\n");
cantEmpleados = cantEmployees(list,length);
totalSalary = totalSalarios(list,length);
promSalary = promSalarios(totalSalary,cantEmpleados);
cantSupProm = empleadosPromSup(list,length,promSalary);
printf("Total de salarios: %.2f \nPromedio de salarios: %.2f \nCantidad de Empleados que cobran arriba del promedio: %d\n\n",totalSalary,promSalary,cantSupProm);
printf("Precione enter para continuar...\n");
getchar();
system("cls");
return 0;
}
int modificarEmployee(Employee list[],int tam)
{
int opcion,id,index;
id = getInt("\nIgrese el id de el empleado que modificara: ");
index = findEmployeeById(list,tam,id);
if(index != -1)
{
printf("\n\t1. Modificar nombre \n\t2. Modificar apellido \n\t3. Modificar salario \n\t4. Modificar sector\n");
opcion = getInt("\nIngrese una opcion: ");
switch(opcion)
{
case 1: modificarNombre(list,index);
break;
case 2: modificarApellido(list,index);
break;
case 3: modificarSalario(list,index);
break;
case 4: modificarSector(list,index);
break;
default:
printf("\n Error: opcion incorrecta");
}
return 0;
}
else
{
return index;
}
}
void modificarNombre(Employee list[],int index)
{
char string[51];
getStringLetras("Ingrese el nuevo nombre: ",string);
strcpy(list[index].name,string);
}
void modificarApellido(Employee list[],int index)
{
char string[51];
getStringLetras("Ingrese el nuevo apellido: ",string);
strcpy(list[index].lastName,string);
}
void modificarSalario(Employee list[],int index)
{
float salario;
salario = getFloat("Ingrese el nuevo salario: ");
list[index].salary = salario;
}
void modificarSector(Employee list[],int index)
{
int sector;
sector = getInt("Ingrese el nuevo sector: ");
list[index].sector = sector;
}
float totalSalarios(Employee list[],int tam)
{
int i;
float total = 0;
for(i=0;i<tam;i++)
{
if(list[i].isEmpty == 0)
{
total += list[i].salary;
}
}
return total;
}
float promSalarios(float total,int cant)
{
float prom;
prom = total/cant;
return prom;
}
int empleadosPromSup(Employee list[],int tam,float prom)
{
int i,cant = 0;
for(i=0;i<tam;i++)
{
if(list[i].isEmpty == 0 && list[i].salary > prom)
{
cant ++;
}
}
return cant;
}
int cantEmployees(Employee list[],int tam)
{
int i,cant = 0;
for(i=0;i<tam;i++)
{
if(list[i].isEmpty == 0)
{
cant++;
}
}
return cant;
}
int newId(Employee list[],int len)
{
int i, maxId = 0;
for(i=0;i<len;i++)
{
if(list[i].id > maxId)
{
maxId = list[i].id;
}
}
maxId++;
return maxId;
}
int getInt(char text[])
{
char num[11];
do{
puts(text);
fflush(stdin);
gets(num);
}while(!validarInt(num));
return atoi(num);
}
int validarInt(char string[])
{
int i,validacion = 1;
for(i=0;i<strlen(string);i++)
{
if(string[i]<48 || string[i]>57)
{
validacion = 0;
break;
}
}
if(validacion == 0)
{
printf("\nError: debe ingresar un numero entero\n\n");
}
return validacion;
}
void getStringLetras(char text[],char string[])
{
int i;
do{
fflush(stdin);
puts(text);
gets(string);
}while(!validarStringLetras(string));
for(i=0;i<strlen(string);i++)
{
if(i==0 || (i-1) == ' ')
{
string[i] -= 32;
}
}
}
int validarStringLetras(char string[])
{
int i,validacion = 1;
strlwr(string);
for(i=0;i<strlen(string);i++)
{
if(string[i]<97 || string[i]>122)
{
validacion = 0;
break;
}
}
if(validacion == 0)
{
printf("\nError: este campo debe poseer solo letras, intente de nuevo...\n\n");
}
return validacion;
}
float getFloat(char text[])
{
char string[20];
float num;
do{
puts(text);
fflush(stdin);
gets(string);
}while(!validacionFloat(string));
num = atof(string);
return num;
}
int validacionFloat(char string[])
{
int i,puntosCont = 0, validacion = 1;
for(i=0;i<strlen(string);i++)
{
if(string[i] == '.')
{
puntosCont++;
}
else if(string[i] < 48 || string[i] > 57)
{
validacion = 0;
break;
}
}
if(puntosCont>1)
{
validacion = 0;
}
if(validacion == 0)
{
printf("\nError: debe ingresar el valor decimal correctamente\n\n");
}
return validacion;
}
int getEmptyPosition(Employee list[],int tam)
{
int i, index = -1;
for(i=0;i<tam;i++)
{
if(list[i].isEmpty == 1)
{
index = i;
break;
}
}
return index;
}
void printMainMenu()
{
printf("\n1) Dar de alta ");
printf("\n2) Modificar empleado ");
printf("\n3) Dar de baja ");
printf("\n4) Informar");
printf("\n5) Salir\n\n");
}
|
cbcb524a3ed8c74cf8c1126ac033fb76664829ca
|
0f0654f50626d44e28143b441540112266019bb2
|
/src/defines.h
|
d689f065f5173e811f147c8deccdce7fe24b4af1
|
[] |
no_license
|
lishi0927/2DTreeGenerator
|
73a665e4404baa8349e5d5addeb83e43e1300a73
|
76697831abf2cc9d84a6fbf5f56feec0c4d0e4e5
|
refs/heads/master
| 2021-01-12T02:49:31.547666 | 2012-04-08T22:08:54 | 2012-04-08T22:08:54 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 707 |
h
|
defines.h
|
/*
* Created on January 8, 2012, 9:49 PM
* By Laurent Victorino < laurent.victorino@gmail.com >
*/
#ifndef DEFINES_H
#define DEFINES_H
#define SCREEN_W 640
#define SCREEN_H 480
#define SCREEN_TITLE "2D Tree Generator"
#define ATTRACTPOINT_NUMBER 1000 // per crown
#define ATTRACTPOINT_RADIUS 200
#define ATTRACTPOINT_KILLDISTANCE 20
#define ATTRACTPOINT_SIZE 5
#define ATTRACTPOINT_GLCOLOR 255, 255, 255
#define TREENODE_SIZE 6
#define TREENODE_GLCOLOR 255, 0, 0
#define TREESEGMENT_GLCOLOR 0,255,0
#define TREENODE_LENGTH 10
#define TICK_INTERVAL 10
#endif /* DEFINES_H */
|
f9e598c2b6303df44e13d45979e68e152be34a2f
|
cecbadf6e190f029d01fc0e17e0203d9d8a68cef
|
/Listas/Lista4/1.c
|
d73f5c25c480d35a996492edcc2343d954999f57
|
[] |
no_license
|
KalebeLopes/Estrutura-de-Dados-C
|
ee7b543d0748c53815a196408ef39b86091c47d2
|
c409ba285682d8886a0442aab82282ca968b368a
|
refs/heads/master
| 2022-04-04T19:51:35.672823 | 2020-02-14T02:46:51 | 2020-02-14T02:46:51 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 265 |
c
|
1.c
|
#include <stdio.h>
int insere(){
}
int main(){
struct lista{
int tam, qtd;
char pe;
struct lista *proximo;
};
int n = 0 ;
while (n != EOF){
scanf("%d", &n);
printf("%d\n", n);
}
return 0;
}
|
b4e759ac2ed552b8ec8526803a4fbe6712443ad1
|
b356adc9bd515d919edcdda9b2aceded1b7dc905
|
/drivers/misc/mediatek/pmic/include/mt6353/mt_regulator_codegen.h
|
dbf6639982a568402c523deaaa088441f89990d1
|
[] |
no_license
|
wisen/tiny_kernel_comment
|
ca57b10a4df8eef989435ac5974fae5df0f1cc20
|
3401fe62392c62f735fc6dac1d96c51cca44d249
|
refs/heads/master
| 2020-03-17T21:48:36.830903 | 2018-11-05T16:52:57 | 2018-11-05T16:52:57 | 133,976,587 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,746 |
h
|
mt_regulator_codegen.h
|
/*
* Copyright (C) 2015 MediaTek Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#ifndef _MT_REGULATOR_CODEGEN_H_
#define _MT_REGULATOR_CODEGEN_H_
/* -------Code Gen Start-------*/
/* Non regular voltage regulator */
#define NON_REGULAR_VOLTAGE_REGULATOR_GEN(_name, _id, _type, array, mode, use, en, vol) \
{ \
.desc = { \
.name = #_name, \
.n_voltages = (sizeof(array)/sizeof(array[0])), \
.ops = &pmic_##_type##_##_name##_ops, \
.type = REGULATOR_VOLTAGE, \
}, \
.init_data = { \
.constraints = { \
.valid_ops_mask = (mode), \
}, \
}, \
.pvoltages = (void *)(array), \
.en_att = __ATTR(LDO_##_id##_STATUS, 0664, show_LDO_STATUS, store_LDO_STATUS), \
.voltage_att = __ATTR(LDO_##_id##_VOLTAGE, 0664, show_LDO_VOLTAGE, store_LDO_VOLTAGE), \
.en_reg = (PMU_FLAGS_LIST_ENUM)(en), \
.vol_reg = (PMU_FLAGS_LIST_ENUM)(vol), \
.isUsedable = (use), \
}
/* Regular voltage regulator */
#define REGULAR_VOLTAGE_REGULATOR_GEN(_name, _id, _type, min, max, step, min_sel, mode, use, en, vol) \
{ \
.desc = { \
.name = #_name, \
.n_voltages = ((max) - (min)) / (step) + 1, \
.ops = &pmic_##_type##_##_name##_ops, \
.type = REGULATOR_VOLTAGE, \
.min_uV = (min), \
.uV_step = (step), \
.linear_min_sel = min_sel, \
}, \
.init_data = { \
.constraints = { \
.valid_ops_mask = (mode), \
}, \
}, \
.en_att = __ATTR(LDO_##_id##_STATUS, 0664, show_LDO_STATUS, store_LDO_STATUS), \
.voltage_att = __ATTR(LDO_##_id##_VOLTAGE, 0664, show_LDO_VOLTAGE, store_LDO_VOLTAGE), \
.en_reg = (PMU_FLAGS_LIST_ENUM)(en), \
.vol_reg = (PMU_FLAGS_LIST_ENUM)(vol), \
.isUsedable = (use), \
}
/* Fixed voltage regulator */
#define FIXED_REGULAR_VOLTAGE_REGULATOR_GEN(_name, _id, _type, array, mode, use, en) \
{ \
.desc = { \
.name = #_name, \
.n_voltages = 1, \
.ops = &pmic_##_type##_##_name##_ops, \
.type = REGULATOR_VOLTAGE, \
}, \
.init_data = { \
.constraints = { \
.valid_ops_mask = (mode), \
}, \
}, \
.pvoltages = (void *)(array), \
.en_att = __ATTR(LDO_##_id##_STATUS, 0664, show_LDO_STATUS, store_LDO_STATUS), \
.voltage_att = __ATTR(LDO_##_id##_VOLTAGE, 0664, show_LDO_VOLTAGE, store_LDO_VOLTAGE), \
.en_reg = (PMU_FLAGS_LIST_ENUM)(en), \
.isUsedable = (use), \
}
#endif /* _MT_REGULATOR_CODEGEN_H_ */
|
68a12272cb53a93649665b2bc5ea1d42f1a3a417
|
4425e665c8c8a97e204357662837d26ac859e9c1
|
/a1200/system/hardware.h
|
298c4ec0e00bdc5e64acb416b2737e695b8b5e8d
|
[] |
no_license
|
argasek/morphine
|
7f92dce05d544cd31067eb6bd9f2fca0bf99bbb1
|
7aed42066ff005b89ca8c382a17440ddb0fa5ff1
|
refs/heads/master
| 2020-12-24T16:41:47.551250 | 2015-04-14T22:48:01 | 2015-04-14T22:48:01 | 12,846,519 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 437 |
h
|
hardware.h
|
#ifndef __SYSTEM_HARDWARE_H__
#define __SYSTEM_HARDWARE_H__
#include <hardware/cia.h>
#include <hardware/custom.h>
#include <hardware/dmabits.h>
#include <hardware/intbits.h>
#define INTF_LEVEL3 (INTF_VERTB | INTF_BLIT | INTF_COPER)
#define INTF_LEVEL4 (INTF_AUD0 | INTF_AUD1 | INTF_AUD2 | INTF_AUD3)
extern volatile struct Custom* const custom;
extern volatile struct CIA* const ciaa;
extern volatile struct CIA* const ciab;
#endif
|
047bdb88d7aa7965eaa38e4bf3e987122cbf6616
|
eb1bc34bb8c3ef1dbdd8da7ed03627f215744101
|
/src/libs/parser/parser_leader.c
|
e63721986158177293a776f1fe0241f7862c3023
|
[] |
no_license
|
tinchotricolor22/SSL-TP-Bolsar
|
b531d5319e899dbe56918a0da49324cdc14f4fdf
|
eb76cf8366cec350630e8ef21161761676c151f0
|
refs/heads/master
| 2020-07-06T00:00:01.109391 | 2019-08-30T21:27:57 | 2019-08-30T21:27:57 | 202,823,433 | 0 | 1 | null | 2019-08-26T00:41:58 | 2019-08-17T02:03:31 |
HTML
|
UTF-8
|
C
| false | false | 3,718 |
c
|
parser_leader.c
|
#include "parser.h"
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#include "../utils/commons.h"
#define TOTAL_COLUMNS 16
#define COLUMN_SPECIE 0
#define COLUMN_VARIATION 7
#define COLUMN_PURCHASE_PRICE 3
#define COLUMN_SALE_PRICE 4
#define COLUMN_OPENING_PRICE 8
#define COLUMN_MAX_PRICE 9
#define COLUMN_MIN_PRICE 10
#define LEADERS_MAX_LENGTH 1000
#define TABLE_OPENING_TAG "<table border=\"1\">"
#define TABLE_CLOSING_TAG "</table>"
#define COMPONENT_OPENING_TAG "<td>"
#define COMPONENT_CLOSING_TAG "</td>"
//apply_conditions return true if leader apply all conditions in list
static int apply_conditions(Filter **filters_list, const int filters_list_length, const Leader *leader) {
parser_debug_logger("Appliyng conditions to leader specie: %s[event:apply_conditions]", leader->specie);
for (int i = 0; i < filters_list_length; i++) {
Filter filter = filters_list[i];
if (!filter(leader)) {
return 0;
}
}
return 1;
}
//fill_leaders_from_tags return fills leaders list depending of the tags and patterns in arguments
static void fill_leaders_from_tags(char tags_list[TAGS_MAX_LENGTH][TAG_CHAR_MAX_LENGTH], const int tags_list_length, Leader **leaders_list, int *leaders_list_length,
const Filter **filters_list, const int filters_list_length) {
parser_debug_logger("Filling leaders list from tags list [event:fill_leaders_from_tags]");
char column[TOTAL_COLUMNS][50];
for (int count_tags = 1; count_tags < tags_list_length; count_tags++) {
Leader *new_leader = malloc(sizeof *new_leader);
trim(tags_list[count_tags], tags_list[count_tags]);
sscanf(tags_list[count_tags], "%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;];%[^;]", column[0], column[1], column[2], column[3], column[4], column[5], column[6], column[7], column[8], column[9], column[10], column[11], column[12], column[13], column[14], column[15]);
strcpy(new_leader->specie, column[COLUMN_SPECIE]);
new_leader->variation = extract_double_value(column[COLUMN_VARIATION]);
new_leader->purchase_price = extract_double_value(column[COLUMN_PURCHASE_PRICE]);
new_leader->sale_price = extract_double_value(column[COLUMN_SALE_PRICE]);
new_leader->opening_price = extract_double_value(column[COLUMN_OPENING_PRICE]);
new_leader->max_price = extract_double_value(column[COLUMN_MAX_PRICE]);
new_leader->min_price = extract_double_value(column[COLUMN_MIN_PRICE]);
if (apply_conditions(filters_list, filters_list_length, new_leader)) {
add(leaders_list, new_leader, leaders_list_length, LEADERS_MAX_LENGTH);
}
}
}
ParserResult parse_data_from_html(ParserOutput **data_list, ParserInput *parser_input) {
parser_debug_logger("Parsing data from html to fills leaders and return parser output [event:parse_data_from_html]");
char tags_list[TAGS_MAX_LENGTH][TAG_CHAR_MAX_LENGTH];
int tags_list_length = 0;
parse_table_from_html_file(parser_input->file, tags_list, &tags_list_length,
TAGS_MAX_LENGTH, TABLE_OPENING_TAG, TABLE_CLOSING_TAG, COMPONENT_OPENING_TAG, COMPONENT_CLOSING_TAG);
Leader **leaders_list = malloc(LEADERS_MAX_LENGTH * sizeof leaders_list[0]);
int leaders_list_length = 0;
fill_leaders_from_tags(tags_list, tags_list_length, leaders_list, &leaders_list_length, parser_input->filters_list, parser_input->filters_list_length);
parser_debug_logger("Creating parser output [event:parse_data_from_html]");
*data_list = create_parser_output(leaders_list, leaders_list_length);
return PARSER_RESULT_OK;
}
|
7734de7b1dddbdd044b4fa2e01440b65d67c7f8e
|
22bb77f99c11c2c8ac246158a2abe3ee9d72ad10
|
/0x15-file_io/0-read_textfile.c
|
98cd36f57603fe02e51d35d005a96c4239752245
|
[] |
no_license
|
medjbelii/holbertonschool-low_level_programming
|
482d8d7dee9ab408d0dbea46e43c98bbb71a61f6
|
977450850c46fcf9bb33e05ff33322e54393e8fb
|
refs/heads/main
| 2023-04-10T02:07:18.945264 | 2021-04-27T21:03:24 | 2021-04-27T21:03:24 | 336,231,653 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 571 |
c
|
0-read_textfile.c
|
#include "holberton.h"
/**
* read_textfile - Read
*
* @filename: file
* @letters: letter
*
* Return: Read
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
int x;
ssize_t size, size2;
char *buff;
buff = malloc(sizeof(char) * letters);
if (filename == NULL)
return (0);
x = open(filename, O_RDONLY);
if (x == -1)
return (0);
size = read(x, buff, letters);
if (size == -1)
return (0);
*(buff + size) = '\0';
size2 = write(STDOUT_FILENO, buff, size);
if (size2 == -1 || size2 != size)
return (0);
close(x);
return (size2);
}
|
cd2fc5f3063de3eba60ff7f3f79725737db40b8b
|
c3716b9cdc105facc09eb960e4b8ce77febd7cbf
|
/CN1/function.c
|
4b4450ef7413f12fabcaa4a5bb122268753bb347
|
[] |
no_license
|
Nguyen-Duc-Cong/C
|
d6e0e145a9c1e4b922b29a21bf9cb9b98269a1e4
|
d8284d4e925a0e65a9c3cb6b04bfc0159a4ded32
|
refs/heads/master
| 2020-12-10T07:09:56.595914 | 2020-03-06T04:40:17 | 2020-03-06T04:40:17 | 233,531,899 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 297 |
c
|
function.c
|
#include<stdio.h>
int fl(int n);
int main()
{
//int n,k;
scanf("%d%d",&n,&k);
float c;
c = fl(n)/(fl(k)*fl(n-k));
printf("%.4f",c);
getchar();
getchar();
return 0;
}
int fl(int n)
{
int T,i;
T = 1;
for(i = 1;i <= n; i++)
T *= i;
return T;
}
|
8fe55a45868c84b3ef94e7e6e3abcf54e45919ab
|
da337e33aa4a909bf14f1e9c706663ecd8fb9656
|
/Practica1/producer/producer.c
|
07bee349b932c2118aa8963759542f7e87f1219d
|
[] |
no_license
|
Fabricio-Jose/Sistemas_Operativos
|
a645202e419def4d7ca66ac4891135221e5248cb
|
d2a6d745eea70401cf87aab45afa05d3e4ff2b4c
|
refs/heads/main
| 2023-02-15T03:42:51.119661 | 2021-01-12T01:23:59 | 2021-01-12T01:23:59 | 328,836,973 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 3,178 |
c
|
producer.c
|
/**
* Simple program demonstrating shared memory in POSIX systems.
*
* This is the producer process that writes to the shared memory region.
*
* Figure 3.16
*
* To compile, enter
* gcc shm-posix-producer.c -lrt
*
* @author Silberschatz, Galvin, and Gagne
* Operating System Concepts - Tenth Edition
* Copyright John Wiley & Sons - 2018
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <sys/shm.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <sys/types.h>
#include <time.h>
#include <stdbool.h>
#include <sys/time.h>
#include <signal.h>
#include <string.h>
#include <time.h>
#include <sys/types.h>
#include <sys/wait.h>
#define BUFFER_SIZE 10000
typedef struct region{
int in;
int buffer[BUFFER_SIZE];
}estructura;
int main()
{
time_t tiempo = time(0);
struct tm *tlocal = localtime(&tiempo);
char output[128];
strftime(output,128,"%d/%m/%y %H:%M:%S",tlocal);
int out = 0;
pid_t pid;
pid_t padre;
int pidP;
int duration;
const char *name = "OS";
estructura *rptr;
int fd;
fd = shm_open(name, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR);//0666);
if (fd == -1) {
printf("shared memory failed\n");
exit(-1);
}
if(ftruncate(fd, sizeof(struct region))==-1){
printf("struct failed\n");
return -1;
}
rptr = mmap(NULL,sizeof(struct region),PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
if (rptr == MAP_FAILED) {
printf("Map failed\n");
return -1;
}
rptr->in=0;
padre = getpid();
//printf("Referencia: %d \n", pidP);
while(1){
pid = fork();
//pidP = getpid();
sleep(5);
/*if(pid==0){
sleep(5);
while (((rptr->in+1)%BUFFER_SIZE) == out) ;
rptr->buffer[rptr->in] = pid;
printf("[%s] P(%d): Creando Proceso %d (hora)\n", output, padre,rptr->buffer[rptr->in]);
sleep(5);
rptr->in = (rptr->in+1)%BUFFER_SIZE;
}else{
sleep(5);
while (((rptr->in+1)%BUFFER_SIZE) == out) /* do nothing! ;
rptr->buffer[rptr->in] = pid;
printf("[%s] P(%d): Creando Proceso %d (hora)\n", output, padre,rptr->buffer[rptr->in]);
sleep(5);
rptr->in = (rptr->in+1)%BUFFER_SIZE;
}*/
if(pid>0){
sleep(5);
while (((rptr->in+1)%BUFFER_SIZE) == out) /* do nothing! */ ;
rptr->buffer[rptr->in] = pid;
printf("[%s] P(%d): Creando Proceso %d (hora)\n", output, padre,rptr->buffer[rptr->in]);
sleep(5);
rptr->in = (rptr->in+1)%BUFFER_SIZE;
}else{
sleep(5);
while (((rptr->in+1)%BUFFER_SIZE) == out) /* do nothing! */ ;
rptr->buffer[rptr->in] = pid;
printf("[%s] P(%d): Creando Proceso %d (hora)\n", output, padre,rptr->buffer[rptr->in]);
sleep(5);
rptr->in = (rptr->in+1)%BUFFER_SIZE;
}
//sleep(0);
//shm_unlink(name); -< Cierra proceso en consumer
}
/* item next_produced;
printf("Struct PID = %d \n",getpid());
pidC=fork();
printf("Fork Father PID = %d , Son pidC=%d \n",getpid(),pidC);
*/
return 0;
}
|
4dd45af5ffe02a45b389a5388865ff74a91ae832
|
16a76ee66d9b2f59c9beee4a4a0e104ce347e32a
|
/from_decompile-it.com/elinks/ia32_elf_from_website/by_decompile-it.com/src/intl/gettext/localealias.c
|
268e2d6b8e2c82f4c7650743c519d5529a659ed4
|
[] |
no_license
|
rfalke/decompiler-subjects
|
4cee3263fa9116285b4bc4b6373efd2e4efa925f
|
7187fa93b285c32325826eecd0128e907a28809b
|
refs/heads/master
| 2023-08-10T08:24:27.198393 | 2023-07-28T19:44:41 | 2023-07-28T19:44:41 | 3,725,678 | 41 | 12 | null | 2023-03-15T16:14:41 | 2012-03-15T06:01:36 | null |
UTF-8
|
C
| false | false | 5,741 |
c
|
localealias.c
|
#include "localealias.c.h"
static unsigned char *string_space;
static size_t string_space_act;
static size_t string_space_max;
static struct alias_map *map;
static size_t nmap;
static size_t maxmap;
unsigned char *_nl_expand_alias( unsigned char *name )
{
int eax;
int edx;
static unsigned char *locale_alias_path = "/usr/share/locale";
unsigned char *result;
size_t added;
{
struct alias_map item;
do
{
nmap = nmap;
item.alias = &name[0];
if ( nmap && bsearch( item.alias, map, nmap, 8, &alias_compare ) )
{
break;
}
if ( locale_alias_path[0] )
{
do
{
{
while ( locale_alias_path[0] != ':' )
{
if ( start[0] & 255 )
{
do
{
start[0] = start[1];
}
while ( start[0] != ':' && ( start[0] & 255 ) );
start[0] = start[0];
}
if ( start[0] <= start[0] )
{
if ( start[0] == 0 )
locale_alias_path = &start[0];
else
{
edi = start[0];
}
}
else
{
locale_alias_path = &start[0];
if ( added )
{
do
{
nmap = nmap;
item.alias = &name[0];
}
while ( added );
if ( locale_alias_path[0] )
{
do
{
{
while ( locale_alias_path[0] != ':' )
{
}
do
{
start[0] = start[1];
}
while ( start[0] == ':' );
start[0] = start[0];
}
}
while ( locale_alias_path[0] == 0 );
}
else
}
}
}
do
{
start[0] = start[1];
}
while ( start[0] == ':' );
}
}
while ( locale_alias_path[0] == 0 );
}
result[0] = 0;
break;
}
while ( added );
}
}
size_t read_alias_file( unsigned char *fname, int fname_len )
{
int ecx;
FILE *fp;
size_t added;
*(int*)(mempcpy( mem_alloc( fname_len + 14 ), &fname[0], fname_len )) = 0x636f6c2f;
*(int*)(mempcpy( mem_alloc( fname_len + 14 ), &fname[0], fname_len ) + 4) = 0x2e656c61;
*(int*)(mempcpy( mem_alloc( fname_len + 14 ), &fname[0], fname_len ) + 8) = 0x61696c61;
*(short*)(mempcpy( mem_alloc( fname_len + 14 ), &fname[0], fname_len ) + 12) = 115;
fp = fopen64( *ebp_16472, "rb" );
mem_free( *ebp_16472 );
added = 0;
if ( fp[0]._flags )
{
while ( !( ( fp->_flags/*.1_1of4*/ & 16 ) & 255 ) && fgets_unlocked( buf, 8192, &fp[0] ) )
{
if ( strchr( buf, 10 ) == 0 )
{
do
{
}
while ( !fgets_unlocked( ebp_16412, 8192, &fp[0] ) || strchr( ebp_16412, 10 ) );
}
{
unsigned char altbuf[8192];
cp[0] = buf[0];
if ( cp[0] == '#' || ( cp[0] & 255 ) == 0 )
continue;
else
{
cp[0] = cp[0] + 1;
if ( cp[1] )
{
cp[0] = 0;
cp[0] = cp[1];
}
else
cp[0] = cp[0];
if ( ( cp[0] & 255 ) == 0 )
continue;
else
{
size_t alias_len;
size_t value_len;
if ( cp[1] )
{
if ( cp[1] == 10 )
{
cp[1] = 0;
cp[1] = 10;
}
else
cp[1] = 0;
}
if ( maxmap <= nmap )
{
if ( realloc( map, 800 ? 800 << 4 : 800 ) )
{
map = (struct sgml_node_info*)realloc( map, 800 ? 800 << 4 : 800 );
maxmap = edx;
}
}
alias_len = strlen( &cp[0] ) + 1;
value_len = strlen( &cp[0] ) + 1;
if ( string_space_act + value_len + alias_len <= string_space_max )
{
}
else
{
size_t new_size = new_pool[ (unsigned char)( ( value_len + alias_len < 1024 ) ^ 1 ) ? 1024 : value_len + alias_len ];
unsigned char *new_pool = (unsigned char*)realloc( string_space, new_pool[ (unsigned char)( ( value_len + alias_len < 1024 ) ^ 1 ) ? 1024 : value_len + alias_len ] );
if ( new_pool )
{
if ( string_space == new_pool )
{
}
else
{
size_t i;
if ( nmap )
{
string_space[0] = new_pool - string_space;
i = 0;
do
{
map->string.length += new_pool - string_space;
map->string.string += new_pool - string_space;
i++;
}
while ( i + 1 < nmap );
}
else
{
}
}
string_space_max = new_size;
string_space = new_pool;
}
}
map->string.length = memcpy( string_space + added, &cp[0] );
string_space_act += ebp_16444;
map->string.string = (unsigned char*)memcpy( &string_space[ ebp_16444 + string_space_act ], &cp[0] );
string_space_act += ebp_16440;
nmap++;
added++;
}
}
}
}
fclose( &fp[0] );
if ( added )
qsort( map, nmap, 8, &alias_compare );
}
if ( 0 ^ 0 )
{
__stack_chk_fail( );
}
return added;
}
int alias_compare( struct alias_map *map1, struct alias_map *map2 )
{
map2 = &map2[0];
map1 = &map1[0];
}
#if 0
#endif
|
7622470477bf1cae0eb2c5f0e2c4f82c583a8e3b
|
7e34099853f87cbfd0ee69d8894d10eaf8e1df94
|
/implementations/group6/Milan2/src/EIFGENs/demo/W_code/C4/ws111d.c
|
4c0b3df6fc68210f754d85f1766612146b92af6c
|
[] |
no_license
|
Matias-Bernal/dose2014
|
cc1b973de8ba592ba82b2c8c8efd7749bcd3a033
|
139376fb884523cf5e0ccd7e9fed152555641a35
|
refs/heads/master
| 2016-09-06T03:51:44.566674 | 2014-12-24T14:49:10 | 2014-12-24T14:49:10 | 32,119,587 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,277 |
c
|
ws111d.c
|
/*
* Class WSF_DEFAULT_SERVICE
*/
#include "eif_macros.h"
#ifdef __cplusplus
extern "C" {
#endif
static EIF_TYPE_INDEX gen_type0_111 [] = {418,110,0xFFFF};
static EIF_TYPE_INDEX gen_type1_111 [] = {0,0xFFFF};
static EIF_TYPE_INDEX gen_type2_111 [] = {0,0xFFFF};
static EIF_TYPE_INDEX gen_type3_111 [] = {0,0xFFFF};
static EIF_TYPE_INDEX gen_type4_111 [] = {56,0xFFFF};
static struct desc_info desc_111[] = {
{(BODY_INDEX) -1, (BODY_INDEX) -1, INVALID_DTYPE, NULL},
{0, (BODY_INDEX)-1, 314, NULL},
{1, (BODY_INDEX)-1, 418, gen_type0_111},
{2, (BODY_INDEX)-1, 301, NULL},
{3, (BODY_INDEX)-1, 301, NULL},
{4, (BODY_INDEX)-1, 301, NULL},
{5, (BODY_INDEX)-1, 301, NULL},
{6, (BODY_INDEX)-1, 301, NULL},
{7, (BODY_INDEX)-1, 301, NULL},
{8, (BODY_INDEX)-1, 301, NULL},
{9, (BODY_INDEX)-1, 301, NULL},
{10, (BODY_INDEX)-1, 110, NULL},
{11, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{12, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{13, (BODY_INDEX)-1, 0, gen_type1_111},
{14, (BODY_INDEX)-1, 0, gen_type2_111},
{15, (BODY_INDEX)-1, 110, NULL},
{16, (BODY_INDEX)-1, 110, NULL},
{17, (BODY_INDEX)-1, 0, gen_type3_111},
{18, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{19, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{20, (BODY_INDEX)-1, 33, NULL},
{21, (BODY_INDEX)-1, 314, NULL},
{22, (BODY_INDEX)-1, 314, NULL},
{23, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{24, (BODY_INDEX)-1, 32, NULL},
{25, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{26, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{27, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{28, (BODY_INDEX)-1, 110, NULL},
{29, (BODY_INDEX)-1, 304, NULL},
{30, (BODY_INDEX)-1, 110, NULL},
{(BODY_INDEX)-1, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{1622, (BODY_INDEX)-1, 52, NULL},
{1627, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{1628, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{1629, 0, 284, NULL},
{1631, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{1630, (BODY_INDEX)-1, (EIF_TYPE_INDEX)-1, NULL},
{(BODY_INDEX)-1, (BODY_INDEX)-1, 56, gen_type4_111},
};
extern void Init111(void);
void Init111(void)
{
IDSC(desc_111, 0, 110);
IDSC(desc_111 + 1, 2, 110);
IDSC(desc_111 + 32, 305, 110);
IDSC(desc_111 + 34, 306, 110);
IDSC(desc_111 + 39, 172, 110);
}
#ifdef __cplusplus
}
#endif
|
02c74c9ca9327ff3878ae67ec55213de87e276da
|
cfe69fc556729bdecf2118fa5bc329343c42ed80
|
/10.0.10240.16384/ntoskrnl/Functions/PopSetHiberFileType.c
|
eb88c8a6ec7722930d35cff9c746da6a2e8ec6b3
|
[] |
no_license
|
Myprivateclonelibrary/W10M_unedited-decomp
|
8e5ec89a20e634ffc53457a40b0fd6d8a9e1757a
|
67b05851a3e262ff8a5d11ee50db34f28c350f16
|
refs/heads/main
| 2023-08-31T06:00:37.303105 | 2021-05-15T23:53:23 | 2021-05-15T23:53:23 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 763 |
c
|
PopSetHiberFileType.c
|
// PopSetHiberFileType
int __fastcall PopSetHiberFileType(int a1, __int64 *a2)
{
int v3; // r7
__int64 v4; // kr00_8
int v5; // r5
__int64 v7; // [sp+8h] [bp-28h] BYREF
char v8[32]; // [sp+10h] [bp-20h] BYREF
if ( (unsigned int)PopHiberFileSizePercent >= 0x28 && a1 != 2 || (unsigned int)(a1 - 1) > 1 )
return -1073741811;
v3 = PopHiberFileType;
PopHiberFileType = a1;
PopCalculateHiberFileSize(&v7, 0);
v4 = v7;
v5 = PopValidateHiberFileSize(v7, HIDWORD(v7), 0);
if ( v5 < 0
|| (v5 = PopOpenKey(&v7, L"Control\\Power"), v5 < 0)
|| (RtlInitUnicodeString((unsigned int)v8, L"HiberFileType"), v5 = ZwSetValueKey(), ZwClose(), v5 < 0) )
{
PopHiberFileType = v3;
}
else if ( a2 )
{
*a2 = v4;
}
return v5;
}
|
cce6dba92aa377d776914a548d5c58f4a95a0ad0
|
f1e759128bca609d37ce290f3331892e13fe8624
|
/interprocess_communication/ul_recv_msg.c
|
bb3361222f8ba36cf61ba10ba411070fe0ad758c
|
[] |
no_license
|
Cloudtree11/linux_c_programing
|
a68569218f36e7d16b5b3437c6267a84bb28cdcb
|
c2f43830c2bd9c58893f660af94586fea06062ec
|
refs/heads/master
| 2020-12-30T18:03:02.022851 | 2017-08-18T09:24:43 | 2017-08-18T09:24:43 | 90,946,611 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 779 |
c
|
ul_recv_msg.c
|
/*
* 消息队列 - 接收程序
*/
#include <sys/msg.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <stdio.h>
#include <string.h>
#include <sys/errno.h>
extern int errno;
struct mymsgbuf {
long mtype;
char ctext[100];
};
int main()
{
struct mymsgbuf buf;
int msid;
int ret;
if((msid = msgget(0x1000, 0666 | IPC_CREAT)) < 0) {
fprintf(stderr, "open msg %X failed.\n", 0x1000);
exit(1);
}
while(strncmp(buf.ctext, "exit", 4)) {
memset(&buf, 0, sizeof(buf));
while((ret = msgrcv(msid, &buf, sizeof(buf.ctext), 0, 0)) < 0) {
if(errno == EINTR) continue;
exit(1);
}
fprintf(stderr, "Msg: Tyoe=%d, Len=%d, Text:%s", buf.mtype, ret, buf.ctext);
}
if(msgctl(msid, IPC_RMID, NULL)) {
fprintf(stderr, "Delete msg failed.\n");
exit(1);
}
}
|
0f985d43a43f9cc32ec9ebeb81b7d9bc2ea5e4fc
|
cd3a466b2ca942ca1de9223105ea8250d873e83e
|
/STM32-M0_LIB/SYSTEM/sys.h
|
8614fe73f591fd7537e9584b63af46af876f3fa7
|
[] |
no_license
|
jasongwq/FINGERPRINT_ATTENDANCE
|
e7afee0fe74d416371d6e7e47f34dc62405d18c6
|
24959daa6bff7746142fb9d7bf7c2978d5381d6d
|
refs/heads/master
| 2021-01-01T20:35:13.559586 | 2014-10-21T11:26:33 | 2014-10-21T11:26:33 | 25,518,414 | 2 | 4 | null | null | null | null |
UTF-8
|
C
| false | false | 3,125 |
h
|
sys.h
|
#ifndef __SYS_H
#define __SYS_H
#include "stm32f0xx.h"
#include "stdint.h"
#include "SEGGER_RTT.h"
//0,不支持ucos
//1,支持ucos
#define SYSTEM_SUPPORT_UCOS 0 //定义系统文件夹是否支持UCOS
#define DEBUG 1
/*M0 内核 不具有 位带功能
//位带操作,实现51类似的GPIO控制功能
//具体实现思想,参考<<CM3权威指南>>第五章(87页~92页).
//IO口操作宏定义
#define BITBAND(addr, bitnum) ((addr & 0xF0000000)+0x2000000+((addr &0xFFFFF)<<5)+(bitnum<<2))
#define MEM_ADDR(addr) *((volatile unsigned long *)(addr))
#define BIT_ADDR(addr, bitnum) MEM_ADDR(BITBAND(addr, bitnum))
//IO口地址映射 +ODR 偏移地址
#define GPIOA_ODR_Addr (GPIOA_BASE+0x16) //0x4001080C
#define GPIOB_ODR_Addr (GPIOB_BASE+0x14) //0x40010C0C
#define GPIOC_ODR_Addr (GPIOC_BASE+0x16) //0x4001100C
#define GPIOD_ODR_Addr (GPIOD_BASE+0x16) //0x4001140C
#define GPIOE_ODR_Addr (GPIOE_BASE+0x16) //0x4001180C
#define GPIOF_ODR_Addr (GPIOF_BASE+0x16) //0x40011A0C
#define GPIOG_ODR_Addr (GPIOG_BASE+0x16) //0x40011E0C
#define GPIOA_IDR_Addr (GPIOA_BASE+0x10) //0x40010808
#define GPIOB_IDR_Addr (GPIOB_BASE+0x10) //0x40010C08
#define GPIOC_IDR_Addr (GPIOC_BASE+0x10) //0x40011008
#define GPIOD_IDR_Addr (GPIOD_BASE+0x10) //0x40011408
#define GPIOE_IDR_Addr (GPIOE_BASE+0x10) //0x40011808
#define GPIOF_IDR_Addr (GPIOF_BASE+0x10) //0x40011A08
#define GPIOG_IDR_Addr (GPIOG_BASE+0x10) //0x40011E08
//IO口操作,只对单一的IO口!
//确保n的值小于16!
#define PAout(n) BIT_ADDR(GPIOA_ODR_Addr,n) //输出
#define PAin(n) BIT_ADDR(GPIOA_IDR_Addr,n) //输入
#define PBout(n) BIT_ADDR(GPIOB_ODR_Addr,n) //输出
#define PBin(n) BIT_ADDR(GPIOB_IDR_Addr,n) //输入
#define PCout(n) BIT_ADDR(GPIOC_ODR_Addr,n) //输出
#define PCin(n) BIT_ADDR(GPIOC_IDR_Addr,n) //输入
#define PDout(n) BIT_ADDR(GPIOD_ODR_Addr,n) //输出
#define PDin(n) BIT_ADDR(GPIOD_IDR_Addr,n) //输入
#define PEout(n) BIT_ADDR(GPIOE_ODR_Addr,n) //输出
#define PEin(n) BIT_ADDR(GPIOE_IDR_Addr,n) //输入
#define PFout(n) BIT_ADDR(GPIOF_ODR_Addr,n) //输出
#define PFin(n) BIT_ADDR(GPIOF_IDR_Addr,n) //输入
#define PGout(n) BIT_ADDR(GPIOG_ODR_Addr,n) //输出
#define PGin(n) BIT_ADDR(GPIOG_IDR_Addr,n) //输入
*/
#define BYTE0(dwTemp) (* (char *)(&(dwTemp)))
#define BYTE1(dwTemp) (*((char *)(&(dwTemp)) + 1))
#define BYTE2(dwTemp) (*((char *)(&(dwTemp)) + 2))
#define BYTE3(dwTemp) (*((char *)(&(dwTemp)) + 3))
#define WORD0(dwTemp) (* (int16_t *)(&dwTemp))
#define WORD1(dwTemp) (*((int16_t *)(&dwTemp) + 1))
#define Set_Bit(Bety,n) ((Bety)|= (1<<(n)))
#define Clr_Bit(Bety,n) ((Bety)&=!(1<<(n)))
#define Read_Bit(Bety,n) (((Bety)>>(n))&(1))
//#define false FALSE
//#define true TRUE
//#define bool BOOL
//typedef enum{FALSE = -1,TRUE =0}BOOL;
#if DEBUG
#define Dprintf printf
#define Dbs SEGGER_RTT_WriteString
#define Dbp SEGGER_RTT_printf
#else
#define Dprintf /\
/Dprintf
#define Dbs /\
/Dbs
#define Dbp /\
/Dbp
#endif
#endif
|
df749eed386af38cfb23ffac5dc4124d78a8acd1
|
976f5e0b583c3f3a87a142187b9a2b2a5ae9cf6f
|
/source/fastsocket/kernel/drivers/scsi/bnx2i/extr_bnx2i_hwi.c_bnx2i_arm_cq_event_coalescing.c
|
db09e1e5c2cfdd2d209210029b0732bf97454f2b
|
[] |
no_license
|
isabella232/AnghaBench
|
7ba90823cf8c0dd25a803d1688500eec91d1cf4e
|
9a5f60cdc907a0475090eef45e5be43392c25132
|
refs/heads/master
| 2023-04-20T09:05:33.024569 | 2021-05-07T18:36:26 | 2021-05-07T18:36:26 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,267 |
c
|
extr_bnx2i_hwi.c_bnx2i_arm_cq_event_coalescing.c
|
#define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward declarations */
typedef struct TYPE_4__ TYPE_2__ ;
typedef struct TYPE_3__ TYPE_1__ ;
/* Type definitions */
typedef scalar_t__ u8 ;
typedef int u32 ;
typedef int u16 ;
struct TYPE_4__ {int cqe_exp_seq_sn; int cqe_size; scalar_t__ cq_pgtbl_virt; } ;
struct bnx2i_endpoint {int ec_shift; TYPE_2__ qp; int /*<<< orphan*/ num_active_cmds; TYPE_1__* hba; } ;
struct bnx2i_5771x_cq_db {int* sqn; } ;
struct TYPE_3__ {int /*<<< orphan*/ cnic_dev_type; } ;
/* Variables and functions */
int /*<<< orphan*/ BNX2I_NX2_DEV_57710 ;
scalar_t__ CNIC_ARM_CQE ;
scalar_t__ CNIC_ARM_CQE_FP ;
int atomic_read (int /*<<< orphan*/ *) ;
int event_coal_min ;
int /*<<< orphan*/ test_bit (int /*<<< orphan*/ ,int /*<<< orphan*/ *) ;
int bnx2i_arm_cq_event_coalescing(struct bnx2i_endpoint *ep, u8 action)
{
struct bnx2i_5771x_cq_db *cq_db;
u16 cq_index;
u16 next_index = 0;
u32 num_active_cmds;
/* Coalesce CQ entries only on 10G devices */
if (!test_bit(BNX2I_NX2_DEV_57710, &ep->hba->cnic_dev_type))
return 0;
/* Do not update CQ DB multiple times before firmware writes
* '0xFFFF' to CQDB->SQN field. Deviation may cause spurious
* interrupts and other unwanted results
*/
cq_db = (struct bnx2i_5771x_cq_db *) ep->qp.cq_pgtbl_virt;
if (action != CNIC_ARM_CQE_FP)
if (cq_db->sqn[0] && cq_db->sqn[0] != 0xFFFF)
return 0;
if (action == CNIC_ARM_CQE || action == CNIC_ARM_CQE_FP) {
num_active_cmds = atomic_read(&ep->num_active_cmds);
if (num_active_cmds <= event_coal_min)
next_index = 1;
else {
next_index = num_active_cmds >> ep->ec_shift;
if (next_index > num_active_cmds - event_coal_min)
next_index = num_active_cmds - event_coal_min;
}
if (!next_index)
next_index = 1;
cq_index = ep->qp.cqe_exp_seq_sn + next_index - 1;
if (cq_index > ep->qp.cqe_size * 2)
cq_index -= ep->qp.cqe_size * 2;
if (!cq_index)
cq_index = 1;
cq_db->sqn[0] = cq_index;
}
return next_index;
}
|
e36f9897b8a660571f499d8f3b66a6d77a6d2572
|
f983f58aa911a8d4acdc089d17a4c7646d790b89
|
/21. Merge Two Sorted Lists/Merge Two Sorted Lists_table.c
|
1d7558679074e44c15b5dc687c73e4258761ed39
|
[] |
no_license
|
Athlon7/LeetCode
|
67aedcc25a535c67633c0aada080e5a51e2a6bac
|
a7043b40c7262478e816611f8d9d4316c0811c51
|
refs/heads/master
| 2020-12-29T01:31:07.361750 | 2016-08-30T08:49:11 | 2016-08-30T08:49:11 | 56,045,740 | 0 | 0 | null | null | null | null |
GB18030
|
C
| false | false | 2,508 |
c
|
Merge Two Sorted Lists_table.c
|
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
struct ListNode *p1, *p2, *ptr1, *ptr2;
struct ListNode d1 = {0, l1}, d2 = {0, l2};
int i = 0, j = 0, len_1, len_2;
// 有空链的情况
if(l1 == NULL)
if(l2 == NULL)
return NULL;
else
return l2;
else if(l2 == NULL)
return l1;
// 从题目给出答案来看应该是升序的
// 头结点处理起来比较麻烦，用假节点来处理
p1 = l1;
p2 = l2;
l1 = &d1;
l2 = &d2;
ptr1 = l1;
ptr2 = l2;
//遍历两个链表，看哪个长哪个短
while(ptr1 != NULL)
{
i++;
ptr1 = ptr1->next;
}
len_1 = i;
ptr1 = l1;
while(ptr2 != NULL)
{
j++;
ptr2 = ptr2->next;
}
len_2 = j;
ptr2 = l2;
if(len_1 > len_2) //短链向长链里插
{
while(ptr2->next != NULL)
{
if(ptr1->next == NULL)
{
ptr2->next = p2->next;
p2->next = p1;
ptr1->next = p2;
p1 = p2;
p2 = ptr2->next;
}
else if(p2->val < p1->val)
{
ptr2->next = p2->next;
p2->next = p1;
ptr1->next = p2;
p1 = p2;
p2 = ptr2->next;
}
else
{
ptr1 = p1;
p1 = p1->next;
}
}
l1 = l1->next;
return l1;
}
else
{
while(ptr1->next != NULL)
{
if(ptr2->next == NULL)
{
ptr1->next = p1->next;
p1->next = p2;
ptr2->next = p1;
p2 = p1;
p1 = ptr1->next;
}
else if(p1->val < p2->val)
{
ptr1->next = p1->next;
p1->next = p2;
ptr2->next = p1;
p2 = p1;
p1 = ptr1->next;
}
else
{
ptr2 = p2;
p2 = p2->next;
}
}
l2 = l2->next;
return l2;
}
}
|
d0ecd53105c5b8dcdaf26531e4851dd774979c8d
|
97653d5d74d08de6b91572ff01eac641250f46d8
|
/BSP/bsp.h
|
6e0f2a0ddb8b8570df9d4f84c7b233bb95cfeb30
|
[] |
no_license
|
zq3L/tiky
|
27ea8ab602ac0d849989675232378e65d19c68c4
|
d67b907f25755ba95edd004e662ac7ac7e1ead6c
|
refs/heads/master
| 2020-03-30T19:18:10.361960 | 2018-10-04T10:08:13 | 2018-10-04T10:08:13 | 151,536,653 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 234 |
h
|
bsp.h
|
/*
Decription :
Author :Alan Zhang
Date :2018-08-18 15:54:25
Version :1.0.0
*/
#ifndef _BSP_H_
#define _BSP_H_
#include "stm32f10x.h"
#ifdef __cplusplus
extern C{
#endif
void bspInit(void);
#ifdef __cplusplus
}
#endif
#endif
|
f7487ac2ecbe4fe881778cd3b8392f17744cb8b3
|
5f6712b9eec54db020e4cea4bc55c11d3089d37c
|
/tutorial_labs/week-4/appendfile.c
|
73188b6e48a44bbb36a46c2a5bf4fa5fbbc24883
|
[
"CC-BY-4.0",
"LicenseRef-scancode-unknown-license-reference"
] |
permissive
|
raiyanwm/fit2100-operating-systems
|
7f8c6b045abe0bba8d0a6033100b28351618c7e8
|
019c80ab37d0e240f8c701e003cc01289b758f62
|
refs/heads/master
| 2022-03-27T02:38:20.446605 | 2019-11-28T08:07:06 | 2019-11-28T08:07:06 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,340 |
c
|
appendfile.c
|
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/file.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char *argv[]) {
int n, infile, outfile;
char buffer[1024];
char *description = (char *) malloc(sizeof(char) * 100);
if (argc != 3) {
write(2, "Usage: ./appendfile file1 file2\n", 32);
exit(1);
}
/*
* Open the first file ( file1 ) for reading */
if ((infile = open(argv[1], O_RDONLY)) < 0) {
perror(argv[1]);
exit(1);
}
// printf("opened the fd = %d\n", infile);
write(1, "opened the fd = 3\n", 18);
/*
* Open the second file ( file2 ) for writing */
if ((outfile = open(argv[2], O_WRONLY)) < 0) {
perror(argv[2]);
exit(1);
}
write(1, "opened the fd = 4\n", 18);
/*
* CODE HERE: Copy data from the first file to the second file */
n = read(infile, buffer, 1024); // n is number of bytes read, should be less than 1024 bytes
if (n < 0) {
perror("error in reading!\n");
exit(1);
}
// move to the end of file, alternatively, set the outfile as O_APPEND so that only append to the end of file operation is allowed
lseek(outfile, 0, SEEK_END);
n = write(outfile, buffer, n);
if (n < 0) {
perror("error in writing!\n");
exit(1);
}
/*
* Close the two files before exiting */
close(infile);
close(outfile);
exit(0);
}
|
42d70272f750216e5f459141d3def8abc00412c5
|
5576b3af6e048b0aec5bf9b70cd42212d279e3db
|
/fft.c
|
63718f0bb9770bfa74ddd06e157f8e9acc850413
|
[
"BSD-2-Clause"
] |
permissive
|
igorinov/vispo
|
5714d99dafa033e7977a53c56d8b07c4ff1a0647
|
8518746b9ce2ca9782f29ee2e5b9e8a8b059cf80
|
refs/heads/master
| 2022-03-05T04:07:38.788110 | 2019-12-03T00:39:20 | 2019-12-03T00:39:20 | 111,972,248 | 0 | 1 | null | null | null | null |
UTF-8
|
C
| false | false | 11,830 |
c
|
fft.c
|
/**
* Copyright (C) 2016 Ivan Gorinov
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include "vispo.h"
#if (__STDC_VERSION__ >= 199901L)
#define USE_FMA
#endif
int vispo_fft_alloc_d(struct vispo_fft_d *fft, int n)
{
fft->tables = (complex_d *) vispo_alloc_pages(n * 2 * sizeof(complex_d));
if (!fft->tables)
return -1;
fft->n = n;
return 0;
}
int vispo_fft_alloc_s(struct vispo_fft_s *fft, int n)
{
fft->tables = (complex_s *) vispo_alloc_pages(n * 2 * sizeof(complex_s));
if (!fft->tables)
return -1;
fft->n = n;
return 0;
}
int vispo_fft_free_d(struct vispo_fft_d *fft)
{
vispo_free_pages((void *) fft->tables, fft->n * 2 * sizeof(complex_d));
return 0;
}
int vispo_fft_free_s(struct vispo_fft_s *fft)
{
vispo_free_pages((void *) fft->tables, fft->n * 2 * sizeof(complex_s));
return 0;
}
/**
* factorize() - find odd prime factors of N
* Example: n = 45, factors = { 3, 3, 5 }
* @factors - array of integers, at least VISP_MAX_FACTORS long
* @n - number to factorize
* Returns: number of factors found
*/
static int factorize(int *factors, int n)
{
int d = 3;
int i;
for (i = 0; i < VISPO_MAX_FACTORS; i += 1)
factors[i] = 0;
i = 0;
while (d * d <= n) {
while (n % d == 0) {
factors[i++] = d;
n /= d;
}
d += 2;
}
if (n > 1)
factors[i++] = n;
return i;
}
/**
* fft_setup() - prepare complex sinusoid tables for fft_... functions
* for dft... functions, table (cs + n) can be used
* @fft - initialized vispo_fft structure, @fft.tables at least @n * 2 elements of complex type
* @n - size of the transform
* @inverse - direction: 0 - forward, 1 - inverse
*/
int vispo_fft_setup_d(struct vispo_fft_d *fft, int inverse)
{
complex_d *cs = fft->tables;
int n = fft->n;
int i, j;
if (n == 0)
return 0;
vispo_dft_setup_d(cs + n, n, inverse);
while (!(n & 1)) {
n >>= 1;
j = n * 2;
for (i = 0; i < n; i += 1) {
cs[n + i] = cs[j];
j += 2;
}
}
for (i = 0; i < n; i += 1) {
cs[i].re = 0;
cs[i].im = 0;
}
factorize(fft->odd_factors, n);
return n;
}
int vispo_fft_setup_s(struct vispo_fft_s *fft, int inverse)
{
complex_s *cs = fft->tables;
int n = fft->n;
int i, j;
if (n == 0)
return 0;
vispo_dft_setup_s(cs + n, n, inverse);
while (!(n & 1)) {
n >>= 1;
j = n * 2;
for (i = 0; i < n; i += 1) {
cs[n + i] = cs[j];
j += 2;
}
}
for (i = 0; i < n; i += 1) {
cs[i].re = 0;
cs[i].im = 0;
}
factorize(fft->odd_factors, n);
return n;
}
/**
* fft_combine_interleaved() - one stage of interleaved transform
* combine M spectrum pairs, L points each
* into M spectra, L * 2 points each (interleaved data)
*
* @pt_w - complex sinusoid table for this stage
* @l - signal length, complex samples
* @m - number of signals in one channel
* @n - number of interleaved channels
*/
static int fft_combine_interleaved_d(const complex_d *pt_w,
complex_d *data, int l, int m, int d)
{
complex_d w, a, b, t;
int ld = l * d;
int i, j, k;
for (i = 0; i < m; i += 1) {
for (j = 0; j < l; j += 1) {
w = pt_w[j];
for (k = 0; k < d; k += 1) {
a = data[k];
b = data[ld + k];
t.re = b.re * w.re - b.im * w.im;
t.im = b.im * w.re + b.re * w.im;
b.re = a.re - t.re;
b.im = a.im - t.im;
a.re += t.re;
a.im += t.im;
data[k] = a;
data[ld + k] = b;
}
data += k;
}
data += ld;
}
}
static int fft_combine_interleaved_s(const complex_s *pt_w,
complex_s *data, int l, int m, int d)
{
complex_s w, a, b, t;
int ld = l * d;
int i, j, k;
for (i = 0; i < m; i += 1) {
for (j = 0; j < l; j += 1) {
w = pt_w[j];
for (k = 0; k < d; k += 1) {
a = data[k];
b = data[ld + k];
t.re = b.re * w.re - b.im * w.im;
t.im = b.im * w.re + b.re * w.im;
b.re = a.re - t.re;
b.im = a.im - t.im;
a.re += t.re;
a.im += t.im;
data[k] = a;
data[ld + k] = b;
}
data += k;
}
data += ld;
}
}
/**
* fft_combine_loop() - combine M spectrum pairs, L points each
* into one spectrum, L * M * 2 points
*
* @cs - complex sinusoid tables, prepared by fft_setup()
*/
static int fft_combine_loop_s(const complex_s *ww, complex_s *data, int l, int m)
{
while (!(m & 1)) {
m >>= 1;
fft_combine_s(ww + l * 2, data, l, m);
l <<= 1;
}
return m;
}
static int fft_combine_loop_d(const complex_d *ww, complex_d *data, int l, int m)
{
while (!(m & 1)) {
m >>= 1;
fft_combine_d(ww + l * 2, data, l, m);
l <<= 1;
}
return m;
}
/**
* fft_combine_loop_step() - combine M spectrum pairs, L points each
* into one spectrum, L * M * 2 points (D interleaved channels)
*
* @cs - complex sinusoid tables, prepared by fft_setup()
*/
int fft_combine_loop_step_s(const complex_s *ww, complex_s *data, int l, int m, int d)
{
while (!(m & 1)) {
m >>= 1;
/*
fft_combine_interleaved_s(ww + l * 2, data, l, m, d);
*/
fft_combine_s(ww + l * 2, data, l, m * d);
l <<= 1;
}
return m;
}
int fft_combine_loop_step_d(const complex_d *ww, complex_d *data, int l, int m, int d)
{
while (!(m & 1)) {
m >>= 1;
fft_combine_interleaved_d(ww + l * 2, data, l, m, d);
l <<= 1;
}
return m;
}
#ifndef BITREV
int bit_reverse(int i, int bits)
{
unsigned int x = i;
x = ((x & 0xffff0000) >> 16) | ((x & 0x0000ffff) << 16);
x = ((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8);
x = ((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4);
x = ((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2);
x = ((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1);
return x >> (32 - bits);
}
#endif
/**
* fft_complex() - compute FFT from complex data
*/
static int __fft_complex_d(const complex_d *ww,
complex_d *out, const complex_d *in, int size)
{
int i, j, k;
int bits = 0;
int m = 1;
int l = size;
complex_d *dft_ptr;
/* length = l * m, m = 2 ^ bits */
while (l > 1) {
if (l & 1)
break;
l >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits);
if (l > 1) {
vispo_dft_complex_step_d(ww + l, out + j * l, in + i, l, m, 1);
} else {
out[j] = in[i];
}
}
return fft_combine_loop_d(ww, out, l, m);
}
int vispo_fft_complex_d(struct vispo_fft_d *fft,
complex_d *out, const complex_d *in)
{
return __fft_complex_d(fft->tables, out, in, fft->n);
}
static int __fft_complex_s(struct vispo_fft_s *fft,
complex_s *out, const complex_s *in, int size)
{
int i, j, k;
int bits = 0;
int m = 1;
int l = size;
complex_s *ww = fft->tables;
/* length = l * m, m = 2 ^ bits */
while (l > 1) {
if (l & 1)
break;
l >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits);
if (l > 1) {
vispo_dft_complex_step_s(ww + l, out + j * l, in + i, l, m, 1);
} else {
out[j] = in[i];
}
}
return fft_combine_loop_s(ww, out, l, m);
}
int vispo_fft_complex_s(struct vispo_fft_s *fft,
complex_s *out, const complex_s *in)
{
return __fft_complex_s(fft, out, in, fft->n);
}
/**
* fft_complex_columns() - compute FFT from complex data,
* transforming every column of 2D matrix
*/
int fft_complex_columns_d(const complex_d *ww,
complex_d *out, const complex_d *in, int size, int step)
{
int i, j, k;
int bits = 0;
int m = 1;
int l = size;
complex_d *dft_ptr;
/* length = m * n, m = 2 ^ bits */
while (l > 1) {
if (l & 1)
break;
l >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits) * step;
if (l > 1) {
vispo_dft_complex_step_d(ww + l, out + j * l, in + i * step, l, m * step, 1);
} else {
out[j] = in[i * step];
}
}
return fft_combine_loop_step_d(ww, out, l, m, step);
}
int vispo_fft_complex_step_s(const complex_s *ww,
complex_s *out, const complex_s *in, int size, int step)
{
int i, j, k;
int bits = 0;
int m = 1;
int l = size;
complex_s *dft_ptr;
/* length = l * m, m = 2 ^ bits */
while (l > 1) {
if (l & 1)
break;
l >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits) * step;
if (l > 1) {
vispo_dft_complex_step_s(ww + l, out + j * l, in + i * step, l, m * step, 1);
} else {
out[j] = in[i * step];
}
}
return fft_combine_loop_step_s(ww, out, l, m, step);
}
/**
* fft_real_odd() - compute FFT from real data, odd size
*/
int fft_real_odd_d(const complex_d *cs, complex_d *out, const double *in, int size)
{
int i, j, k;
int bits = 0;
int m = 1;
int n = size;
/* length = m * n, m = 2 ^ bits */
while (n > 1) {
if (n & 1)
break;
n >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits);
if (n > 1) {
vispo_dft_real_step_d(cs + n, out + j * n, in + i, n, m, 1);
} else {
out[j].re = in[i];
out[j].im = 0;
}
}
return fft_combine_loop_d(cs, out, n, m);
}
int fft_real_odd_s(const complex_s *cs, complex_s *out, const float *in, int size)
{
int i, j, k;
int bits = 0;
int m = 1;
int n = size;
/* length = m * n, m = 2 ^ bits */
while (n > 1) {
if (n & 1)
break;
n >>= 1;
m <<= 1;
bits += 1;
}
for (i = 0; i < m; i += 1) {
j = bit_reverse(i, bits);
if (n > 1) {
vispo_dft_real_step_s(cs + n, out + j * n, in + i, n, m, 1);
} else {
out[j].re = in[i];
out[j].im = 0;
}
}
if (m == 1)
return 1;
return fft_combine_loop_s(cs, out, n, m);
}
/**
* fft_real() - compute FFT from real data
* @sig - real input signal
* @n - FFT size
*/
int vispo_fft_real_d(struct vispo_fft_d *fft,
complex_d *out, const double *input)
{
const complex_d *cs = fft->tables;
int n = fft->n;
complex_d a, b;
int c, quarter;
int i, j;
if (n & 3)
return fft_real_odd_d(cs, out, input, n);
c = n / 2;
quarter = n / 4;
/*
* casting the pointer turns the real signal
* into complex signal with size N/2
* sig'[i].re = sig[i * 2]
* sig'[i].im = sig[i * 2 + 1]
*/
__fft_complex_d(cs, out, (const complex_d *) input, c);
/* odd-even decomposition */
i = 0;
out[c + i].re = out[i].im;
out[c + i].im = 0;
out[i].im = 0;
for (i = 1; i < quarter; i += 1) {
j = c - i;
a.re = out[i].re / 2;
a.im = out[i].im / 2;
b.re = out[j].re / 2;
b.im = out[j].im / 2;
out[c + i].re = b.im + a.im;
out[c + i].im = b.re - a.re;
out[c + j].re = a.im + b.im;
out[c + j].im = a.re - b.re;
out[j].re = b.re + a.re;
out[j].im = b.im - a.im;
out[i].re = a.re + b.re;
out[i].im = a.im - b.im;
}
out[c + i].re = out[i].im;
out[c + i].im = 0;
out[i].im = 0;
return fft_combine_loop_d(cs, out, c, 2);
}
int vispo_fft_real_s(struct vispo_fft_s *fft,
complex_s *out, const float *input)
{
const complex_s *cs = fft->tables;
int n = fft->n;
complex_s a, b;
int c, quarter;
int i, j;
if (n & 3)
return fft_real_odd_s(cs, out, input, n);
c = n / 2;
quarter = n / 4;
/*
* casting the pointer turns the real signal
* into complex signal with size N/2
* sig'[i].re = sig[i * 2]
* sig'[i].im = sig[i * 2 + 1]
*/
__fft_complex_s(fft, out, (const complex_s *) input, c);
/* odd-even decomposition */
i = 0;
out[c + i].re = out[i].im;
out[c + i].im = 0;
out[i].im = 0;
for (i = 1; i < quarter; i += 1) {
j = c - i;
a.re = out[i].re / 2;
a.im = out[i].im / 2;
b.re = out[j].re / 2;
b.im = out[j].im / 2;
out[c + i].re = b.im + a.im;
out[c + i].im = b.re - a.re;
out[c + j].re = a.im + b.im;
out[c + j].im = a.re - b.re;
out[j].re = b.re + a.re;
out[j].im = b.im - a.im;
out[i].re = a.re + b.re;
out[i].im = a.im - b.im;
}
out[c + i].re = out[i].im;
out[c + i].im = 0;
out[i].im = 0;
return fft_combine_loop_s(cs, out, c, 2);
}
|
81bcec1662d09cd284a4db121260bd72c196bf96
|
4fdddb223b7d8f1e4261f3fc2dedebb87a77a1f1
|
/signed_variable_example.c
|
3161cd45d18d886749dfc0188d7272a2c5da059b
|
[] |
no_license
|
Amali24/UMB-CS240-Projects
|
ffefa2e2004517e2b7c76ecc10bdbf0c8b97def3
|
cb2b0234846526687f997d84734607f4b000dd6b
|
refs/heads/master
| 2020-03-28T21:59:13.710958 | 2018-12-18T01:27:41 | 2018-12-18T01:27:41 | 149,197,019 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 370 |
c
|
signed_variable_example.c
|
#include <stdio.h>
int main(){
int i; // a "signed variable"
i = 0xaa; // value is 170
printf("i = %d\n", i);
i = '\xaa';
printf("i = %d\n", i);
char c; //by default, this is signed
c = '\xaa';
printf("as a character, c = %c\n", c);
printf("as a decimal value, c = %d\n", c);
i = c;
printf("i = %d\n", i);
return 0;
}
|
89eee487f8698dc79d9774b15727d6941782bb9a
|
f5a216e3e4391ff798c5c9aedea077278514b8c1
|
/41_array_contain_15_20.c
|
a93f6f0f84922ece917174255c9a73ab63be3d60
|
[] |
no_license
|
tarungulia/c-programs
|
9bb59f1b36f21fc4b294b4d55a76bb41035eeaaa
|
252c4745790c3c9c22cc533c6fdf629c2aa36ab4
|
refs/heads/main
| 2023-08-12T09:07:26.700546 | 2021-10-05T09:09:15 | 2021-10-05T09:09:15 | 405,244,804 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 371 |
c
|
41_array_contain_15_20.c
|
#include<stdio.h>
int main()
{
int n=2,arr[n],i=0,count=0;
for(i;i<2;i++)
{
printf("Enter %d element: ",i+1);
scanf("%d",&arr[i]);
}
for(i=0;i<2;i++)
{
if(arr[i]==15 || arr[i]==20)
{
count++;
}
}
if(count>0)
{
printf("1");
}
else
printf("0");
return 0;
}
|
0a361c210bbe884a1bb81d74af1ad7460113169a
|
fa64ec0f6f8814fa885244fa4add347437c03293
|
/lib-stm/usart_freertos/usart_freertos.c
|
1f9dc177771d5d32eebac78be26ccbe8e81568f9
|
[] |
no_license
|
senerdnc/esp8266_sys
|
cb1d0aac44a6896a30281c462cde00fb782e87c9
|
7a3fe2009809535258fe4185220c3ece9d10e1a1
|
refs/heads/master
| 2020-05-18T17:18:39.095739 | 2018-07-27T04:23:02 | 2018-07-27T04:23:02 | 184,549,785 | 1 | 0 | null | 2019-05-02T08:52:58 | 2019-05-02T08:52:58 | null |
UTF-8
|
C
| false | false | 10,105 |
c
|
usart_freertos.c
|
/*
* usart_freertos.c
*
* Created on: Feb 12, 2018
* Author: Dr. Saldon
*/
/*-----------------------------------------------------------------------------
MACRO SECTION
-----------------------------------------------------------------------------*/
/*-----------------------------------------------------------------------------
INCLUDE SECTION
-----------------------------------------------------------------------------*/
// General STM32 includes
#include "stm32f10x.h"
#include "stm32f10x_gpio.h"
#include "stm32f10x_rcc.h"
#include "stm32f10x_usart.h"
// FreeRTOS includes
#include "FreeRTOSConfig.h"
#include "FreeRTOS.h"
#include "task.h"
#include "semphr.h"
#include "queue.h"
#include "usart_freertos.h"
/*-----------------------------------------------------------------------------
GLOBAL VARIABLES SECTION
-----------------------------------------------------------------------------*/
/*-----------------------------------------------------------------------------
HEADER SECTION
-----------------------------------------------------------------------------*/
/*-----------------------------------------------------------------------------
IMPLEMENTATION SECTION
-----------------------------------------------------------------------------*/
#if(USE_FTOA == 1)
char * ftoa(double f, char * buf, int precision)
{
char * ptr = buf;
char * p = ptr;
char * p1;
char c;
long intPart;
// check precision bounds
if (precision > MAX_PRECISION)
precision = MAX_PRECISION;
// sign stuff
if (f < 0)
{
f = -f;
*ptr++ = '-';
}
if (precision < 0) // negative precision == automatic precision guess
{
if (f < 1.0) precision = 6;
else if (f < 10.0) precision = 5;
else if (f < 100.0) precision = 4;
else if (f < 1000.0) precision = 3;
else if (f < 10000.0) precision = 2;
else if (f < 100000.0) precision = 1;
else precision = 0;
}
// round value according the precision
if (precision)
f += rounders[precision];
// integer part...
intPart = f;
f -= intPart;
if (!intPart)
*ptr++ = '0';
else
{
// save start pointer
p = ptr;
// convert (reverse order)
while (intPart)
{
*p++ = '0' + intPart % 10;
intPart /= 10;
}
// save end pos
p1 = p;
// reverse result
while (p > ptr)
{
c = *--p;
*p = *ptr;
*ptr++ = c;
}
// restore end pos
ptr = p1;
}
// decimal part
if (precision)
{
// place decimal point
*ptr++ = '.';
// convert
while (precision--)
{
f *= 10.0;
c = f;
*ptr++ = '0' + c;
f -= c;
}
}
// terminating zero
*ptr = 0;
return ptr;
}
#endif
void uart_send_byte(USART_TypeDef* USARTx, uint8_t data) {
while(!(USARTx->SR & USART_SR_TXE));
USARTx->DR=data;
while (!(USARTx->SR & USART_SR_TC));
}
void uart_send_str(USART_TypeDef* USARTx, char* string) {
while(*string != 0)
{
uart_send_byte(USARTx, *string);
string++;
}
}
void uart_send_str_n(USART_TypeDef* USARTx, char* string, uint8_t n) {
uint8_t ptr;
ptr = 0;
while((n - ptr) > 0)
{
uart_send_byte(USARTx, string[ptr]);
ptr++;
}
}
void uart_send_str_ln(USART_TypeDef* USARTx, char* string) {
uart_send_str(USARTx, string);
uart_send_byte(USARTx, '\r');
uart_send_byte(USARTx, '\n');
}
void uart_send_num(USART_TypeDef* USARTx, uint32_t x)
{
char value[10]; //a temp array to hold results of conversion
int i = 0; //loop index
do
{
value[i++] = (char)(x % 10) + '0'; //convert integer to character
x /= 10;
} while(x);
while(i) //send data
{
uart_send_byte(USARTx, value[--i]);
}
}
void uart_send_float_str(USART_TypeDef* USARTx, float flt, int precision) {
char buf[16];
ftoa(flt, buf, precision);
uart_send_str(USARTx, buf);
}
uint32_t uart_param2baudrate(uint16_t baudrate_param) {
if(baudrate_param == PARAM_BAUD_9){
return BAUD_9;}
if(baudrate_param == PARAM_BAUD_38){
return BAUD_38;}
if(baudrate_param == PARAM_BAUD_57){
return BAUD_57;}
if(baudrate_param == PARAM_BAUD_115){
return BAUD_115;}
if(baudrate_param == PARAM_BAUD_921){
return BAUD_921;}
return 57600;
}
#if(USE_USART_1 == 1)
void initUSART1(void)
{
RCC_APB2PeriphClockCmd(RCC_APB2Periph_GPIOA, ENABLE);
RCC_APB2PeriphClockCmd(RCC_APB2Periph_AFIO, ENABLE);
RCC_APB2PeriphClockCmd(RCC_APB2Periph_USART1, ENABLE);
#if(USE_USART_1_DMA_TX == 1)
RCC_AHBPeriphClockCmd(RCC_AHBPeriph_DMA1, ENABLE);
DMA_InitTypeDef DMA_InitStruct;
DMA_InitStruct.DMA_PeripheralBaseAddr = (uint32_t)&(USART1->DR);
DMA_InitStruct.DMA_MemoryBaseAddr = (uint32_t)&usart1dmaBuffer[0];
DMA_InitStruct.DMA_DIR = DMA_DIR_PeripheralDST;
DMA_InitStruct.DMA_BufferSize = sizeof(usart1dmaBuffer);
DMA_InitStruct.DMA_PeripheralInc = DMA_PeripheralInc_Disable;
DMA_InitStruct.DMA_MemoryInc = DMA_MemoryInc_Enable;
DMA_InitStruct.DMA_PeripheralDataSize = DMA_PeripheralDataSize_Byte;
DMA_InitStruct.DMA_MemoryDataSize = DMA_MemoryDataSize_Byte;
DMA_InitStruct.DMA_Mode = DMA_Mode_Normal;
DMA_InitStruct.DMA_Priority = DMA_Priority_Low;
DMA_InitStruct.DMA_M2M = DMA_M2M_Disable;
DMA_Init(DMA1_Channel4, &DMA_InitStruct);
USART_DMACmd(USART1, USART_DMAReq_Tx, ENABLE);
DMA_ITConfig(DMA1_Channel4, DMA_IT_TC, ENABLE);
NVIC_InitTypeDef nvic_dma;
NVIC_PriorityGroupConfig(NVIC_PriorityGroup_4); /*!< 0 bits for pre-emption priority, 4 bits for subpriority */
nvic_dma.NVIC_IRQChannel = DMA1_Channel4_IRQn;
nvic_dma.NVIC_IRQChannelPreemptionPriority = configLIBRARY_LOWEST_INTERRUPT_PRIORITY;
nvic_dma.NVIC_IRQChannelSubPriority = 0;
nvic_dma.NVIC_IRQChannelCmd = ENABLE;
NVIC_Init(&nvic_dma);
NVIC_EnableIRQ(DMA1_Channel4_IRQn);
vSemaphoreCreateBinary(xUsart1TxDmaSemaphore);
xSemaphoreGive(xUsart1TxDmaSemaphore);
#endif /* USE_USART_1_DMA_TX */
GPIO_InitTypeDef gpio;
GPIO_StructInit(&gpio); /*** Configure UART Rx GPIO ***/
gpio.GPIO_Mode = GPIO_Mode_IN_FLOATING;
gpio.GPIO_Speed = GPIO_Speed_50MHz;
gpio.GPIO_Pin = PIN_UART1_RX;
GPIO_Init(PORT_UART1, &gpio);
gpio.GPIO_Mode = GPIO_Mode_AF_PP; /*** Configure UART Tx GPIO ***/
gpio.GPIO_Speed = GPIO_Speed_50MHz;
gpio.GPIO_Pin = PIN_UART1_TX;
GPIO_Init(PORT_UART1, &gpio);
USART_InitTypeDef usart;
USART_StructInit(&usart);
usart.USART_BaudRate = UART1_BAUDRATE;
usart.USART_WordLength = USART_WordLength_8b;
usart.USART_StopBits = USART_StopBits_1;
usart.USART_Parity = USART_Parity_No ;
usart.USART_HardwareFlowControl = USART_HardwareFlowControl_None;
usart.USART_Mode = USART_Mode_Rx | USART_Mode_Tx;
USART_Init(USART1, &usart);
USART_Cmd(USART1, ENABLE);
USART_ITConfig(USART1, USART_IT_RXNE, ENABLE); // Enable RXNE interrupt
NVIC_InitTypeDef nvic;
NVIC_PriorityGroupConfig(NVIC_PriorityGroup_4); /*!< 0 bits for pre-emption priority, 4 bits for subpriority */
nvic.NVIC_IRQChannel = USART1_IRQn;
nvic.NVIC_IRQChannelPreemptionPriority = configLIBRARY_LOWEST_INTERRUPT_PRIORITY-1;
nvic.NVIC_IRQChannelSubPriority = 0;
nvic.NVIC_IRQChannelCmd = ENABLE;
NVIC_Init(&nvic);
NVIC_EnableIRQ(USART1_IRQn); // Enable USART1 global interrupt
vSemaphoreCreateBinary(xUsart1RxInterruptSemaphore);
}
#if(USE_USART_1_DMA_TX == 1)
void DMA1_Channel4_IRQHandler(void)
{
portBASE_TYPE xHigherPriorityTaskWoken;
xHigherPriorityTaskWoken = pdFALSE;
DMA_ClearITPendingBit(DMA1_IT_TC4);
DMA_Cmd(DMA1_Channel4, DISABLE);
xSemaphoreGiveFromISR(xUsart1TxDmaSemaphore, &xHigherPriorityTaskWoken);
portEND_SWITCHING_ISR(xHigherPriorityTaskWoken);
}
#endif
#endif
#if(USE_USART_2 == 1)
void initUSART2(void)
{
RCC_APB2PeriphClockCmd(RCC_APB2Periph_GPIOA, ENABLE);
RCC_APB2PeriphClockCmd(RCC_APB2Periph_AFIO, ENABLE);
RCC_APB1PeriphClockCmd(RCC_APB1Periph_USART2, ENABLE);
#if(USE_USART_2_DMA_TX == 1)
RCC_AHBPeriphClockCmd(RCC_AHBPeriph_DMA1, ENABLE);
DMA_InitTypeDef DMA_InitStruct;
DMA_InitStruct.DMA_PeripheralBaseAddr = (uint32_t)&(USART2->DR);
DMA_InitStruct.DMA_MemoryBaseAddr = (uint32_t)&usart2dmaBuffer[0];
DMA_InitStruct.DMA_DIR = DMA_DIR_PeripheralDST;
DMA_InitStruct.DMA_BufferSize = sizeof(usart2dmaBuffer);
DMA_InitStruct.DMA_PeripheralInc = DMA_PeripheralInc_Disable;
DMA_InitStruct.DMA_MemoryInc = DMA_MemoryInc_Enable;
DMA_InitStruct.DMA_PeripheralDataSize = DMA_PeripheralDataSize_Byte;
DMA_InitStruct.DMA_MemoryDataSize = DMA_MemoryDataSize_Byte;
DMA_InitStruct.DMA_Mode = DMA_Mode_Normal;
DMA_InitStruct.DMA_Priority = DMA_Priority_Low;
DMA_InitStruct.DMA_M2M = DMA_M2M_Disable;
DMA_Init(DMA1_Channel7, &DMA_InitStruct);
USART_DMACmd(USART2, USART_DMAReq_Tx, ENABLE);
DMA_ITConfig(DMA1_Channel7, DMA_IT_TC, ENABLE);
NVIC_EnableIRQ(DMA1_Channel7_IRQn);
#endif /* USE_USART_1_DMA_TX */
GPIO_InitTypeDef gpio;
GPIO_StructInit(&gpio); /*** Configure UART Rx GPIO ***/
gpio.GPIO_Mode = GPIO_Mode_IN_FLOATING;
gpio.GPIO_Speed = GPIO_Speed_50MHz;
gpio.GPIO_Pin = PIN_UART2_RX;
GPIO_Init(PORT_UART2, &gpio);
gpio.GPIO_Mode = GPIO_Mode_AF_PP; /*** Configure UART Tx GPIO ***/
gpio.GPIO_Speed = GPIO_Speed_50MHz;
gpio.GPIO_Pin = PIN_UART2_TX;
GPIO_Init(PORT_UART2, &gpio);
USART_InitTypeDef usart;
USART_StructInit(&usart);
usart.USART_BaudRate = UART2_BAUDRATE;
usart.USART_WordLength = USART_WordLength_8b;
usart.USART_StopBits = USART_StopBits_1;
usart.USART_Parity = USART_Parity_No ;
usart.USART_HardwareFlowControl = USART_HardwareFlowControl_None;
usart.USART_Mode = USART_Mode_Rx | USART_Mode_Tx;
USART_Init(USART2, &usart);
USART_Cmd(USART2, ENABLE);
NVIC_InitTypeDef nvic;
USART_ITConfig(USART2, USART_IT_RXNE, ENABLE); // Enable RXNE interrupt
NVIC_PriorityGroupConfig(NVIC_PriorityGroup_4); /*!< 0 bits for pre-emption priority, 4 bits for subpriority */
nvic.NVIC_IRQChannel = USART2_IRQn;
nvic.NVIC_IRQChannelPreemptionPriority = configLIBRARY_LOWEST_INTERRUPT_PRIORITY;
nvic.NVIC_IRQChannelSubPriority = 0;
nvic.NVIC_IRQChannelCmd = ENABLE;
NVIC_Init(&nvic);
NVIC_EnableIRQ(USART2_IRQn); // Enable USART1 global interrupt
vSemaphoreCreateBinary(xUsart2RxInterruptSemaphore);
}
#endif
|
514c10635d9f8cc5dbeac96030024f5b00f3e099
|
17014de6ef4a0b187587e9de2b0469d95ec2d7df
|
/prog12.c
|
39278b2c7164a72ae454e958cc7c76b500c9aaa7
|
[] |
no_license
|
narendra112/narendranov
|
862cce9ef9c5214d153f30c8d38ed18aa3b7073c
|
c235cff7306ec5975b9d5c3ea3c2159bebd6630d
|
refs/heads/master
| 2020-09-15T03:38:38.377544 | 2019-11-22T06:32:21 | 2019-11-22T06:32:21 | 223,339,389 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 238 |
c
|
prog12.c
|
//Write a C program to enter two angles of a triangle and find the third angle//
#include<stdio.h>
void main()
{
int x,y,z;
printf("enter two sides of angle\n");
scanf("%d %d",&x,&y);
z=180-(x+y);
printf("third angle is:%d\n",z);
}
|
4ea103135aea0f04625ac39213f00d72ed5a4539
|
976f5e0b583c3f3a87a142187b9a2b2a5ae9cf6f
|
/source/FFmpeg/libavformat/extr_dhav.c_dhav_read_seek.c
|
11713b0cfef6e42fc38a0dd88c760e4cade4c959
|
[] |
no_license
|
isabella232/AnghaBench
|
7ba90823cf8c0dd25a803d1688500eec91d1cf4e
|
9a5f60cdc907a0475090eef45e5be43392c25132
|
refs/heads/master
| 2023-04-20T09:05:33.024569 | 2021-05-07T18:36:26 | 2021-05-07T18:36:26 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,170 |
c
|
extr_dhav.c_dhav_read_seek.c
|
#define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward declarations */
typedef struct TYPE_12__ TYPE_5__ ;
typedef struct TYPE_11__ TYPE_4__ ;
typedef struct TYPE_10__ TYPE_3__ ;
typedef struct TYPE_9__ TYPE_2__ ;
typedef struct TYPE_8__ TYPE_1__ ;
/* Type definitions */
typedef int /*<<< orphan*/ int64_t ;
struct TYPE_12__ {int nb_streams; int /*<<< orphan*/ pb; TYPE_4__** streams; TYPE_3__* priv_data; } ;
struct TYPE_11__ {TYPE_2__* priv_data; TYPE_1__* index_entries; } ;
struct TYPE_10__ {int /*<<< orphan*/ last_good_pos; } ;
struct TYPE_9__ {int /*<<< orphan*/ last_timestamp; int /*<<< orphan*/ pts; } ;
struct TYPE_8__ {int /*<<< orphan*/ timestamp; int /*<<< orphan*/ pos; } ;
typedef TYPE_2__ DHAVStream ;
typedef TYPE_3__ DHAVContext ;
typedef TYPE_4__ AVStream ;
typedef TYPE_5__ AVFormatContext ;
/* Variables and functions */
int /*<<< orphan*/ AV_NOPTS_VALUE ;
int /*<<< orphan*/ SEEK_SET ;
int av_index_search_timestamp (TYPE_4__*,int /*<<< orphan*/ ,int) ;
scalar_t__ avio_seek (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ avio_tell (int /*<<< orphan*/ ) ;
__attribute__((used)) static int dhav_read_seek(AVFormatContext *s, int stream_index,
int64_t timestamp, int flags)
{
DHAVContext *dhav = s->priv_data;
AVStream *st = s->streams[stream_index];
int index = av_index_search_timestamp(st, timestamp, flags);
int64_t pts;
if (index < 0)
return -1;
if (avio_seek(s->pb, st->index_entries[index].pos, SEEK_SET) < 0)
return -1;
pts = st->index_entries[index].timestamp;
for (int n = 0; n < s->nb_streams; n++) {
AVStream *st = s->streams[n];
DHAVStream *dst = st->priv_data;
dst->pts = pts;
dst->last_timestamp = AV_NOPTS_VALUE;
}
dhav->last_good_pos = avio_tell(s->pb);
return 0;
}
|
4ea0a3776231c9e48b7d81fdc1f09d647b5270cc
|
43109d4e69978f6c3e6932b003ebd128eb2e7aee
|
/zephyr/shim/include/shimmed_task_id.h
|
bc6a5d828bb6bb3542fbeb4e5b3a13c10a2bd560
|
[
"BSD-3-Clause"
] |
permissive
|
lujiangyuan/ec
|
5fa04e33ffe3e012d69ba34c25833360d977bbbb
|
b06ad2df42bd9c3c48e06df0645b526a1fc454e7
|
refs/heads/master
| 2023-01-22T00:28:57.121007 | 2020-12-03T20:54:09 | 2020-12-04T18:28:03 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 793 |
h
|
shimmed_task_id.h
|
/* Copyright 2020 The Chromium OS Authors. All rights reserved.
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef __CROS_EC_SHIMMED_TASK_ID_H
#define __CROS_EC_SHIMMED_TASK_ID_H
/* Task identifier (8 bits) */
typedef uint8_t task_id_t;
/* Include the shimmed tasks for the project/board */
#ifdef CONFIG_SHIMMED_TASKS
#include "shimmed_tasks.h"
#else
#define CROS_EC_TASK_LIST
#endif
/* Define the task_ids globally for all shimmed platform/ec code to use */
#define CROS_EC_TASK(name, ...) TASK_ID_##name,
enum {
TASK_ID_IDLE = -1, /* We don't shim the idle task */
CROS_EC_TASK_LIST
TASK_ID_COUNT,
TASK_ID_INVALID = 0xff, /* Unable to find the task */
};
#undef CROS_EC_TASK
#endif /* __CROS_EC_SHIMMED_TASK_ID_H */
|
d3a69cbfbb02a09acfd6b93e58c0ad4fddd2805c
|
a878f8441783478153a899d32d6c763a04052b80
|
/01-CFases_de_la_Traducción_y_Errores/hello2.c
|
7f619196427de1d6222e20a84ac4886acce2c0cb
|
[] |
no_license
|
juansanchez89/SSL
|
749ff5862b12b9a191eb0133e53bc1a10f697103
|
bd521176cba465417f9cd78396e49e18ea3c05f0
|
refs/heads/master
| 2020-05-03T16:26:12.760527 | 2019-04-14T22:18:12 | 2019-04-14T22:18:12 | 178,722,893 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 140 |
c
|
hello2.c
|
/* Hello World
Sanchez Juan Pablo
2019-04-14
*/
#include <stdio.h>
int/*medio*/main(void){
int i=42; prontf("La respuesta es %d\n");
|
ab2990cd77fb5c85189d856762cff778db9d00f8
|
04395f4718b9900d2bc6960d8f16bc749202b991
|
/TheCProgrammingLanguage/chapter_2/htoi.c
|
ad024a6666db207789dbe869b246cbc8f336dfef
|
[] |
no_license
|
fazerlicourice7/house_of_licourice
|
6bbb560ad3aa762091239e766b8f2d7bf851981f
|
2969ab67b2ded6c79ac37e093123ab4f08b0060d
|
refs/heads/master
| 2021-01-21T04:40:29.351978 | 2016-07-09T00:18:06 | 2016-07-09T00:18:06 | 29,676,482 | 1 | 1 | null | null | null | null |
UTF-8
|
C
| false | false | 1,998 |
c
|
htoi.c
|
//EX 2.3
#include <stdio.h>
#include <math.h>
#include <ctype.h>
/* Write a function htoi(s) , which converts a string of hexadecimal digits
(including an optional 0x or 0X ) into its equivalent integer value.
The allowable digits are 0 through 9 , a through f , and A through F.
*/
#define MAXDIGITS 30
char num[MAXDIGITS];
int hex2Dec(char[], int);
void getIn(char[], int);
int remPre(char[]);
double pow(double,double);
main(){
getIn(num, MAXDIGITS);
int digits = remPre(num);
long value = hex2Dec(num, digits);
printf("%ld\n",value);
return 0;
}
/*
* Takes a hexadecimal string without the 0x prefix, and converts it to base 10.
*/
int hex2Dec(char hex[], int digits){
int result = 0, I = 0;
while(digits > 0){
int currentDig;
if(isdigit(hex[I])){
currentDig = hex[I] - '0';
} else{
char c = tolower(hex[I]);
if(c == 'a')
currentDig = 10;
else if(c =='b')
currentDig = 11;
else if(c =='c')
currentDig = 12;
else if(c =='d')
currentDig = 13;
else if(c =='e')
currentDig = 14;
else if(c =='f')
currentDig = 15;
}
result += currentDig * (int) (pow(16, digits - 1));
++I;
--digits;
}
return result;
}
void getIn(char num[], int digiLim){
int digi = 0;
char c;
while(digi < digiLim -1 && (c=getchar()) != '\n' && c != EOF){
num[digi] = c;
++digi;
}
num[digiLim] = '\0';
//printf("digits b4 remPre: %d", digi);
}
/*
* Removes the 0x prefix if it is there.
* Returns the number of digits.
*/
int remPre(char num[]){
int i1 = 0, i2;
if(num[0] == '0' && (tolower(num[1]) == 'x')){
i2 = 2;
} else{
i2 = 0;
}
while((num[i1] = num[i2]) != '\0'){
++i1;
++i2;
}
//printf("digits: %d", i1);
return i1;
}
|
8c6f3a53092ec298f52178e2fd135d7ae2bc71a8
|
590ac1d653c5db8fbe5cc7fa2f5d056a964e63bd
|
/inc/list.h
|
525c376b7ac2e4c687db396a1b9898b444ebbf11
|
[] |
no_license
|
bernardobreder/demo-sdl-lang
|
293cb3740e40c4664ebf3e342673baeefc3f48b4
|
c8b556d37a69475723ff828efe8c27131f6bdf47
|
refs/heads/master
| 2021-06-30T17:45:32.535746 | 2017-09-21T11:22:47 | 2017-09-21T11:22:47 | 104,338,992 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 703 |
h
|
list.h
|
/*
* list.h
*
* Created on: 13/07/2013
* Author: bernardobreder
*/
#ifndef LIST_H_
#define LIST_H_
#include "struct.h"
struct list_t* list_new(unsigned int max);
struct list_t* list_new_full(unsigned int size);
void list_free(struct list_t* self, void* freeFunc);
unsigned char list_add(struct list_t** pself, void* value);
unsigned int list_size(struct list_t* self);
void* list_get(struct list_t* self, unsigned int index);
void list_set(struct list_t* self, unsigned int index, void* value);
const void** list_iterator(struct list_t* self);
void* list_remove(struct list_t* self, unsigned int index);
void list_clear(struct list_t* self, void* freeFunc);
#endif /* LIST_H_ */
|
e53e6a19f1fb3947f80b9945e5977284d9014884
|
192d54eadfdcd2588294e376c682fe97a8a6c160
|
/CY8fXmxHkr5TdvsK/6HvoUiOFazdBWbSM.c
|
f6bc26e381acb562f178061e5a14e8464b883a23
|
[] |
no_license
|
urlib/i1OB8Mxh
|
fc953ae8e8dc4fe51b7588e77b28ad6fc9709458
|
7811957b67e50da2f38bb47cedac8ff16d4396d0
|
refs/heads/master
| 2023-01-08T19:56:26.906229 | 2020-04-15T03:52:43 | 2020-04-15T03:52:43 | 248,736,500 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 201,457 |
c
|
6HvoUiOFazdBWbSM.c
|
𢊢쁎𨚃𮁠索괈𤸐钠ਖ਼뚦覚𤷎𠐣𩦻𨁵𧔵ꘕ𫙟㙙𩞒粅𐫶䝙댝𣌤𥲚ᯘ𝆄𘓪𧴩𪀖𢉤𓄑𢫪૭炠𠶄𧏝𖡨𣗡𘔘𔐊𘚑㮮𐀽𪍦漹ㄒ𡑍𣻈賠𩓍𖡇祊இ専讎𡮵𩧻𦧓𬦶𭎄战𘤯捐𮮠𮗖𗨲ᙠ溻𨀉蓗𭾈𤯂㨔췪𧄼𡙪𣤀𖼓𩬇𤐎❺𢈮𣐪🇯𮙨砊🥮𝙧𭤴뵅𫠈𥛻𨼶𣺷𢟐켷𫞋𭼘邖𖬡橆搷傊耜𘏰큪𗴥㖡𘖲𛋑𝚇䐧𮟫𢭸𤿂觤ቌ𨄽ᇼ圣𮉎퍓𮆞犮ꦔ𭝆𑦶𠼣𛉴庳𭽮𘍹趸焌𪯮𩫤묦𪧎𨇃𐨗兛𒅒𫕴𣘗쯛ꈹ𥧴𩜷𠙗𬨠𦦂𤠞𖧈𥧻𩖫㫦𫪏롨䵜鲈𢬞Բ𡰏鸏𘎫𠮂✇쉹𑦤𝝜艶𢠁𧌎𫑨𤥞𡷣𗄱𐕇𨇦䓹𑵾𞢺𣐨𢧘𘪹𨔒𬘺활蕫𥯣𥯲𤮚其꩜芶𘉂癶𠷵𡃷倘𬛻𣮔𪺞蠋쨩䞤𖧔箇坱ๅ퍅𘌤╈𡑛𬡩𘤼႐𤜌𭮬⸢⤪𢀮𨙯䞙𗳑𐧇𪃹뒬𤠿𨽟𠯌𛀋𠄟얁꞉𪖡顿𮄊𡐒𒆐𮘹𐢒𦍋𠌭𨂈𐌽欐𮑡𥅾ⷉ📧𐩖𔕫𡐜몙貕ԥ𠳖𡐢뽦𪙾𑆀쩦𩳭🅇㠋🙡𤯥𡪛𮜉𭕬ꎬ돋𫻻𗹗𡁼ఢ𓍑풔𝣧𢸤𦴋𥑣諃𣢃圎鎀𭾡䩲榵𪱨ⴌ𦖝昜𘔼𤸩嗝炶𦮨𣗊🍅즈󠄾𢴬𗴛𧪟𠊦𧌪𫱝𑶔𬩺ᖦ𠫁𧟜𒎇𤀏턻𣔦𬂴𗟛삢𘪊𥏌𩺯ꝲዣ𫫪𨋷쎧Ἵ𪐬𧂧𣠖𗨾𗧥𣫾𩵶瘫𩅁𮅢籦𣹛㌜偦ำ𡰴𧙈𨽖𦟁憲𐠲🏙𦂵𮓐𬍱𩼼𗵽𭡇𖹎㕮𥶳𡅴𨾏𦈵🆍𧆻帚綝𤵅躁關㿨𝐢慑ᔝ̫ශ齹𘆲⿎𮪬𫞾𘨮톷풩싊럞𐂎𮗈𒔶ҵ𐅅𑣠𡰠󠇫頕𡅰䯃𪾆爆𭇍𘢈𮎿婺𨭤픜ಞ𣴲𢏋𑋕𤝧𬽂𬷃𑜍𤆆覭嵽ॲ𥵕𤑗𠥎𒄑𡅱𫡸픲🄜䵔𨰔麺𬿍ꂰ𡖽𠏃ܱ𣸾𭜹𬂟𒍯𥭯𘤗𗀐笿𥌱⇆𫼷🐏顱𡇰𪄊𔔯𠯌嗚喡𢭆𮀤𤼑ዴ纣돛㈈䛿･귥뼉꿾𨑨𬂠쥹衝𓈤𘗵ꪫ𦝔𮡽𠐁𬿝𓋬𭰄얦僚얅𗠑𧍂𠥯𒍯恭搄랺𤀺턟𫍦𣊖뒹𮧆𐬰糠叕𒅮𠳓궔䟎𢘖𨘠紼𢁧ア钍옹𤿹𤘻𗬏쫘肓陵𤣥ᖫ荙爫𖬦𥒒𫸹𗌵𡯗ݐ浏𬶁ꕠ拗𘓉Ḵ랖𢔮𢸣鷱ፓ胛𬎇𗹟𐓻𗟃𫽯𘠋뺍𮔕灡턥Ì䷏𗨥𢀤柅꘨듊ⷹ𨃣𫿇訢Ӡ🕹𦇂𮪵𝁦𫻠볐𗛄𦃞Ყ𛃖𪮭𣓰𪇩脡𢩡𭶝Ӗꔤ𫿂㈦𦫠煶𑻧𥗵𮬼𩇗𡴳냃甭𗵰悖𩱃𗨅𨸙𢃍𦷴𘉯𪶢𡼤𓀊𤼹𣆘觀𘒖䂗뀲ὀ𩌔洘𞠄𦽰茳𡦒鎇𩮸𡍡𤣱𢵧ﭩ𭮊𫝥𤠼㥜ഖ𤌪𣍗𒒁𠲊𘉑𩶑큡𦙼𠕏𥿄𠅪𧡍ざ𦳬羇댮𐛵𦉚𮠅𑣄墾𦆋𩃈啣蛄𭪢𨚤𥬙𘑲ꉑ𠳆𤒃ﺾ𒀓𢓔󠄀崅𨀾쌽ـ뛋鉍ꆤ𪕴🖂紖𝠜𓌛藷쎆𗸕𮨨𮁽ᰥ𮠪𑈕𪒟𗏟𡲏𦕤𒆄𣚈𬸇矀𢓄𘌟𧎹𖾐堬𐛔𢾍纴룟𭇿𠄽𮙼𢹧𦷍𧇶ﲙ漗𠈰𪫛𦸬𑪛𢂝𭁡𢊋⛓琘𪚏𓀙斞靊𓄭𮞮𧻚𥾿헢𤧌𠦂𠆊𡨊杒⇨욨͞𗍫𣜐糎䟫𢼶𒌢𡨤𥓕𑖺𬣡㾶𦎩𘙥𝡽듔𤿔𢧈𮙣걿𣛧𭥐𤿅꛷𨹸鶒𠂖𦸓𪺛辸鞭𡍅ᅘ𮭯𪂢촡𝒪𬑴誳𥬲𮄽鐳𧼀쳟𫴫祬𖦗𥆾띺ࠍ⥗👲䛇𧆕ꐎ𤂱𭨄𩮶䯘𮤥ค雷麸𒂁𪤧𘦌꺟𗋗𢕙Ⴃ𖼄匀𪄜󠅢쯦ﮨ🎷𠡹𮏗𨷵𥀓𧊓𬞕𧷷𘒴𞄶𣫇𗍫𨰇𑠵𦗰𭟢𨬰㴧㼗𞲨𩑺縤⢆𬑀놞䷭𠠿𩺒𫋧渕ᐙᜁ𢺣𠧤𪱒𥧱㼥𬉗𬳼ꛀ𬈝𧝻𑲍䨔㕢믫鹽𗍍ᜊ𗵾ᨻ𓍞𗊝𤝑ⳬ뜱🁿𡂕𓇒𮖅갪𭩤𩈁𨩑𨗯𓌛𘇓粉荏𩚒𥫀玠𡆋ࢺ㱦𬚒𩴤𢶿𤈹𗘅숆𭌒𘣵𗵲𘡅ꓡ𑄻㤲䞟굥렗𡗈𦙽♽긎𘉧𗐿걅𡿍𔘪𦄰겏朼᠇𪊬𘍴𒃰𐦖🕯𛰌𝓫塩𬟫𤖮𣉋𐝡扝滳𡑐𥝙𮘦𩾲ྜྷ𡨁闠𖬻ũ𫛖í뭷𥇖꧇𥯹垐𮓴Ⓑ𫢚𝓯회🛁𭢫㛢哾𪵕𬥜쿉𫌝긙𢜻𨕦鸈𤻨⚈ῲـ巒볠𣣓⧚뒏𦚝㇈𨡍㐚닜𝧓𣘵ｫ𘉇잸𨐋𫎉𪃹𨡁𫥕硗𦥼㍴𤹚บ𢲯ㆧ𡪢궝ུ𧵞𣋡落𧚼◝只迼𦹌𠼣𛊂𪯐뤪犰ք⧷Ჹ𨀞𪲾ٷ𮣣𗭎楺瀺딵噋𥊨𝀴𫰵Ơ鬬𡠶𪚃𤦌𬵤䕫𒀆𨧚𩵞볏𝑼급𭵖𥺛𒂹〆皦𔘑𧚭𠡈𝦇ᴦ‶𩫯ጠ텟灲𨌾𩕧𭁐𠷶𩠋𡡊𗝊Ｘ𘘦ਧ𨓔𤑅𔓜𡋞ꅎ𧧬𘣏🆒𤖽𢭂𬣟뇗𢩖襹𢠝𗥱𥫿𠘚憲󠄘🔮鮼𭲚듪䧏𢞥𣁰ꄩ莟嘀𨪷𗍑ꠓ𩩐𭦠㐿𢕡慦𮤉𡔟𣁱𧝦𣪸扦Ⓟ𦙧𗷵𢦥ﵕ唣ᇩ蹠䑙𮘟讦煦뉢𮛫𬣟꓿왑鏟⬒𫾆𧭏𨀢𦈈𝣟𩻇쐥𦓃뮈ᆖ𖾑𧲇죧𗍎綜㕮旰⨝嘖⸴狵𫧻꓁𠇎𪮹𤓺𑻩𭈗𠫌𦤠侹𮑁𮇠查惝𬔇𤓎𡑯𩄲앐𫠸떣𝁾𥜧🟦梢ⰰᘄ𢀦ꞓ𦾊𭡟𖥧𩸀삱櫧𦩡瞕𫆁𢐬쒼𠁒🠅𠯶𦊩𨃸𐲫𣙶ꗾ𩿉鐃𬇒釱𗇿胢𮩓ᖟꐽ꾍𮇙𧦠ብ썔𭃘盔𠭸粱𗆎횦𗇷榩乪𘦝⧀훘𨴚𣜗푨𢿐𥧎钮𢰙㬩𬜧𪵁𔘴𭄽䛠み𭟥𥃍ꛄ𪰜𢄓𐔌𮢏퍿𤲖𩅑ⓢ𡛥𨝏𬋔ᇽ𨡪꽶𡁳풬𒓯𮂜捏𗂵𨾚븶𫱳朗𬥽𨍰𤃧𡕷𪒸瀢륚𠉁𨈗즣𩧩𮌍酥𡦟凉𓌩퓾𤖇㊲𢋖👚𡥖ᒗ𥱲垮𥥯𖥋䜓뎛𣘥𨡲ꎈ𠙵笂빔궶맵혎𫱞𗩉𞺴𩙜𨟏铖𩔶騻⪲𠌤𩢠𒒿𝟢ম𗉐𮎌𦩍🝞榰𢢆割𐠟𝛯𣖟낼𭔄𣙒⭿꙰𢜗𡓎뀄噹🟑𣝰𤴎ﵛ𤵇棡큠迳𭭅𡍣𠣛㞁䛿𪽙蚐㏒𫓩𢵊賂𦽚𦄤𤤩䬥𡎱𤪹傲櫇𬩵𝙞𮔊ྸ𫸬覵顐簝໗墢𩠸𥈥𐦲釕𝢚𪿤년𗏘𐜝𝅒𮄷𤦷捲𧤕𩁁𨛐沴玪𪤉ꪄ𔔿𡜆𠫣텱蹅⛆𒍔𠀴𫀓𖦳𩻞𐳗ᛇ¿𨁃𖡁𗴵𝙇𢊄⪟𪎍萖뻎𝁌䞃𮔊𘗁𨮩̺𪭇𤶯薎𢾽𓁪𫘄螎蠻䕝𖣙𦉂𠟷⪖𥚚𥳄𣥠犥ꪮ𛉐𔕵✟𩆼㍨𩬟𬷫𐤮㭴𩸗𩰭𩶝𨊎𥓌𪏷󠆒嶖𨛿௷陊𘛠😎꠨𩥾彋䚱䎑ꆵ𗸥ᡵ𗉏𫔡𤅈𘋑𝐺𥨛𒓳﹠𣗮𧥭尻Т륌𮣵𗴄𦛋𪮇𨨽𫇦𩑺𫸀𤯿𐀓𗣸캰𣾠廖䥥𘥿斓욜𩞦荔哒𮤨닕𭕽ᘌ좱䬚𮆛旸𨢓𡡶𭽻𨓠󠅯솢鵝𣖦啜斅𣺃磋𨱐櫔챆𗪍퐠𦊷𥍸𪬁𣰲𡃬뗀𣬶𝒩䩴솜䜡🕺濨𐧞𑄬𬒙𮍽𤱉庰𬕜𢭏ྃ𧃾ຠ𮢩𦶺𮐵𭜿𦯷𣲛𣇗𣆀ਛ𭭕𗢨靐𦹔𗞗鷔𡬑㾜𝜎𨍟𫐩𡸷䆟𦆫亷𥕋𫏂𭩬𦝍𡶀𠼟㭭熔𧽓𑄂𗊄𗼓䨺𥤁𬒁𓃌𛀁𤷑🏠훉텨𥎹𪱹𛰲钫㪳𪅮핽𦮥㧝į륐𘎋𡨍粞唠𒃿𗶕ᨅ躀𮋃䘹凫瞊滌嶥𢔹斈쒅𭧛䁑𤹂𪊾𤈘𗟚쁣𠏷𛊖𭸛𥨫𬶬𣎱陮寵䫴𭧨𑂏뛇𩛟𤠘𗆮ᑭ𠱄𫷪ᬌề𬑀ⶍ𢯩僡𥪽붖ꕍ𤓌𬒭𤴅𮌤𪿘ﮦ𝆍𭃰𫈚썐玮뎿⾆𗏻𣄻🁥𭓫𘗩𞣋挔𡤗씥狪𑇃⬙퇴媞ਣ빭ꕃ🦜𪪛𢹺𢜲𭜗𭓬吃㳞𑄣햅䙱𡶷딏𤧇鬔𝦠䠧𣹋𬙺硪𨺹𝈼𧕎𤌝笄𥈍쓪댦𐼘穷̭鮐𗘻𤙍Ⱬ𤛢𫤒𫀄쁅谖햩ﲁ𧬊濊🂌ᚽꭢ愆𤱁𘒨𮔡쀹䠳𝃛𪈭𘃪𪩥𭃔ष𪄉𢧰𡄡𑖌𤳧𘅚쮘绍𮠋𡛚𦺞𪮋ባ㴳𠯸𧍤𬻟𑂩𧳣𝜵㤪𛈵쳬쮧𨕣𦁶졿𡥄ḻ𗆘ꛚ𬠥𥚷噻𐫆𡨓쒤ꦎ𥗕𪰙𤔯러妕䑕ꓹ⊑𣾒𐲀≹髞𐴓磠㔣𪺡歜稽셜𪕨栀벶鍇鲗寣允𭼴𦆠𨗡𑇋씙ｲ𦯲𫓝䥭𧶸𤳃⊣𬕸𭪤𗱈𢒤𨒼ᘀ𢗘𩯏詤𭎄𨎾𠣫𩑆캨𭨗𡆟𢰯𓆆窜𫠴𢁭퀘𬵽𪷑𢪡𦉐𢨳쿐𑀣낂蓅𨫾詀𘃸뮔渞ꍭ𨦍𠞾䊊頓𤗴𩤪昈쵊浓𨦢𒔟🂑幁큤𪂭𧻘𭀸𪯚𥋋𘘞𫋬𗧧𬅏ᐢ𡻾🟔𠭇𬮡瞋賜𣎨𬷽Ჺ稰攘⬤ﯷ𥳚𥎦작𠔥鬃틎粬🆎묯崖𝂴𢘡𭹮𮂐𗆪𓏩覮뉲𡅩㍈𘧎롾𫽲𩟥𫋘𡴮匬𫤧侄𭏕𠉠𮆾𠙝𮮐꠰𦋃끣𪉬븒𥟣䳩𛋷훡𘪮㒗ⶁ𡼃𒋣鎻🅝븒𦪇Ʊ𬑐⋶䲶띶퐋࿐𬯮엘𧄦𪏋鑟檻𣨢𣙙𢼏㍡⯔𠯯㬺藝ꁂ𘜯殟矨𭊮𩬷죠𫖣𣉨ߜᢒḖ竉J虍陟풕𝐉끉𬆓𬆑𒈸뷽𞤆𞋑𣜙𫦴攧𘌴皕𠯬𬧶艧ꦲ𥨓룏埄𫥛蟒̮ꦆ𘤫𭈌𤢼䔂詥䄮𥼦𗧧⌱𥖨㙌㌃𗵦𘈼𞠖寃연🁓𓀚𨭔∿𝘭ㆺ𣗲𠇧苐𨀢𗱰𐒸𧫌踄䅤ߍ헷䌜𡮡𤵮𖾝𫶤𪿡𘇒𨒘쨵𭔕𪁧𡋢𣔶ṭ𦱠𣱡褿𗐟𧴔蜋𧛚ら𥇧㳅菼窻𗒦ﱡ菉𫂲𝈓𡏌锹𝇚𧄰𝅖𡐏𠭋𨱕𣳬𬸉䓹𤨱𪞫𒔣𗩬俥𩖿勑𩆠𤰇𠄁𨞄팎䥾𧏎慚𮩐䬂𫶳ꄢ𥻛䮁禲𒃁𐨀韺蹍𧵭𤹻𢟦赓𩐀𮋫榁𡵦ꞥ𝣅𧍿𤽑𣌸䮹𦸙㜝𢷒ၲ𛇘𣐎걔愌𞹶𨚦𬅌뼢𬜉𡤢𤽼𓄬𖦒𩘠𧫹휳𡦿㷮㇞끤㥋𦇖𥈠ῗ𘅄𖾇𩋄𥼀𥉎𨾽㨮誌澕𓎿𪤋𥢉𨂇嬌𥇛𨈉𫼚楿𬱧𭷍𤧱𐃞𑋋𬑌𠥭㽢𐌔ﳿ쩆늬牆𥢽𝑯⮡𡨥𠨬닦𠫸𗑫𤄈𭗞𭶒챺㔢𢉊𧜍衭𧞞𝂦𪸩〸借𥅒쓕𗈫먤𗽕𡙉ﻈ굧𩀡蛵磌毋𬫻雊𤋎𗖕쌰𢤱锄𤙸퇴몪𑐞𢆣𥐜𐑼𒆇ᣱ𢃗𤽌𫭫𢽐譹𩜍㫵𥶇胆𖩥𣡎瑈펳ꋺ𬶔❍ꀊ𣐀⋐𡎱䪮𢛃𫖃럝𫯣𦤂𡦘𣢷𥉖𬙷즱𥆬𖬒𦚩𫎍𫚩◰踙譫灰匵蜘᭻𨄞𝄀𖭕㟆𠳄𢑵웿텲𦉃𧰟⨮𩛝𡘜𣮒𤼭𖢗얡ꪣ🙏𐊺𑅮𭿋쫵𝣥𢭰𢾊𦒹⯁獩븳𐦭ꏂ譵㱚𬰦䕔𩝒䀩𣀞𭴣𩮺閂𘫙엹𗇛𫯬稩ꆂ䵧𪉯𑂌郎𩳥𐠕𤜁𢞔艽㘃Ȍ蝳釬ꐨ𮜘𨿥𩈋𮞍ꥄ𦩢𣺑𓀧釨ྺ𢃀𘨒𦣜햢𬝝㵇唶𣏴𥴙㒌𡸔𡉠鋷刓䦛𧤔𨋽䲑ᬨ𣬊𛃄𬚎𑋡鄍𩑿ᤅ𥄡ᦅ𧔋𘄂핽眵𤌚䡿樛𪳸멦喝𪋌掿Ꜽ释𪿴🤟𤀳⡓倫𩡃繴汤𢈬┧緂莣𗺌鮨앾𗋋䖗プ𦧛𑪆㤟𥈬𞤚ﳧ𐮩斋檩𡸄㓤𢰐稈𥎩⅚⻱𡈅😍銆ʮ䏘见𐳫𗯓𣑘㓲𮔗𧯯𣑒𣊬렲𦤵ᆀ𦉊𧏳湓𩈖濾𡗧ꩍ哏𩮄𨚢픬隶ᄣ폨𥧖※𧖬𡦷𣼸𦇡𡀈춾𠱟詳𭴷㋽𗬠𪸠𥾁撾蠦팺𢸬솊𮛂𪈭𥬑ⶦ爫𫻢䍎𤖜䭽𐎶🎎𓇩𑴽䴄𑃁𪲙𤺚🙱푂㗌𓄠ꢅ╉𬒹ﰃꁰ𐄢𤑑䠡⧣⦔𣄳𢤘𥎚𩻢뱧煇𪹓𢵷𧫭ڟ𢋼𡑾帪𧏆㒭ﭤ推𣰸𩈐𑲙֕識쯚賿𤱏𢸝罢𢖊냘𭡢𓆂忎𨤕𮔲𝖍𑱔潞𭜤𪸁𪅲🢅𮕫닏𨽟𠵈𧢪𒈶ᴊ樒𓌏棣𣀨᾿狍𘦓맭๒铼𨛬睳𝖌𛃮刧𗽨⒦𬲅𨢬𫳲ࡅ畺鉎𮯜췔켽𬄞𮇜𩱬훅𒇘𥗙岿ᷓꌋ窒𩝀𬑴𨅖뙄拲𨆔狇𖦹게窬𘖥𥆕𤎸૨𪿗𠫲𣫃𢪩㣎𪀑𮙂𨋰뿐𘕜ꟻ㼫⽯㰕𗀖𐡔㫤笕鱳𣂀𩭔𤿾𦵉쎜𐢛䤦⸬줋鰂䕽𧾣𣄋𑍬⧃𫪭𢈳ｦ篂𦣙𮇰𧨍𭞰ꂖ𡦕⌨𔖜𘋈뺇崨🕂垏嘯뱆ᒾ墖䌘耿衏𨅉腔䈦𡦏𨔙抖𒇒㖣𡕂𩞄𨄻⾫𫝬𫖕𖣻𢿝ꣽ𦴭Z𖹭ףּ🗗퇀𤏥鋒𬔮𭕢ၯ𥆮𤝊𦂁⽛𡫵龺𓅦𣅎⏠𨱯⤓艫마𦧐𧬣蚨篦𮜊𬧫刬ꦺ䱍𠿩᱄𖬖컷𩸚𪂉𑚨𫌫𘒌왍𧋮嶜𭺋𫙴Ð⼍𐭩𢦣賔𪃃𥽇𣕝䭎𣹐𢊍钍𪈎𥠍䔽𤶦𥌘뒴𦅄𢚈ꅵ𝚠蕃𪙑𢽪𡷕𨋡婏꽳䐻𔘆ዱ䡎🄐𢱶𨚋𠝛𝟲睕𗂟侜𨓀ᨦ𫚰힑흼垘𪁧𘤭湨𡛽ඔ𩮐𬡰𛉎〔𤽐㓎𭊝달𘏀𬅊𣥶𠨋𐌮蓔𭚟𧋋𤐨𞹡𩹫𧭪𪩛𬶬𗋫䮉𥷅椝𗹁𬋧𞠍𩒡𢬨豎𥄤𬲙羧𣻟ﳞ𡼬𬦛𓀵𢔉𬯄ꔍ𡬅𤏖警𨇮糒ꃃ𐧆̈́𡗑𭛤𤿂𩢼㰎𗹑𢭞𫦈嫢뛽턃ￊ廂𮦠𣩭琷䵆𮎑𒒉𓆊𥨶𣮪𭜶𬴇𥡫⧪𬖑𦖸𫇏넅呷䱏𝠲䤘厼靡𢠘勼𡑉𖥈𩽕𫫳⧵攧𫒌𧅒堏𩑄畅ః𔗮𣃞𡶔𣆘措ퟚ𗻊𨿴뛕ਤ𤉪𢡲𘔘탟𦩭𨋼𡖛𠍣嫖纽𬩗骠澅🩨𢛑桬𖨪𮩬𭰜𨺩𧮫菐𣩌𡥸꣙𝃚訯ẫ瑯𝋱𦥜𓊳໐𡹿㨐𭾿𠊫𡯱𪕔𗾗𡃇𘚔華𮖸쵈𡜭𐝓擝𛊈駙ਖ਼亸닉𪇹𪁧𫂁떗𝀾𡑏🤙𣰐𝥐𢮍𬦽𠜜𦉺𓍮𔐎𫣠▴𢀈𗏬𢭏𫸍𦣛𭖕𭳐覯䌫ڹ𭛷蕅䖉𧳰𣁷𠞰𮊰𪑒빝𦯐얌◾𧶼ᐖ𥫳𫚌ډ𡶲𛅤烳𣷏Ứ퐌뎩𣸨䞡༨𢣗𥀥〴袏犲𣛞졑캯喼𩄭𘡙𠉼𑒯ᩌ𥮾𠚤𗲂𪡏ވι꿦𝑥𒅮𬴓𮐲暸𣸻𪖺𘑖⒙휜𡭋𨾀禖𨓀𪧃⾣𨤂𐴠𧄩𦖇𞱵𗭁ה侣⫄〘ᡷ𫕊埾𭔦赣ၭ𠝑𭺭𡷼𬽌㋷𥷂莏軻䠿飢𭣘┢馿𥴮𩌜丛骢🌁߷𫺣𦻀𑁛𨪷𘓚𦠯𥖃𩅰𘝓滷魽𑪙𪒲𓋜𩠒𮀈𮨨𪟍㧔㪁𐆁𮜻𧬉纘㯹𘉇⺥ꠥ𬝒𓀞㌎𨛪숟𝩳㍊𥑙紤𣊣ﶷ誏蓳븎𡿰𤛄𡟀𭆨ᚨ츦⸣𝞵竬𑫍Γ𝢭𠪇凟𮠶𢋺빣𦅀𑄠ꉫ𫡊🢁ര木헬뮑𦗋𐂃𢆶𠴽𐢀쪛𧕜㛨𤒴𗏋剜𬬜請繣𓈊𒀏𣍋깒鱩𤖄㓏𫘯怓𦩖튂𫬪𢯬𬮩鲐𮛅牡𭫤𣞏싉𠛼𡬺ᠪᜓྼ😛𦊆𒐇粈놟𧕍Ὣﾙ𩸎𩴁յ㊯𣒌㱯𩨱袠𦡙𡤱𤍸௴𢙅傃𣿾䢱乶𘓑𧡪䦁𗍀𡝯慚㧍𗄏ﮗ𛰱𮤰𬼬𪲾𑰱𫏽𠛀𑶖왁𝢏𡆻☀𭈔𔖨𣟐圠噞芥趖헬𪚆蒰㎿藇𫋶ⲹꑍ𬓠𣮬퉞𪺗𑆰𘩰𐨀🩅𞢶𦷓𑱑𢜅貕𣈄𬍇𬃁唗𓃗𛉇⦮튎𮘩垈꺲𘈚𮅁𤕦炏绔镁辬𝢏𠛑苤𧚅𣰼뢏𧑡⑼𫟝𭸏𗖂𢸐㢆𤻗甅𬚤鈇ᢦ𠨀𤚌𐇽𘄞ꌁ𪞯㏋蚛掙猵𐍫ꚇ𒀠✟윮𩺣𤙘ዖ𖧷㔤𬌱𡏱𫌸㒯𐅩ᨤ碤뜅𣺁롡劘𪙮苣ꥀ鮯𧽠扟達𔖉窖𭍢낮𝛌𪤱𨇩𥳟ᆑ泯𫓉균𨁉𠥌𬻐𫛳侊𠓳𬛗冶专貗㐏𢰑𣪜𡶭ꋩ𫯛㈽袤许𬣉돱𨖿쭚𗖳巍ꀜ𥦁烥𫜙𣬙𥰛ꉊ𠶼𠼱𪯝𧫢ⅼ𤧴𪮧𡘟𩗽𮣌𢍹ꏿ𠆄뼇惩㇠𝡍𫷗₈ඈ𢦢訸尗㪩𩣊𗈇︺𑌘𫓙𢕘𭹶𥚑錤𬛗♣𮭀盎𩔆𠸷𭭟𥵍𢿧죔ဴ𦋄篱𧰔켽𐼺覄픉咊𤅤𮦷摐𒅘𥃈𖺈丿𑢫㝕𓆑𖬪兖助㛯𐲙𬵿⛉㾡樂뼆嵼艌𝍯𘩁𮂍吰𨿝𤾟𘂣絬𬢩𢓧𥡘𢰆ꬂ𨗳𧍏𬫫𢒎𡹢𮅕𑁞黦犯𨸐軝󠇞𥂧尖𩧪𩸮𗾥𭆊𨘖𑻢𧔄𬺶𑈚𩚕𪏁쒪齚𘡲䆈𗂆𧢼𞤉ﾩ燯欛𤵍栵𪻰햡溹𪫦𡛎ﲩ𢬠𭗳𬏧ᘠ熇𥚰툥𧋉𠔹𢀂䩎𗡫뻰𥌀𠵿𢎇𗢃ᾮ𠿫𮅞ꂣ𑚛荁𬑖𢐡踑𣑝Ŷ𨷞툑𣇬𭋵𧒱𮙩㡍𘅚ㅊ𬣖놅𧜕𥩐𧿋𪗜📏㪒Ŏꭜ𬾑ꈒ𝑹䷬𪌿齀𫌺𩆣𠙳𠼤㑖덿𧪳𦸎𫆧𣷱贞බ𘫑𧠪𑅟𐀳굟𨪱閻㽳𣮴𬟡𛲝𝈑㲐𠃕젌𢉣𩫲𓉴𦄺맶𫡇ᙗ졹𤠮𤎨𥧍𩹐ጰز𤘩𨠧𭫐鳊𢺛𪫎랷𬯅▦𧏕𫫍𝚘鰘𠊔🈙鮧龼𥧖𧲗𐇼𪧶𭘬𡻵𔐳𢱃㣻䕊𒇢䋎䏓倞𡚼𗌍𡇘𣍟ṛ𩿻᪗㝸ç𗱶鿡𦴱🔠𘕥誌䥂↶𩌑뽙𢵏㼣𣞾𬣝긶𥛃🠖𐎷𗸔𗙅𗍸𫤃聤𠗟ख𬄺꽖闑𘡳𛄇𣎒𝦅ᐖ𛄊𤣅𧋙𪝅𨮻㯯𧁵𤤣𬛜Ɵ𥓩誏🛡𢣧ᇾ𫘉蝨𭬖𣏔𬡤𨁷ꃏ𤞞̊쎥𢃢휇𐓳俥𗃚ᡯ🜩𫨱𧌕菉𫬕𡭷⠸𐓊𬺑𓎭𤚕𭁁儋𨴪𮉄ᯱ𨖃⟉𣗌յ𒓧𫝒𘜼𢆍𨥽ᔌ햹𦾬𣽀行獂𥅒𬨄𗡑𡡩嘈𦟱𖦔献🩪雊𬼒𖬪༬𤮦Ṥ擏젱ﵣ𗗜ጯ𭪰𫘁葒ޑ銤𐅭𩈑᠂𠭣ఏ𫹭𗖧𦟥质㧠𫊯풂꣥𭖄暗𑊱틘𥛗𪮺垨𣥱⼱𝒛𦆾𔒧𓂀𑰒𩘦𫉤𬟇⼉歓𨲿⛩𤮆ꎼ梛᧱𮒱𬕟含𤈭𮆛愢𛂏𐑸얪𩉦熞𨎗뢅枨㦰𥘡孑♀𭙏鏗𮬨𡎟𘌨𧮒Ꮆ垼𫕲䦟𘞍⬭뽙𧝞𮓏𬒇𪫢𤥫𘙙𩁐𪓗𥔙𓊚᛫밓𗒨軆𥑎䱣𝐍䝑𪱄𪪗𡃗𘫗𩱙𡖲躱𮙨𪲠眸𫑴🖧𡩞朗恮隠奈𐧚𬝕𩑭䏱ﻈ쐗Ỏ뉶𣸵𫗨𫼉𥀈𗛸𥘺𦔼𛁻맆㠎𝞝𗄼𓉋𮨿𭩿𦨡ᅇ퀐孲𤒪𞺈㮥蹰𠳯𛂂𤘉𭍬𦡃𮆄룓냹𥆐𩟉ﭢ览𩄧覓𭫇𒁀恩𗨴詄氖䮐𪋡㩻𩐛𨫧𢇁≯糭캝Ḍ틓🀂𪬼뇱ꋕ𦻕𮁒絉䣏𤺦㜷讽哅𖨡哢𤒘ᑙ꩒𮑙𮫛䐁캘𩛛𒊏🥥𐓬⬱𠏙㵜𨊲聎𫮽𮣪𪵶𣞇꓀ꏃ𥡝𩌣𩿊倒䖈𭉹👡齑𫵬拥𠽺甇𤋒宰𓈾ྙ𘒁𢊚𦬺穃𠤳콟硙𪚻𗗸𤠅𠂱𗙊𐘙퍷튡䃾𭙜䐝𖦖餶儱𡰡𫈲旂𥅍𘞡𗁥鬿𪡅𐡌𢄢𒆤𑃵걜𧯪𘉘鎼𠟄닺𤴁ਙ𡔚𛃐琛࿏𬄵𨮭Ｗ𧅄𭌋뿔𡍵𮨈𮇥勬鏦𐡠쭚섯𭟕윳⟚𬗆𑈶𫞱շా䁪堳횹𝒩텼𤀺𪱫𖥻𗣯搤蹢𪖱𔑨𨖻𡍷椷𫝢扞᥈𪎢𐬎툡𦜦𮯂𥴜𘊯㴚𫑻䊹𒌄⸜댌𢆃𩽗𠝦౪廫䍈㸯𣮐𝙃𡰑𥴙𝔉ﵡ𤝒𠵱⭺🆨炱𓆽🍵𦰶𤩎𫿩憺传𫂋𪟥𗑸𬧹빺𫢌致㋆𝛌𭷹푶轭𡥖阇𫣰䫥𭷃趽渤꼔𬔾살𦤑𩍼𛊊க𩬽栜𪋤𐚀𘎘屨덴𘌣𥱓𭈧𭵂🞂𞸝嵲𢸖础𨉦Ѵ𮡮㱼症깴🍺쮌청𣥮𐴄ヤ𧛖⅍𣷚𠺄𤏢㥨𭰵𩰥퀾𣂠𐮁죋𤄕胱𢲖𩪅볺𭰁郿秨곛筳∳σ㯠줐𠏨ኃ歧𪴪閵誸🐟⃩쏗𡒏𮇝깙⪌𒇗𥔋𣾨轂𑦽𭯽࿃𧜒𧡸𡜏𡄼匿𬚤𭜙ᠵ𩫞𬋠𗛮𘊥灝𫣁昐軤𥭼𥟯𩗸𔘶쥪𦙦𪀸帝🖽䎊欬㻲𧫃𮢴𡠌𤽳௪ኵ𦘁𖥓𨌹𦊗𠱹𝅘𝅥𝅰𗀈𭣓𖢌𧤩憎䥓𢸰𪘾𣼅𒉈𧨑𢑛淠𣃲𥟼䦆𣟅𡀋𗱁𪕤화𬉬𫮬𢽼𪡰𭀨𣘢極柞𫷒ﰥ𪁉𣟻𪰋쳉♈𢑝𧩏㗧墱퀃瞂𪿶∎𭶪𒋝𡠌𪨸𣃐𡚓〰𣚊𥟨և𫄳𩾞𖽰𘨩𒃒汿疱赒䑤𠏫𑂘𣲗櫓𫮮셨𦖞𘖮𦌛𖫬탽🛶𨗐𫖑𢍰𡗝☴𫔤샨䤕𮡪𠽼𩃰𤚺ᲃ醸랓籍것로𫜜𬿧𦹧멆킲𐎢𗮱䴯㍲🏟禂ꕦ𭸏퀑𑘨𭰀䵌𪧷𨣪跽𗈼𒑬𝜝🚖𭸢♃𬍄巛몘𡥔𫲶쁻𤯲붢ὺ왂豦𪹟𠡫𝛥백懂ᒒ𪧀𡦸𑖺𖩗怍📊㈆𪚪𛁣𨷨팀𩽺𢷆𥩴𗣖𬚃㬄䙍𭨵鉹𠨟𪂱𒍎𤽏ℤ𠫑걥겯𩶝𘄷𠊇𩛆ὶ𭞐𥔞ꮍꮚ颭𤎣𣺻뚢𬦐𩧩🏞𬾒ᵣ𡪭𥿫𡭁𩎞闥䓕𪠬晉𬤔𭭿𭁃𨸺硇ೃ𭢗𦝔𣃣𒌯𪎱𦸱🁜𤢂旯𧵕𡭔𮯛𧢹ꅨ𝅆哫⪱𢋢䅴𪤆𐹾썇뻴⎮𣶔𐛮𣝨𢌻𝟂蟛豋𭩅𥲩𥤜ᩜ𦔇𧙹⌡닷곇𭠶𤶏𪐾𨫥㟀𢮓𬑁𡀋𘔫𥀺Ⴊ㤺둮ໞ拾𗵝⫉𡖝릆𠕟𞹵𝣓𘐻뜔𘧥䤙𪡄ฎ寓𪪉鈀墍𝐞㐞𪑶柒咴𪤱𠢣𥁸𫥻臖旹詆𥠥𥍭𣇥𨢨𬥹줸䯪𥲟𮑣𪜍𩸜汣𬬰📉ᵵ릧𢲝🥎𧳲𧢔𢢷𘛁𧿗쾘𦪸𠑁𬊆𝜿蠂౻𭾎𧵼预庐ᜱ꩘𨇞䐹瞹쪳𐭍ﲂ𠜅🨑𪹑𘇠𢷡㣇𩘷𐎵偶𠍌𮩵鹕𩢸𣍅𩘜󠄥𤁙し𬹊牍搽𪇗⫋䶇𨨕𭿆꤄𧃲𦙪튺𫋐𡽧𘘤𡂚㨿💋抰ꑑ揅㬮𧿿𗎠𝡩𩠫𣿢𮍖𢒂𐋴쿩𖤂ﱕ纈垑츇ꁶ𨵯𐳨𫙴膂겻등옅籩𛄛𫟚𭘓𠒒ꗛ🧏鼽霩𡼭㋬𨡙𥈥詸雫𬃩𦦭𡌰𐧨㎅𣡤𮭞𥞕䱧Π𮜮𗱏䬻ࡓ𑫞𣸼𔘦㋿𐚂ᶬ裐𓇖밲𠛣ꡗ굩貎ꊩ𒈃𨋾𣳥鋾繒𮘩𝜴짢𦸏쒊𧎩䊛虾𑊔疇𧭤㴈繻𨀪😢衛ྋ휟𢂻䏾𩁸⳽觼𪫦𭭰똧𘊋𧕙蕬寏雖𮠡𥌤🗮귺𨚌쯋⮺𭟥𠤎ℇ𥥴𬣬𒉜𤔐𩕕𠐦麇𬖬𑜃䓖檣𖡲𮨎𠅾𮦬Ὰ餋凨≌𢋗칩擖𘍎牔ƈ𐌸𛁬頎仛𭣒埿𫊄𬪮丛틱𝆤𘜌𝖐𣼂𧠵𣘔𣆵༦🛐𭉰𣪥𩜻𦜈᧡Ⱊ냵𓍿𗬑𣹍𭩳ஈ=𢎮𫕶𩙜ꐋ𭁵ﻲ說𨰈𗉧쿏≢𓅸뗢𠻋꺱̇식ꖅ발𗎔𪫌𨊫𪋊𑐈𤏌眮𝥯㾋𑌇⒔壓𫌡ᘨ𦵿腚苅𧥥疽∯ⶌ噦👨𫭟ᓖ𣄭𧸩𩂇𧇛ꖌ𣵼㕯맧咭𪿡𡍥ﺢ🜎𫉸𫀖🟉𥥹ઇ𗶱秼ᕰ𩿣🔧𪳍𘩞𐫥完𓊦褐ʬ𩰖俥𩏎𑌽㽟𠄮䅊𒅱﨨𣘐𭄙륞턣𐹢𠲣𣇘𥺀𑩝𠭴毂𨥃𞢫𠣳𐼙𠷄䬜𦦵𗄾졖𬰊𠜻𐧠눒𠯫𠸯庫𛈅椁冊𭨅𮜔𧦞찀棵𥛺剤㡚𧻽ꗹ𐅣ᨏ𢔋㖞𠅵𡹦𠭸䎂𬹋𝍭𪳱㪢𡖴𨴘𠳗褋𭘠𗸟䮂𛇺𣲥𤪖蠡햭𥢴萹偃𨍸𬙆ꙑ𧄋믏𐛸𭱤𣨰陑𭿜𧎿𫨏륵溶𫰂𐄯𭀕𗫰嗆𗔱𪵎ꕟ𢆀𭤉丝𗦆🜃윎𥔼𢋘𓀗皦扢𞢌䦙𬮶𒉜鄑碸𨚅觔餱◲잒𭍉씣𪰙쩻𧼨𮟑𝟄匌𪚌𡃵𬟳𠘱➒𦥵㿝𨊜𠍳嚝𑈥𠹌ꎻ𘂑𭨚𐓘𬜩ⱪ鳲𗣵𫾱ਤ娵𪅓즳𢸤𥞽墿怒䐌𬗘𗞎밯𘋬𬙒𩱐𓄽𫽸𫅾㊛䕎饖󠆔䣿𑘴𦧚𧦒𨛛㢀𗡡獇𘖎𨲠𒍞𥩃𭆳𮋑𩪟荌𢯎ꮃ𐎋䲂𧉍𥨉䄼𩍇𪓇𮬼𩯅푮𤠁ꌱ𣍡𢎪𮎶뀞𡙾𐇡𨘉ᥬ𘟔𞲫𗐼🈶𡺿𑖻𭹢𥽀𡴺𩛞𝩘︿㧂𪤎𫆠𫺌𢍂𡽜뭅𘋱𝚕𭱖𝑸耰𦈸㮠逺𐰢𩕾🖽𝀝𐑯𤽹䨊줭𮒊鳃𐝢𥓅웄狩𩄣𭻷慈𠇵跫瑏𪷞😲䜕🨢𪁺𨈰េ𩗺𬒞𥟹𠇷욤煔🠯𫂒螬僄瞎❂蔩𨚶啲茳𡧑𡺶𨆶떴诶𘂡𨞭𠨀𡖅떱𣔮빵𗣱𪉤祸𦈵⍤玤𠇁𓉅𬽯𦖕𖬧𩴁癴䠹绡𩉍䡺𪉘𤂪𐋰⭡Ḹ𢥷𠫣𭮐螩琉🀼霹𣒂𬃺搓𒌥𫉞𘌸鶹읒购ퟋ褩𠳎렻𡎚怑𨆨𗙰𐝑𡩆𪍃㔦棙𪠬𭇓𮀨葱𐎁𣊡穊𭽌鴹𬳪༂𦊣ꦽ𨑧𭱑𢲪✩𪨾𮎄𥘟𒆀𢉨ਥ瀢ⲱ謇𤲥𨌼鷬𨟰𞲬𥍮𫓉𠀧𢣕ㅢ䐇𬣝𩁘𓍚똵𒂦𡩛𠔿𑣖앪𖦎𘌠𤠐舱み󠅘𭿷꣭𩃬𥩭렽𗉂𮘚ᇸ𨾪𑆐𧷆쑋𭭑㚤ꐙ𧴎𦜸အ𠘐★𥐧罍𩕸𡏔𦲖蠉𬸣𝆌𭘌湉咎𤸅𗇔𝆪搂𝅆𖹤𧐕蘜𬇩툕𬠙𦓔𨡰﯁𭂳𫽿뜉𭯼苯𢉆𬎎矼േ炾𘞏𠽻읆𦥌𩔞𬎅𦮀焸ㄣ𦓵𥮘𘗔壞𐎃鱌𤩱𘂰𤠊폡ᓕғ샿𭃕𫑻𣸉𢲄ఘ𢢘𢐇𩬰盌𤹉㗆敛𗨫輑𨙣𩶬𭣅𧛾𧬐𧣾𥛴𣜜垕𮫋𥧑𮔼㕶𨖗𫧍ꊶ객ﰤ𝙲부ᢪ將𦴖䮌𝐇놋𪷆⤧𥂲𗒷垾뾮𨮴𪔵𩖠𝢱𦭾犑𖬱킋𛇁ᾰ𪟺🍃𡈑𗋄𡉛Կ𪶁𡏨䪒𩔣⟢𬇳ᗗ𝆦ᄉ𘊎𑅤𧿗𧆙ﰗ𧟯Ῡ𘗞㳀𮁌𑵸𔘧𪗾𤆇뤄𥿙𠖇臀𡇅椉𫾠媹鈶𠄋𫽽▙ੂ𭻙𛉲𓎖𬱝𢢻𢊘矄𔔉𗌫𪻺ޣ𦕽ᶽⲗ𬯕𣺚🖥꾃䈕髏𗝎뛣暒𐓂𬛲𫝌𗐙𪅦𥴱𘉺澠욊𥍌ꈣ𨒉𢒟𘊌𗬻𫝲䬻𨓖𩧄𗞒𤼪塦믋𔖂𮇘📣䁋三쿥𦍌𮆄𧍇㎬🃤塿𢞌䔺𨢃쉨𩇾瀧𬌧𤞿䕝𪸗𭞫𫸚븠唯𐣫𒓽箢𮦭𭩓浼𗠩눒𫼭Ⱐ𠢮𥅇𗒒𡓒𥑡𘠍𫳎燄噸蜰𣢅흎𫼘𧒞𘎗𓄪𨠒𨸁蝨𧛸🔚𑄙펖𘝌𥚬𘪷𢭬𫇮𗳽𘙟𭠱⭇燁ꝫ龮𠥄𡇗𓄉ꐆ𧠁♞⫗ᄋ𬒛킗𬵔餪𑋦𣲊濬𑇕𢲲梑𭖗梤撲丼𗸷袁黃筇𤅙𥣉☕𡃈𦟰𠐜㵤𤺣𮡼𪵕붋𤣿𧂶𤧄紾𭽋촎耨𥝢𣍜𡀶𮥡୨𧪕睌ᠦ齭𠐌𠶗셵𠻆𨯃𩳫𮙁𣙆𡢺ఁʋ┱𪃻𡠩𛱕𑫵𤥿𣚰𦈪𬯻鱕𬀤ก🍡뷢𠨗𧐹𨱀퍪ᑪ𗹨𝙺ἦꝝ𦩬ᆧ䛂𫛟𦺝🥓锜𠤝𗈣舌𮞷𥝸𩍍𠉅𗍂𭇦ꖄ𣆞ⓧ箶𠪖訮伿𓊩𡻿𭽰𬃎未𨗐艭〔萤𪶐馁븠𥻲𣢻𘨁𢆿𫉺𗽮젯䒫𦙃ﾦﳏ𑣎鑵𫝧ݺ𩙉𥳥𒑋ܗퟗ𛂽𭦡兘𮀪𠫙𮪠홼躾熞췓𢹡𤝾폠𥕣𝖼𐲟𬦩𡙨𠄬𫑕𩐙𪗵𥝩횂𪭭𗻪酩䨊𮫦𑄫𭠦᧓湍鍂𤘁𫰶뙹𥘫榴𗉪䙶쬉𧡏≥𑫚𫭽瑨𨗲𪠯咠𢧝𨙲谞𣳤츊🆤𠺠𨋙𨻈💲𨍯𬴔𩡏𗬬𦱟ࡀ𒐼﹙𠿠찒쬝养𝜊𐄍鐄𬈊냖宅堸𗙦ꥹ귫𭱌𠞧쐧𦖡𮗑𫪖锒𨩇𗽝𩏝𝩥𢅠뽄칸𠆜𬜠ꖞ𡛇𗮢𮇓𨳶🉠🁤𢴖𥢑𢋷女𭞌𘂇𫫥𝆚Ꮚ𬩴𘎙𫞭𩶩𤜌𮡁ꖗ𩸨𒈃𖽰𡆣숸𐳅𤑾𠔴㵏𨣞𓎾螢磱件𢞚劷𭄏꺻挎𥞘鴾𝞶粖믦𪴋뷽㡼纼𣧑𘜰𭙢𦂪♥𢶸⌏𛰇𛊪𖼟𝡵𣕖𦠵璫𨇉釛耘陁𬶽𠎍𡩌켨豆𨱪鿧𮉾𧔂𦕎𣥏𨁖ꝙ𭼒𠪂𦸰𫥒ꀙ𠌒ṡ𭠴𧬾ꜻፃ閧栞𮛶𪭂𦾲𧍏嶾𥨝𭫬丌肋𖡉𓍊仼땁릡뺳𢨘領軜ജ𤖬ൄ𝢔𢖍憪𮦼草𨭼𦺆𬒹𩟉䴦ꤦ淕됰𮏱㠻𮤶𩰰𠊺𪉜첥ᇄ𬇠噒𧍠𗆔𐒸𧉢鿣𨬺𧮈锵ﲊ𥝚𡾮𘙜𑂵嬥𫪧⠙𘀘𢐫𪲚𡵬🏻研𐀈䛣토𡻈Ბ𑨅𘄅𝃏𠪨珃炟𐫵쾜𢅏炪𫖫𗡍늎㕕𨬪ᔏ𢉜ᾨ𥄦데𣭼𢮖䄻𩞉畽𤲖𭥨𠽪𑐴𭔴𧯞𘥸𘂮⪟𝙴𢌀䙜裝덃𧒖𦷂𖹄𭂪𒀸𫍮𩄴𝟆쥴ᵑ힖癴殸𤲧𝌔ᢎ𡺔𧰵𗸻𡘷䂟𞲓𡴈𣓘𧫵𢈮謻𪇼𬦩𐩩𬀷𭬳𨰫𧥽𬢷ꑜ𣜵啌閂㰱𦸆𨫻𣳥𠢺𠦯𡢢𭛨運⫧৸덽𐇲𨠂𮥽𗞁𮜀𠵔멹𩳇𪻎𡻁⿍𠿵𮚉𨄝彏𭐤鹩𩱃𧾴𮭳𧈷𮞟𡱱𘕈𥽸𫥈𖽀姈𑨋훋𑠒𠚆𧲸뵙ቧ𮁷𭳉🝁鄊𠚁𫇀𥞴𦅣𨴁𛀀巓𗏞℮𠵛🍯𥅭𪜖𥬗𬁄𧌖𧐤穫𡾜夭𣳈⼩𫕩𦘷ટᵑ𗭌𧠆𦤔🏜𐔁𪎫﨔𘐲𘠒셄𧤞𧺬𮑖ዡ싓𫊌𣘀𓃘𨟿왷𗙋ᕤ珖끤𠤨𘨣筿༤嵄渚𠵨샷ᔨ𮒩𦪿妮𑂳蟘𥎬𭪺𫆡𗔄📂𤾐𦕨𐣼𣹰ꙴ𛊡𠮦㜒𨙊𬣪𪤐🎖𐙣𠴲精춬ऑ𐱅腈𘛢𡝠梆𓅉瓝𫝉ெ𨏏𒇮ᱢ몳赉楍𐨃䇘𖼴𡱯읠𥁡𦡌𡌂𘑩㽖⁄𗫃琠᧿酰𐀙윛𬝖屠𒐩𡦲𓀦𡎱熃𢝾쁌㐹🪕𮁅易𮣍좚𗧈𥋍ꆼ𥖸𗍸𩉳𮒍鸣쪡빰폏󠄴ケῧ𣓊𮬐𨲟𩤒㶻巷쪭⡌𠝳륟𬜢𠭒𣢄𔕍𭽱┶𭏕푤𡻞𠪘𦘠𝌊洞膲ョ㑫絀𤇫闙𡫦म絽ᅤ𗴢𔗻㵂𫸌𤊌🩎饙𝕖𬢭ᖱ𫸧眙⛯묃𬑴𤛼侵㌒𘌦캆躛𢒴胒𡒔筚퉕𡱕韼瀡찺퍼𐘻𤱹𔖙뼋𥷻𪵓ꜰහ𨝫忪힑儽𣑛🙙𡔊𪣨먊𭺘𑁖瀹𗁩𮒱䇱𭾨𢉏蘦𠃗㒙帷𥞆趔㌔𗉠윆攦𬺗ቨ𘟱𗐲ᢔ𩙃꾊𩹖∈긃𨬖𗵏灨📻𛈻𩌄晸穝𥠐ᒡ𭹪𧐽𗷆鱑憲𪬜醪픚𭗤𗫣逄𧅹𡗎𢼈𝠽あ𮀙𨘛𢛯亾挮𫪏ꛧ迡𝪋𠉃끔𝂡𪡠≽⭁陞𧾍𪮛🂱𗈛𣖹𗢷𗹹𐅁𢈷𛆋𡺺𡦡𪨔𥓐氫专𪒸𬂞𣠋𮛿뛖飄𥛂梧ᚘ𝠓騖𦍎𗡢纡𬘔𗭈╮𥬊𦲯⫿𠓱ǩ䞑㖵ڽ𢯔퀥侃붴㳬ᑆল𑁤謎𤭮𢫙🂪𬹡𪗔𠔟෫𪕌芲𠞭𨚿⩐Ⴋ쾬𨒈𖥏𡤭𒍍䇦𝠜㸶찔𣲓𥽅鑸㘇𬎼礛輌䅢䊝𢡹𭦚𛃋ﾤ𠈌𖧱𝨐𫑎𑰔𥾆䱾𐋇𭩍Ƴ檿𦫖𡛾큸桗瞌𣘣𢺼𮮶𭠪𧇯𘥑ᯈ𬺝ᾔ𤏓❈🥈膊𮨪𦒯𪼠뿀ի쭰쮬𠇤𑖎尌𪝘𡱁𩢰鋿𤀐𮨾𣵵🗳괃羰冬𦨂贼똋怵ᅫ𩮱䔳𣺯耞⑦鼩𗨝鐡𢇛𣚹렌꜑뒺𪰮錻ೖ𧯸𫪮䕣𝂠𘕏槁ᤥ𧡿⇚𦇥𗇭𥎴🙚綧ᬋ跄鈳쏁𐬎ᷓ𥿅⩎𡎙됏𮝣𝞃⢥友𭤺𝢸ﻚﴡ𘡼𥳝𩗊𭁐𓌜坂ꂍ𧅾𧺾ᴐὛ厘𮚐𠺄𣣒최𤺺𡉟戄숝𧎮𤑛䌅菧篶𬁫ᓪ𬙐𩟖︷𤁴蒭𡺋𩜛𘜅锎𫊋𬑭톴쳭뙘𫱠ꩶ🗨𬮹𮟘𩠿鶊𠖲𘩛㹒䔽𠳧𗥒𝚼𮤮猕잠픒𫐰𧥞𓅿ꛌ绠𥱢𧵴孴킱𠼠𧺀帥쏣𥌹𣣰𝂡𔕞鷟𗺫獤𗛦𢃔쬄𥴗𤎢ᙘ𨺮𑇰𭃫擯晣᨟𦁞𠵺𧳢𠬉𨕕沽𤫵𡳦𭭡𦻈𩹲𣹩𢜢𢔼𝗐ό◦𗁒𗯔𒌿盄᭱𢬏⃭🝆鷗𬪛極䞴𔐞𗃧𩼼𝥒偃埐瞣𪍵𗒷𣻱澷ᆇ灚ย㹦㭔𤏈𨀆䃜𦞋㨜𤞙𧋽ﻃ鑃⡤⥿㞟𠊑𮗡쪟𦒤𧑇𬻄𡪾𓆴😾𢸄᭄𑣕Ὕ뉐𬜼ඓ硏𗽵𣾩ᗴ绿𪢪鑟𑚶探𢚄鸂𬨏𨇭𡈐ꨝ𣙨𧟆𫌴磬𪄬𩱵𣋖𗞽𐦊掴𩥰𦭒𫡆瑫䶣॑ꃽ𥐜囧𐙊𫨥𥚵缆𠂔𗢀𪢭됿𣽹𠈥𘌂𓍹𐍙𠼛𭆥𘎷𧝰佴Ꚍ𐃄𨊁𫠈𡶑𩂲్𥀧졼𬷢𑅠𧙸𤴻ὔ𪞌臘뵂횇𭀶鸹ኂﻐ靏𮅀焲𫧃𠐢𨓗㦇𧞫芨𦆇𘁛⸪𧦷ﯔꯕ𮛏⏞𩓺𤩹𭗓𦨢𐚖𠩌𫾆𣉴𬧃숩𪢑蒅𫢕𒉏𘛇ϯ𝟪楢䳉猠罪𢽎𫎲⊨𡷒젪먬竒𮅳벱𢺦ꋴ⠳썅㪓宆𓆆𫐴앥𧯙꼭𨡑栒𘞡䜄𑨚𑜗콈𗄴ፁ플ᶸ儦𢤺晽𡏯𐤬𥼓㛽ﭿ𬤅𥱊끥𤯆䧤簀赙𮊭資㎂𪗰𬖄鷺࠻𪨖𮇝𖫟𩣘韔鑑耟垕𥳆舨⅜䋁𮋥𥧜䏙⁎垡𨦉𮤨대𑶍뛜⻡𤝒𨚿ᡕ𦰷胅❝务㶐𢗀Ⱇ靭놦𧖆𗌶窤𫮉藊뜚㪺𩰁𧁘ᓍ𠳵랗𧳾瘨Ꝉ𠶢𨜱诌𦓳𫒈𪷠𢿔𧮑𠒇郎𪣺嶲𐭢𣶊𢯼𤠛𣕉𦫯𪡮㈃䕲㹱𢛆𠬤费𮔊𤹶𫁴𪾔蓿𡅊눜𫮄퍔㙚켠휱𭼆䰗𢒝𥊊𧤃𭿆𑴒𪒴𗸎𞤶𫯶𧤙𡟉ۖ食刴ᩙ룴𔐫娈𣭇🗆됸錃𥽨゜𫗤ﻼ𛄈志𨕻봉𪍋奚𑪌𣽠㚔⬖苙≊᱃𘚩𪈪𡠼䚮ƛ🤺𩷢⪞𤢞𡯯鯙𨜷𦛏𣮬磩𩿻𞤌🜖𭓅䫶𬷾𞢡𗍞𑿝纆𧋢𤂈灵𣹄ሌ者괴𦲆𥐌𑨁𨮠럛𤄶𢙽𝘲茷喁𐠲𝤑𠡵ꊑ𤄪𬹠𥍋䮙𠠾譑枚𝝭Ⳍ⤎𩧞㞼⪏뛆镲𠝮ﻳ𐎘刨𪴥Ꮘ𡈍畫з⺅苓𠁏䦥𬇉🍍𠌤𥤪𧮌𘞠ᙉ𭂝쓶땳𤂸𧶷𩈀龪𥴷𑇝𨻊ᩃ𗁕𪾃嵴𭐌ⅼ끮𥍧搟𩆚𦉉𦩉𦛏⩜𢲡ꅻ𭻾䘗𪳪Ṡ𗏳𤹂줵ㄓ瞺𧕂𖿢卭𥉅𮖤ᝤ𘀶𗾽𥴓𮔇𦇟𪲐䕰凢𝕱𩅦𦌳垺𪮞㵈𝔗𤐞櫀n𓁿𬽟㷔𑨭𬒾ꏉ𬋡𦉀𦦥𬯓𧧫𐓉𣋝싌𬌪툿辵𡄚𪹘𣌝굆𩧀𨹉𝤖𝔥㯭篋麊𠷂𦋩흳𣰪𥻡𡔮備𧠒𗕨𦔁𠩽❫𥷆𭝽𝪁㜈㽺𗬳𨜊𛰙𨮓𢎞𩹰ꥫ𭈒𪏾𐙮𥌇艒䖁뻟𮃂ﺀ𬒪𮝕䈭𗾵䲦𫢈𤯸𝢯𢧒𤿈𧸫𣦕𬸰𦻤ᬝ𬐥㴸𩔓𡨁ĉ𑚙𨵁𢟮𭵻𨤌摓𭷜睂𛆚𪭃𩮋䗵𠞉𦖔𢓀ক𝀇𢋝𣞑𐤶𡹄䝰𠬺颽𑑙𣾂𡶴𬙏㊩𠱹𦄖𨫌𗍧𢱘坁梲𢿎𭿀స𝆦∁𬪴𦱲𢚅쀐䘫𡖏拽𥑞𮎀𬱹𥩵🆏𧜂𦕆ဃꂵㆰ𡂇𔒑𪉒說𤥃戌钻捷恹𘊚壂ᾂ𘄛𩀖簶㣃𬦔𡬾𬫻颲𞺌𝐎𓄕𫓆𨂏𪋃牱𗌪𬋞𪦪肷筮𫊸ส挕𢜫洛𡍨𑈝蜎𪃩𐹻𥟰𢒈𠻌䃌줆𩍒ⶶ𫭪𫠹寊𥯔㳍𮭌𖧍蝹ꁎ匼嵀𭫐뚇𧥍𠒣녭䗯𠏢藐𬍼ﱍ焏𦍁𤁀𣳲吾𑐄▚𬈭䋙𪦺🨮𞴎𫬾Ꞩ驾𥒉ᮠ彽쥑⣹𥥟𭚷𢳨𮍃𝂙ꀍ𗪇𥥌䯞ꖋ𪍗𫘁𠒗𣈽𤊒遻䘉◲𓊗𬉐쯢𘢾Ҥ𠈚㮡𩟃𒌄羡坲𩈽𬪦𫔦𫹭𦺭鈗𨓠𐑲𫐝𭾶𣎳𐃠𮝐㌐眉𩏏䉱⪣ᦎ𢳄𨔓ࠃ𮟒𗯋𫍀ཬ壠𧞩凈ᔋ𐝂𣓯ϙ🖫𠤮🛆텡𥕳铙ⶦ⫍ꍢ훤⫌𫰪𩵜䓉𓌝⨓哶𠒋𤋾봊䖀駀𤯖𤱺𦗃𒈓㎦캮𘐯𫌜矪䒣𨲏𦘼헙𠧽𗈝𤡯𬈌𠍌𭹮棈𦧥䖋𥣿𢱻𐪑즨𗴄僚🠈겱𦅹𡮧𞺈𮬄𧪀Ꮟ웮𫲼㬏𘑴𧨡㈶𨢿ⅳ剦𥃾𢇇ࡏ𢈣𠮆𐆋𫿷𥣕ઇ𫦭ّ𫻀뉿𗺨藸𘢃🔈𦃇𓂂ﰸ𣭱ᡜ𨽛𧵬𩒐嬎𨪃𒓠𤌯Ṙ𦃟热딦𫍡𠼔𩍦ᷲꎖ𮥴𬎐𪑅𨾓𬘷𨒉𢍐𘁠𖽩ꇖ𫘉𧬀𐝣𩖪𦚾𤡐𥑞𬗈𩛑𨈎𬅡ⓨ𬱂𠔔𥏇𦃤銤ꇚ๙𡓓𖬟𨾟灁𞸴𪵆桅𨧪腳헴ẘ﨟瘚䵦立戇㴂⏗⮐悭鍊𒁽𫔦⇿𑄣𦎓𪨗𦝯貂疀ဈ𠟈ʶ䧪𭇬𮈬𤟨ಏ𪰇긮ᥗ葙ੴ𪙠䓼𣕔࿓햮𨇀𧋬𤭤瘝ﳺ䥴𤃆괆𡫶𢞝𨲦韣𪖠𥞄牤㟟㎨𦶿눥𧶭⥏𢡄ऱ곜𣉀쐃𭄪𪟭𡙋🦙艖𠤻𓁆𝓑쓅𦟂ᓁ鋗𭢻𥞽𗦔𧡃🛫圽𠍝𫍦粑𧣗𤊯佥𫐄𤾠ꨦ에𧞚𭾈𐡀𣨜몒ㆃ醫䀻聟𣳵𬥁㧮𑆽𐢍ˤ𦙍𬊸헄𤿾覎驝𡗦𤈓꾩𠃨🁖ꥐ𬅥槲橆ᥗ𗪥Ύ碄𧎸𣔭𦘾𒃜𤴭咃튇𐂺Ю𣐘𪃉ꖷ綼𪁊駱𡄠𤥗🀿禽𬪥悢𫣫𥙺𢈎缴嫰鈮𫡂𤋚꤄㶾𤧻𨦸𢳂攌𢥰ꄹ𫰷𥦀𥑹ᗞ𥊔𔔬𗿧𥆦𗗪𧻥ꌯ칛𝑛봺ᔚ𡕮𞠸𭅷𗘹𖥪𐘓𐇘𪘭픲슽𣮟쌾Ռ𞺇𦂤𡈰𤊡𢛅㓶⃪𤬅𤟏ᒽ𧥀𠁋𢂟𬆉𨰿𩕐𗦓显𗠘췾킪𡼭㑤𪦥혵𘋆𩏈ꍃ㋿ቮ𨠀𢉲𗢦𣃝癈𭏥弋裮𨿅⌍𩧉鏥𫱛𡍂𩶸𠄅㶿𮅐𝙏鑴፧🖝송㷄𢌁铊齘욟ⳟ䎳𫧽𦍘𗽡𩐪𣑰鶷㲈𭤷즬𬖉𛋆𩃱𤞶⨕𦽿𩡪𭥷輭𠢏𬓥𞸌𢭴箳𐪂鑮𦘦🡦Ԫ𠀑ᗈ𤇳𦈾𗾳𤾽ྱ𒑔𧑟ꌲ⡦訪橯㈭𣅺鬌둃უ𑊊ώ芅╄囉䎿𗵣䳝𗈞漵𭝴駰𔒏鲙𪂽㥗䐓᷎𦉿𨈔𢿧𤉀鷆ᢄ𘄔ᴯ𮫒𠁂ͷ𧅡湶콚ッ𢊃𡂌鴮𫎋𦵅𑖓蛳𤤨𬎫𩆐𠘥坛놨𪬛뻩𡓨𮙠𖥹𧼠𢼰🚠𨍻𗠦𞹺𮑣𠼺𩝃𘑄𤍝飄𡭺𐧫𝣎𭮛𘤸🄣𣗰綞ᆭ⿎귐筘𒒾莍𫖂憯𭚪릨䲍𤸑𖭜뤒華𢝲🜽𫮗𒉾𩽠⟲𡑖𦫥🕁𮣫𩭸䙲𮔡笵𗵫𡪤𑒡𨰾𮀬𭶊𬯙垭𦼒𣹭𝩿𘨂𒈋甧𞢜闝𤃉𦈪⻛魫𒈂𭅒𣷧蠋𩉘𐬻𠑌ᘪ𗒰柺𮨵熝𛈙츶🖎畧𫜜𠄌𨨽𤦴𮩗寧𧝈ㄞ賎𡙽𧜱𡶀𫷋𧕫𘧠懨𤻧🠝શ𪋉軲𡱵𤡮🍸䭇𠠙퍻𝦇𤴈Ʉ𘠕𖫬ɵ𠨬𡌈꼎𢋰𫞼煮欑𢚋𮧠𛅹𮇐𗼙㿖𦩏鈭ꆀ靲𣺽㐝𞋍𘥹ڍ肄鿆𔘠ᧅ𫔀𭑗狈𭖚먷㢽虞𦺕𠉔𧝝𘄻𥝱ꑁ𡅥桜ພ𪐉趐ﭑ𧡬𥉽𤾃𭏑𥖄𑐑𨹌𦵬㫺𬭼셻𢕙쯵𡲼𥨳𠬇샛𩧈𤊜𡧉𬄗䨬썲쾿𣅁𠸗乆𮏷ଗ𬸺쁩𡬪캸獠𬥕𝨙𧖏𝕷썅𮥣ભ쁹𗒦𝘺𪒄𩱀⋸捞鑼𬈐𩡉𨉹𥁠𒇹𠬝澵窟𦖦繸鑅𢣽𭸀䋷缮𥏔𗇀🂤炙᪲𫔒𗌮捋𩂙쒢𩷦𗽹𫅚𣁘鈼𣥑𠵚𭣏𭇄ꎰ𭘨𫛉沦๊𥚺乿𬠋𮡲𩌝鲻ང𭫠퀅╊𐇜𮡃𡼩𥏀𧡓𡼜𤂝𗰅𥾵𗁍𨐗𨊠ሃ𒐛𓇅𣟿𧇟𫜖屁퉴꼕𗱑𪣁㭀𗠤𧎵줃𣯉𣦉𨳌𫌿俚蟆𣰋Ѹ킊𮡎䒣𦤥㰎𛱔𑲠谜갫婝𥆁𤦗༛⹇𗘝途𦋘𥮊㜾Ů🏢术쎥萱𧡖䀬𗁴🞲쭰絫肆𮚩兏𢾌🔷𠵚竬𞡧蘗𤥋𣿯𔔄붂𢷟𭶹𭧬Ӱ𡞞𡙕𠌁骖𩮫𡮆𘍞𣐽猋𫞸쬌𡾆펜Ӡ𭐳璜𠘀𘘌𭒹𫈯𡤡𥸜퐅𑒴悼𧠤𤼚𘥸𢪧疂𤶛痬𞸅𮍫ꛏ沤𮭛𐠪𖫨𩠁~珫麊ꀠ𝡹𣫬𧚚蕰愕𭭴𪛅𛱆🖺뤳䶒𝔭𩆙𝈇𖦧𦵫𪏂𬻬ᄝ禁𨺐𤾭㒀𦝗𝧬𛈢𛀏ﲏ𦩢𬤲𦯣𦩓𑿏㚻𫂲廏╏敷𛱳𥭪𧚷𧳾𦗨ှ蓢̈́훊P壾𫱏𐜭𡰈𧝩ⱈ麐Ổ𛱵𫵽𧂭珊𖡠뙰ﶠ𞸜𡗶𤮂𫒋𥲠𬖻읻៍譑㥕હ𫺮鏏𥳕𬏻䳗𭙴𔖝豾𮍹𧤰伄𩜹𪑂𤓧뒹𥯮鸘㛵𪢯숓𤅳양烛𮋒뾪߶𨯦劖𧎉𬒪𠀵𩦩𧙆⪩𫶍竓𠰿𫕞韓𫏙ᶋ𧱂扭伭𩲫𤗦뢀␐𩅛𨻟긯𝆨𣟟𨔮𫢀煽𠡆飭Ȅㄍﭪ䔼𘏰甶迧𫺘𡃩𨜓𢑣獣ꍱ攒骑ۗ𪲚犷𣠓鄿㓉𗝏𨮭ଌ𢽹䒰𑢽ꜗ𘡻㉕𦅹𬋆𪎅𥮄갆𦏾톽𗦃𐬢퉪ط䢲🄾𗺇𠐦𮏤비導㛪哖㏲𫲇𦏎𩵍纵𢪋𠯟𪟮𥚚𝅂𭝮𢟄튛𦜖𐑄𡤎ⱐ𬩜鉾鰑𑙡㵰𐂬𪟣⯿旎𨇞덣𦹯ᷔ𐦝攍𖢮ᣙ𘝥𡶸𠖍𝤗𞺘ꅲ계𦆸𥆼磆뢜𘞑こ𗾸𩜺遟𠵓𠑸䮔𩰒𘦴燬𨑾𧲞둥駮𬇩𝩵𡟇𠀃𬭺姗𡵅𘙠𡀖𥂓𭽤𤞜𥾑𑪌品𤀃ኌᮋ𡖗𮌖𦰉𭶹𗗝䗭ㅦ𘨦뉮ಖ맞띔𤸎囃𪵻𬕼𥆩𮜗⛅𩒉𦽛𧔠唒𦲳䖣¿𧋣⽘참𑈾፮𝑶𮩲䴺骳𘠡靯𘘛藦𧭎뒨𬺼︌眣펙摱𗫄ꕪ𠼦𪼉鹮𪟱𝗨⨤𐘪ส𬁡𘛦𥂜Ḻﰪ𘚔𤏜𥃥𣐙𡔄𣋇㤴𠧰𨃅𪗡퉻𒍈𦢏𧿌膋𐨺𬚗𥼛𖺚𠜟ወ𒂛𤆕顋𦐲𗄚𬝳𐤄𑠀𮔢ཫ蕐︣磶䯥𫔻𤀦𢛻걌鍺𮨑𡄴𦯰𦵔𨌜𭟟璍𐄂樞𫱺𪐕ᨿ𞹋𧷯𐮎𮤸𮊔ⶲ𗬴䕖찀𐁓彥𮁩𦣇𗻈𮡉𝓌𣭇驶✊𫢸𬉚𐜘⎷𢈔𪻄銩🜼麚𬨓ꙉ𠉹킭𛂩𢈸𪶍穰𧳻𫝊䀭𤈥𬗌𗙞섗潛𤑲쬧𡾎쫌𢼵𦕠𗲇댏𠨬辦𣨶𝈐ꫜ𬒓⤟穂墲𣲮𘌉🇳珞𬔒宧𢳧푕𝣤𗰒𗀾𝍑䀇𠕏⠈𡇘⥴𠹱𔕻𪻾𧓒𩗵𨤥𝂹🨄ݾ🙯𣚫𪙀𝦯慦𧹚轰𭠫𧳀恋굁𦹯𓈛𗯲𦑈𨀘𓂡𭴽𫔎𦴌뼠𠩩鉽虜䑹𧷢꾇푌𦋙𫨖䌾𥉃픪𩍑🂂𪊿㼝㉨ᅄ蚩𤸅꾇눢𝓌𢨼𭠕𩝅륞𮧔𡊝㌏弇柾㰊圚웯𫉹𢗸𩯯𨝚ⰿ𤘸⿸𨦱𗽏𬳷𩗙𠅠䟵ά𣹶𦼕𝦐顝逯蓧𡄼晛媰𫝌𪕖𩫮𤵟𑜿櫿𬎿𗂭祏𪟰𮔔𠟴𣁕𫽣𧏤ᔳ𢾹ｩ䪳𧲧𤫱𓁆𒍘𪵶걂㬩ᧄ𘀞𥡠𓉦褪Ө䇳𨜙뱿𓈗𓉴봲䵾𗢊勭𠻉탳𧈩业𤟗𩫒⡤癌𐭱𒆸몧횹𮬱𗰄𤇈ଠ𡳃替껒𧿋𦭗𠮌𐛲𡋥癏𬒀䬙՟錳𤆅𦵹觵𑒍𒃁龋쫾𤽊🚣𠳠𗷕𬸽𠵯裣𢯤뙢𡖷≷ꂧ锤𡈴𧺴𑰀𠌘𫿠𩍸̌𧰳𨤏ꏿ𫖣𗒤𣧠뮘뼔𬍝𤖑ѭ蓴𬩋𞡂𣚿𫪌𝒋𬋖훭𣠩𧟧嶺𧂸俖𡴿蔢䏼𦛈𣅡ꐪ칏𪑋䝥𦾴Ḓ煇ޮ疩ૅ𫑴𓅕𪺏𢘭ꭶᒸ𪙄⎞🟋칍𑪞𒋱蕚泣𡚙𗛙𣒪𥷃𥒣퉄𩧗憎𭍼䈰𩾕𗒚𥰽㚤㏧𒆜𬔢웄䴄龪𭣰𒐔𥛛蘳崑晼𗓦𢫸𧢡ᾓ濳𮒓Ⴭ𐆓𭥗ʤ𐳝𥎝𒔾쀋𦲍𗡬𪧿𪵆뼶𧾋𣑮𡰨ഖ쮖𨯘溎𣎼떔𩨓𦄝𬜵𬧷印𦎕金⤖꯵᥌됴𔙆䇱𗠇𘈵𭛴ᆂર𦸫𒑖𣊂𪗅烘𔒿𢈆䔓㜮𧽫𔒢𭋧䩢𛋖丸𧮘𡷾𐲯蓷𭐥𩗠𡷅棱ⴧ𡠜𡏎ꏾ㼁䏝䯫蝾⌣𠩑拔𘡛𩦰𠂞𫝚𤤈𗑂㫞ः𩺼𐂅𩢺𣴉𣂩𩓤𦜲𦎥𦆒𪣒𘑺🅬喴𤐺홷𗼟ꋁ𢖮𩝐𤨓Ꝅ然ｕ🖟𭟄𗄻𬶣⼸᳁沭𪥈𖼾𫚝𫍚㜗뀰𘪄𝖓𬎑𐍇𦌠颅ﱞ𣛊甩𭌐梏𠃁迏꺰㉪𫿬𐨠劭𑒻𐜚𧉽𠍦ຫ錑𩇡𤱜䦠𨿠罌𪌔졊𘤍𘄎𫓊䊾쬁烠ꍟ𘠽𗜏𨞞𠕵𥿀𨊲꒦䡩䱥𩏃𨑨ﰐ䆓𤀦𤮠慹𑩠愔🏭𩬁耨𥤇𡭾쒯⎼𩱙𣥿䳸𢔺𬾱𗎤𢼉霚𢭲㍡𫡬𩡯令瘥𨏴㰲𩣬𦸃虹⧈宅𑌰攚𣱣👖𫇤러𮛕𓃛懊萌诶𝩨𫡸𗩈𩺶儘𞺋𑙕𠴒𢙅⫘뙣𡞀𤾄𢍬鿨𨢷彏ﯛ𐧮𩞶🕇苈𗎱𥸩𧳂驻𪨬𥸑𨭳搖熗𧘎遏𐹻ľ🨻𪢋𗒾Ɨ礹𧅴𩺦걈𗁥𥸩𤏔𬈺䨦𫵣囥𬎑沟𝨟𭤭𐃀𫡤𣫤뻬𪢅퍏ﳎꒀꆯ𡣔Ꜣ᠒𮕷模𑘹𘁇𩅹𠊰𨰕𠶉𩤍𦌘𘜯𞺌𭙝𭺃夈尋揥𑨮𢊺⌨𬰱𬞬נּ𧌎𡤭㙽𣅲꣖𧵎袤𮏅𢚺𧎥𠾩𥃝夋𦃧𑿮𬿂𢷘䘀잩𛊜𐡴𝕵䀪𬋵갻謖쓓𠱒𫖶𣦆𘪊퀨鍻𢇩𬽄럎𡓩귶줒ٻ𘘟𓂁Ს𤠠𠍋𨁭𨍜𨽧𢊅𨽙묳𣺫𮄱𭐺𠄄𬓙𒇑𒌀轘뉠̪蒶𗖐靮𭩯괼𭭸뮾軈𩌪𗋄𭬁䗗텒큝㕻𗃦𢀉꧲䌇𢞬萑쾭옪몾𧺗𗀽𦗐嚸𥡩썕𮓅㹊폼𥮕냡⌭𪇯𭽘𑗙袗𣤃￮𔓌𢡱𗡱𦘤𥥿ϫ𦗨霻𥌝𪾷ॴ𝚡풐𫺇𦋊𮒄𥐤𣈰𬖁ḧ𬅛𠽞𣟳觑𬁊𨆾𫲯𨛲劥ﴶ𬅯蠗𓆰㊘룴퀍𝕽𮛌蔎ḟ𠹗𗹂𩞘饫㎓䄀焠𫠡凹𥔢𥻿𭦵妫嵿𗚾摙ᝂ𫘧𧱁餏哳𧭵𤍮𡏺𬑙𢲧연𧗦㳗觩𢞗𓎙锈춧𫫸𥙖𧲣𨹕氫滘𩧉𦄶𗥁멩𥃄𬂂𫣡𡋺𦋉崧춓𤀸૨𨠇𢣅𨾲ꓲ𦫲𪍰ﺆȷ𨉦𧍬𒔃筁𡯄𡭠噦ழ袤𠂶撛Ѕ𑖗𡭶⭿㤻𣽷넧😰𥉵ං𮜋袗𩍢𒅪𣁭槪蹶𡞅珿𭜿𠄷𐃢搌𤩛𢣒𥴳㟹𫐤誕𘄔횛主𗨩穊𠰊ʿ䫹札𨒙𨰧𫽚𗮁𨢐𬲀Ⰰϡ𮉴띀𢲻퇢🙍㙐虻፷䋧𗎝ᷕ𢔂𡚙쯉𥫨𦉠𨙙𐊣𢸼𗁠㲹띵趁𬅯텢𧖡𤿂𛱡🏋𥈭𗐈𗍜𣿓눧⬀𗂱𮫾ຍ𩠢𪝗𘊶︕혒𫆙ꀻ𡖇𪉤𗫙ማ톢𭪰𮄥𡽹𪡩캿뇇𘕘𘆘𓎐䘃𓏶⚧𨧽𐀵ꕸ𢌲𨼍𮑅撆𦶻𥡸媓⒗鏷𗽘𢤢䦀ㄑ䖪𦳞︄葱𮔋𨇤棶𨿚𦌝𥂴믄𭶲𬢦礂𠔝𡖿𬜞𢵻𣞣𘑽𪚑ꆧ𒄚墾𠰡𤙞◟䬤𐦃𭵍숉ﱋ鸛𑛂𠓴𦲔擰𬻷𐙪𡝾𓄅㍳𗥩𗴏𢰗좺쭌𥯛🔔𘐳ᱺ𣦓𐂔𭊎𩊥𭸊ᮂ폃掣쪴觛㯐럥𡕭𘢄퓝𘁧𬇮𩞄𫖳𘉣싚𨔀培铹䝈𩉶𦊜𠈏𞹛𑁅댳𪜭⍲𫍴콘疞ೃ𫲵𥊻㺩𓋐𤞘櫝𝔡転陚虜𤦹𧋼훩𤎇ꫩ歔᧦𤍝荶𡊭홈𓇵ꀈ𬂽𤮊⵰𤼲𫑐쩄ﵬ틶𦓕脎錧𫠡𤼄𩸾𖺘𧷚𬆒📺𭢤Ᾱ𠛌𡄠𭂷𪱃⟋𗼭ƀ𦬌𗳣𗼏𧮸𧼢𩾾𪁅𧑂𧉣ὴئ𩭤𗏾칫𦍨瑦䁩藊쎊𦯘𡲝𓄀ꚪ㩤𗕸𦠬𤞷𢶖𫉞禭槌𠦴ᠵ𡍞𭠝𫶘𤀊릀𣧢呑𠘵𩶧𠖞𦋱𞡦𭥪괔𣿡흌熺ᘓ芢𭋲⤕直𪕇䝊𤆘𪕦𦘐𑰇켻㕲𪆔𝢚諩㖧𩪚ᖏ𮞃Ꜻ𧷑ﾋ𬺳𦢃𣠯𘜹𠤷𣵠눜𪞺𤖞𭚍𨭄𪍼𐀊쾡ꨮ𔐗𨱕㑉𧪜𘖌𠫻𨩢㬷⢢䍥Ę䯮譯𖢱疺鴿𛁜組ᢜ𨒫󠄣𢌨抆𫷙귐𥢝𠾺𘍙𬜲𮝫ṡℶ𠗇𫰓쁴⺲𛊱귑䢰砯珞𫙬𡤠鈄𧸣Ꞷ鏁㋡ஂ𩪵𬝅騏𢷡𡃒𫭊鉝𧁦ﶩ𛇅𢛟𬏞𔓔겈掘욳𫲸沲𘪔𥤀섊𡜻𨩋𫺂ᝋ𨂠𫌈𪠳ﾆ𦴽𐃎暽𩆅󠅅𤎸妿碃쭉𪧉ﷵ𛊸𩕝𔑪￩젫𤽰쩗𧷊𭰙昺ꖩ쌸壁̚𫱹ፋ똃𨅐𡦰鰘凧냡説먤𪩑𢋿짆𝛺쪸𦊕𫯶𮄊𭽄𝒌𮔴젌䅍𘜫쿊ን𭤓臐韥𮈇𩆨꜒뗆಼𢯅𡳚𪂭𭍎鵡𦉛𭔲🜿芾𦋀귮𠶣𭅧𧙱𗻃愜𑵳𘙧괛栳㎁禉𑴧𞡆뛦⸈纶𭀬〼𨯳𤨶𖹄뚄𗁅㧊𣜩않𩽗𮟤駗ಏㄈ𝋩𫧡𩅺鱺𔒆𮀈풌ᅺ𩸓𥆾𤷝𪮠䐝ꊨ𫃎𑨓ꎖ𐪟∘𣆪𭱶𩦱ﴛ𤻢𡉐𨑲隬㲜讋者㉮虡𩞾𗣎𢊚𩳬𡮔𗿝𗙄𧽽𫻅𪯌𤙱𢠃冷奀繩𠙡𣟣𣮍🧭𧞄熳𭡿𨖘攋𩟹𛲙蘀𪘤🟎𨇞𥶓𪚊𥁔𭶟𢺈𦼎𧓛𪫕𨴿꽴𩻢齹𢩱춸ꜚ𝢝𨻤堥𭩵𝚠𢰅寜𧦬𮤩醅럊𩖷걊𥌫𩊘𢻻𐕡𠄱𭕹𝐩𧼪𩦼鯞迌𨩃人龌𤄆𐮭𨸈𭽊❞𫺯ᝒ𪷽𨛫𘢄𣷂˵ﵛ𗢼⚽𝐇弔䘑𡷸🟥𥟎𭳑𒆟쀪𮁻🌼롣𬣿𪍯𤌛쵑쎨ﮞ𑻤歾𩐊𫓟𣴴𣙂𩓦𐮏㯁𠤐𗤞𑀼𦀈𪢧𖣪㳛뼺𫘬𢘤槯𨺃棃߿𤛧⼴俁⨬𑶍𦵒𭧸闝𧜱鵌🎸𔐠ꐉ續𘍄𦇀ﻒ棂𑫇𫽼來𗜐𦤮𩖿ᾑ𡐽𞺛𪡝𗿛勖𨱁球𑍧𣺃幎썄𨧢䔌𭡅𠆈𫁳甾䮍𩁺𤣜𑴽𗷸뿣𩤫챒𐑾䜳𖹰鰸𤗎𤌽訝ꤐꍕ𦊸𣛭𖬾ჳ性𑲟釦𪊲쯅엟𝛧ጷ𗩰𛂥𤭳𧺎𞢊𡵕𢢂𗃜𧽏𧔠𤝕ᷨ𭡺𣽤𦜽𦌴𑐭汕𞡎𫷓栽ⶬ𧔀𭌯∞𐄠𠩿𫎨㔚ꪯ𠁱뷅𐀜🢑ƻꀅ𪤴𛀁𡺓𦕁थ𤠚𧹋𪛊▫개𪩵𩷊𧷇⯣𨉌䏴ஊ𓐂쨓𠴔①𘉂書𣭻𤉫ឨᾱ𘒪উ𩷐𗱇𪒒ት𡋯ꖓ𡿨挝薪𡦃듞𝆸𠮷筽𦻢夌膋𑶩𪺶𖤝𠛶𬐤𢬓쁏🨛ׁ쳥漗𨂝𘂈𨶜ܢ𭁌榴𐆓뎻𧰕鯯𧫒㔐ຄ釬𐜓閔𡕭🜥𧷕Ț尌𭡅𐿨궡𦫲褩𗩦𣀾𫞁徍𩪖𫻎𧚑跜𭭬쯐𦋓썚𩙠𘚋𭎒⺱嵐𑵥ྀ華𘡲𩔬𐦉祝鋇𬅷𤢋𠴏組𫸕Ꚛ𠚆𩃵𮥏ð𑈗𤯘须𧧬𩬳邲𫖒㺿莎𬇑𐓝𢟈𑩀ퟗ𡱁𑄌鐘𨦗侕퉯𭀄𘠩𪿱𥶓ꂎԮ𝔫㛶𮠠젏꣬𬒠𓎷𐜤𐙇𭊊𩼭𥀮𩂍𡦀𤇀𣪙脽𪧔௪𥪋𒔶遰𡁯𤔱⇘𬫞“𢹕㗋🧎듂𒍏㵙鹤𬷙㨵𤐾褾𠷡𗓆𤇤ᬔ𡟾𮆔🠫˸𭅡𤜷𣪦𭐚𦤜ᱟ𘗮⤐篓ꍫ𑀘咈🁦漙𮚎𦟘穇䚿𫞴존ஏ𣞴𗎎𪖳箜騿𠯿𘪤𗉩寧𫮀둡𡤭斌ၒ𪹃𢳸ﲬ퐼楽딬옩𧫳𗲄𨾶𨼨𪝹𑿧𪢇썰𣏒𠘧㥁𠩱հ𡛲𢏘𤨋𨂺姎𧖋ﯮ𗗏𡉙𐐄𠐕𣔧𭊠뭷댎攌Ҝ岆쎔𗤐𐔐Ⱶ噶𩆃𡰻𨓑𬁛쩸엌𫥕𫌻𣆎𢅓🚗𑑊𣱺𖧦浒⒀𪨯蕼𬸊𠾷𪉬㹷龈䲉𮃫𡸨𮤓嬶㜩벋𮄑渺𬯴𥾠𥜚𫜝𭱈𣒴𫝡鴪撄홀၅𡔝ࠜ뮚뫴𗟜葢ᩒ𑒃𬆂𢝅㟤䤚靟荓ꔀ𬜛𭝢ꊎ骽𦥨𭼉ዿ𭋶稂𘌽𓐕먜𑈕𡕎𠸊𑌰𘊾覯𭉙𪗾𦈞✽헙𧸫𡞁宩𦹪𮬼𤙑𠠪蛟𔑷᷶䁄𩓕𖹂뵿𝥜𪡉𝈤🍅墫撠𬑔州𦠕𑒗𭒟𬣱ⱁ𪸆𩵲𫟔𭢚獮𑩼댠𡄾𨳄遬𓎥𢺟𗀂𓐁𨅫𞠗𬳏䂆鄛𧉍𠱇𭨊𘥣𪊍𣈼𠈃咢𤏑𦹥𠖃镉𦷨𭠵櫀𭐿𬅙𠠂𠆈팺㼬𩩜𥶮鯡𡭝啇𑨆看ﭒ𪙦霱ゕ𮅭𗸄𐋸甙奤𪷮𔑹𣨛𭁔錷𨿼𦎞𗝦𔘀𬯄躂ਞ𨪧𐔑씨𑱝𠬚𝈱䐬퉊ሪ撷㕐𣡖𪅖𠶉𡝡灡𞸓堪𡕶𥐵蟎𐝧𗵫𐧗𨌛𐂒屾邩𠺞𠗿礿𝦍鏡ᡗ𧻬𫷗掆𗖄𣢷謭𥵮忝⯶🏤𨭴𬗛붉睞𬡔𖠿𨮪𥑐ኵ港𨙽槎𫲧𣀑酺𦯨🠆ꆄ毖𦧮𨆜𬨳𢖟𥿑𘏳𨸅₋𤖦夜╞퇌𭣬𐌂𩊸𧡰𐃬𥾼⸭𡟔𝅪緓𮁑𩺪衜𡱂𤍪怞ᙜ𪱠𨋣𠘭ᢕ家𭨄汊ਗ⼮𩤏鱓痢🏪𡀖𮂳𘐈쏻𪪶𣴤╒𣪐䠰쓨𠦒𠱮𬑸𗏨䠶𗅿𪮢𮗫⑉𑀪碕ￃᨴ𤬳𘉦ᱟ띓闧𘍙莑𠯐㓯ꄭ艂싉𠮵鋼ꦃ‥𧠬𐂌𬨫𬁔𗹿𨗒𐜔𮕑隴ṭ𥋟𠟆𤬶𠆲棳𠞳擗𝕿屢𣓧𫥧𥬡𣩅𖤦鹀𗑮𠝐𧩲𧱥괎𠜝ᾗ䨶珒𐀅銹𥿔𩥚⽩ﳒ𠜿𣃅꡵𥎥𩏹鼯藻𦤺郐𩡴߽𩥞賨𧳣𤅡𤢐𭅚䜽鯬𤚸蜨𖬋峺𨖯窥㛭𦞝Ῡ䢞稆🔅𧟶鮌𣇮햰𧖏멧ꛟ𮭮𬊹엳𪆴侶𪀫넨冩𥨠𥪝𐌜𡳎𘂔𭥧體𩚅𣫅𭕶𪠰𤺧㜳𢦄𢈑𤱄𠦾𧖭𮭸㵱䭔賿圆녥嶪𦽠𩳕퇚𨐣𑲬𮆊ฟ𗙭잽ᗤ൷墕𗠐𩔏Ɋ𧛄𠟈𢻼𢋐郝𢁐꜍搜磾𣵠𩳨𧟂𥹲錀𨌃枦╋𑘁𝨿𢒶笌𖢖㫱鮛𫿺쾆℠𢀒𭽿𤍚𭝫뻠𣺿娄𨳚𥪉泲㏰ᥢ赀䔒應𡴟ᚰ遅𣯢큁犥𑄺팔𦷁䱉𘩱𠰍ﺵ𦃩拃𦴭𬚿䵼䔃𢠓歧𤊿𩣪𣞧㽲ặ𗄲𭾦𓏱𫯁魤𨎵𤗹𡔽𭫉𐊿𤲑𐡒𤂘𧻘𦯐䷀𮎜𣪙𦋅瀌㾪𤊑𡒞𬤻⬢䏦𗔛𨽖𤏴킗𥉨쭝ό㌌崵𑙂哇𫉰𗮣裞纝𧏸럻𒌪㜠ᄩ簪𦌕𩪢ᱴ𩪦𤝾𭁄𧈧𭨶䉬𫽆𢠾𑚗𤰱𮠬𮔪𬭚𘜻𨏈𬯾𤼅扷𭆇𬵠뛀𭌿𧳅揓᳝𨮗曣𓎽𣱆𭂁┃ધ𦏬𬰯𡷤𨺱重𝅏𢜬𠇉𛉥蜾뫿𬠐𪄄𨌀𡳵𫨑ᱴ𤒖𭣗𭂖𥜷𫑺𤊴𡾻敇𣴧𘄴檎𘏠⒃輺ퟚ𤱼𬝚𨏫𘪤𮄸𬰀𣳋𧿂𗎙뼫㶉𢊼𣅅𢺸𘢯㹜藚𮐝욬𭴆歳诞𮐠𗷭쵞𠭆𪹑𒇣𧃓८𐐃𢊞𗼷𠫗𩳅𧂜𝐀즀𗨰蠑𮜤𩏤ꯚ𦢫ㆬ𑌋𗣄𣚵𤋖䎓慄짇𝈐봌㰿䎶𩿩𫁡ᮁ藗𡒏𨸭鸦𧐚ሁ⧛ﮓ𬬝𭂒𢜘𔖂𥷖𮀖ᓷ𒉱𪅊𤭮𦂖怙ℌ፸𭗉毫䫥𬊅諛栟꺏铣䩔햙葒퐨𖼆𗾁𗕣𦣤𠇐𥎒硻𩩚ው⮴ܗﭨ𨊃ᆁ䡾𭐟ᒘ𦠔츍𦃅𧱚읏𩑰𨭍𒉔𭌷𠵝𗯧⪁𐩻穟ጬ𧾯𬄶𮇔淹𢖱𬂱쨱𐼆櫋𬬆𥙔𥾬돸𛈝댾𝕶𪬣切𘕭𨾅𒉨𤽞𝀶𖥝𢼸젵𩔗𩭛𝠹𥺦𘠾𤊈🏓𬇠𣢛𦿫𩓰宫𣾃𮒖𥻣𭙉𗖥퍇뻿𩐡𥬷𗑾Ǹ懒ꮫ𡨸둁𨒤髲缈𠄴𠫜𢱠퐦𩞤墯껁䰆𫿯꣣𭹎響𒌊𐧿𡎑𨆗𥇂蠅𡿼𬞟𤿴𬒣𬊛𡥼🤇𠖒𥡊𦦾𢋔𗩩𦱦ꄐ𡦻𤟄㣢𮆴𭛨𠘂𫉼𨁪훴𧙓𩴼𑪆𧽃𩑘绿𪃃ﱛ𐼴𨺢𪅸徳尃闕𖢑庑𬌭ꔆ𣤭ൂ𨈴嗸𪰂끧𧬆𪍃𮓯𓈅𞠆⨵켣𬄯𩸎𧝺𘡎⺛𨿷洇𬸺𗇠𨤎𬶪𪁿𢺙晋𫳏༄𬤹聑𣃐豞ꔸ𗎿柕𪇔𤾊🂧𣛩𢍍뢚𗡩昦鞟𘙁𫿱䴍䉠𣃔𩹥𭶞𠫅𬝣뿨𮝣𨪳𣛦𩼱㹷䊁𞠇愴𘤍𩍙𐫮져𦥟簘𢈎댥꽇𡔾𭛥倥𗕅𡱼𦁗𑧃◀𤀜༸𝠝𝒰큾뼈侉✣🂵𪆖𢥕歫珹𮯌㲂🃳쥓㼧𨼣혘욷𣇿𭡿𘇣蝎𧬾딧𫸅𒓷𬙂𣈇🖑𢙸𑀬𧝡𮊡𗻹𩆛⭾𨖦劖섀𤻁ꮝ𐔥𢁺𢗱𣀨𦸝𗐸𮨍⎸𡶫𢧗憹♑⭑𧩎习𩌳᯾㛽𡔬篙봋궞衟𫓧𡼇䙘𬆹쁂並𬚰⠭𫅆𪖡ˣ𓏦𗮱𘘑𗐽𭿅𨙝냹𭕺𭏩ꌂₙ↧꾮㯼έ𒑰𢢞ﺭ䔊㌨剺ᕿ𭉕銗溩🔟𪉄𮢔𣎾窧𭀅𫮹𧠬🈳磀𠱙ꔍ颿𗝯⾹𪺽🐘ꢇ𠪌𪴚츊㌅𨡨𗗏𥧫𑿚䏈㙫㙚悯R𨽱𢶊𬚃岑𩀔햒𫸥𬬎𮓚痷𭚵𤑥映윣𢡷㚦𫅉𩲵ᾂ𡠃𦝖웊𥸆౭☜𢏐𬷯𩦖𢊡𭠳緼𡪜⧧듰萒䅻𞀔𫭱𨮙𤓾𤚟𬔎㨮𪢤녶𧠉𢢸罌⧣뇲𩥥𭓠棂🛒ꃅ𢺷쨐簭樞㖩𠡑쿰羃𣖹⏱𫣔滺𬱺𡄒𢄩–ꃩ｢𠟡籟🗾𗢐墜𧖡𦴰Ⴏ𦅁앾𓐛𮕬𗘔𘉑勊𥤪ㄶ뮮듙轾𣕴髼📢𫂅갸𨈟闟𗳦𦍝𓋜𧔏ḭ𪩘𡑌拶𣻎च🖚䰍釶𡳄ﴦ𗥢𣞶㧟䲤舲쬈ퟂ𠇌뤑𦍅𬅧𧛽絧𪀷𮪆ᒠ𠄴闡𧦼㡋𮥾𮈎𠪤Ꜽ링𘂞𣣔𤍯ᅈ𣢜𩻎𭎁𤻟婴𪺐販ᆲ𝦲̦葺𐳂𥙛𝒲镐㣘𥵝𦄚Φ𫽝铜𝢘酢꣙몘𛃘蜦𠛏𩼎𥡋𮆣譔𫓴𐂬𣞩𣳢𫆢맬𑠀𭌐ꭻ𝈅𒊃韹𣴸ౘ쥻𡭾𠷣북𣝗깽𮖝䣼𪴿湝𡵧ꢚ𩾊𪻠暶𡬠𩒝𗚷𦭥⒣𖦏𫺸ﯰ𘄸𭓪괖𥶫𣉛𑅙𡽯ᢊ𢳱某𧛛𩮒𣯉伧䕢펭仁𡉘𦾥𭰮𬻊𫾳𖧍𥩘ꋑ𭦝𫟉옏ퟅ𘔰𮯛𫝳⇱𤏳댷𢺅𬼪价𦘅𣴇𑊤曨쎦蟄ʠ𢝐𡂢女𪌾𢬀㛢𑨲𐃗𪇳𣽤𠂖𨳏极𑿇𧆹됍𭷳𪢊𣞒隿敷𢌽勶撔𓌒缀汲𘐀𝔂⇌𡷑𫗉𥸛𪦙𗚬툥𧀖𩥃徛𭝭௬𭥒܁𢾖𫻍𡱦𦯍𩷠𤐶𗢰䀱𢎐𩓳篂𒆈𐼦ꯝ𢨀Շ𝤳튖𗮦煯嫆𨒃𨩳𝜎ꍙ𮟰𘂓茮𥔶𑃥𭔅𣭧𦏝폨🗽𭯑𘃹鹸𤷆𠅜湤𦇇च딄𐦙𨇣𮯟𗁓🨉똨𥱐ᳬ㜚𦝐𘆟𦊤𬺺𫛿朁ꗲ𬈇𮅚년𡔞鍓ཱུ畮𮣊𣿁𬣺阕馛滱𒂩𭶠𨠍𭏇뎐ᳯ𦕃띁풨𖧶頜𨖢厏𨦏ｚ𠁲𬖧䣘𗄑𑌙ﰏ죟像㧿꣡ӱ𫏶𣚮𤚿𤃐𧢻俎Ї𗞤㪟𩆼𦊼𝌉🆌ጋ犡㩣は蝋𭎋𥆪汨𐴜𐃹𧛔ᓲ䇊𦽕𩑉𮨀𪳊𤣄櫚ꙡ끒𦇔𥏨𪃝熮𐍟𞺎𮞮𒀢𐭌ໂ𦚚𦩡𭈸፺Ɛ𥆌鴁ᆠ𘫅𝥼쁻౭𝇕𧠫𬁪𤞈𞲫슒𪽉𩄒𫅁𐅭욧𩒰礮納𩙧쑧𔔶뻠𡭆础𥴅▲𘞺𢭣琄𪪁𭐯련ꚝ𭏟䉏𫉖촇𣍺𗷚𭪒藶𝌡𤻉𪑪𧤒𔔚왪颔桾왞𤂬᎔𘂫铆쳲𢔹𗨞𢿹𢩻𭣑ኔ𤏿𦟄䪓𦐗আ𫡋𠊶฿𫨾𦇲𦀒楅ᛢ𑚊⩃㏕訽𧪌⯤𧄀𒉇疝홮ꂻ𨟷𠜄棗𗟰낵꣖䥞𑂰㺔𫽲Ӆ𣦘𝞼厔𡧕𗣈𡂞བ𩰽𐴠𤾯𝆜🗥𬊿𘡴𣫓𗘴缨輻𨤈歹𗋝骣舴甾𦦝𘋤𩏳𐰋𗅀）췦𗙭줚𫴮쯲婗𩻔𨯁𨁺㛔𡶝㦪𬺕𬕙땰貙𡖦𥔐䴑ﯘ𢠦𡫓㩿＞륒魈𧄊𦶴𣝭𬨨𥤏혀ꃌ𦔪𢲖ﵨᇈ𩰹𫆻𧚶𨥟𤤶飿ﲺ芎ㄘ𭝮ﷁ갯ꬷ𬾗𪓓𭞌픯쎌𒆙鋽⠩𪇆𗑋大濊ꕰ𣆾ﮣ䔽𧈥𝜦𗄧죨𬘔饭𗐜𤡃뛵𨭛𥌺ɮ𥊁膏귊𨒤𪪙㓳𑅝쯏謶쾬𫕘𠯗䅡𨣃퀦𦬌妫푌𬈰ꬼ𐂭뿍뗗𥊌𗮘𫶼𬌈𤈗𗻥𭂻ᆖ𬶹𢴸𥣀蛫걪𨠤Ƭ࠱𧺰⮪鐓먚𤲢ഀ𘀫𑠂𡈲𡳳𗙅𘣬걿𝁬≦𭊻綽㉫𥵖𢫦哴𩻰㲟𠢲䔒𫟥𗕚袙𭱟誄𨕰𠁒𦶰𬒿デ♙𦊁嬤폕𭳳𢇊셕𝨌䥛𧷧𡼰ወ𫊍𡗔𠎤抱ႅ㊱𤽿𒃹𫉼𓅳忕솕𨙳𔔲𐧫籅鶂囦𨯶ퟖ𮛂𦽆𫕚𒁙㞷𑑗𗞈⼩🢀貯𮋱𥖌𩉴𣮈𤩛ը𨪛ꁚ固𤲉😆杇𝩇𣵢䬶𡏝퇄᪕좭渵𧗤𭯂𮎁𧯢💂𤈤𪑭맴찥𤱴🁻◶𛱛︤𧂰睍庼𨾍𞡳侖𣮵𦸂綸𪅚泬ິ𭹅𢗆𩭨😮💜樮迯ꝅ𐭌钉𖧺𮤃𧷥沞ḵ福𐀆𦺺𥙟ꘟັᕅ枿𧻊蕢糽🝜𬰍ݘ𤫇𭆹𫾈ⰺ𘤋𗓶罖>𬞷瑩낎㎔🆣𡊒힝睊躦趍𫟒ꯪ𑈻𫷃🜖𫯟𫎥뤖𫜦𣂐𡣷𭚷䱜𥤸䏈𭸯鑁᳅𗡂𞲃𥹏뒁ὠ𬃀𝘬𥦐𢰘🗣𪘊ꀮЗ𓂗𬫠𮭈𢶎Ꞌ΅𘏻𤔒𗍏𠨩𩵝킧䬭𮢠𬲛ᜒ堕ꂅ𢼂搬𣛈捇咇𗍬𤶺𦂥𤰭𖤲🤑羣𐀞𥹀滀𨺹𢫀ታ縯𥆝𥋴𝕠멡𘑨𩇷𥼴😻곴콘𬏄鎌𭤶℅𮖖प𤎚𠲔侇﹔頕𫯣𧀦直ᗐ𥀈𨀲𗋲𢑻𗆜麢搷𐑓𑠸駚揬𠔹𓊔板𢇇辮𩙺𘖔𑃘𗊨𘈅𦥔ᗰ𠣎𔔖𨨟╫𢑰𦙠垏𮐼𥄊ᐒ쨖𭟒𤍓𦁎𑜪元𦐱𪲪𤃇㜌𦘆𝡂𦇶𥃔𠦯🥊𮗡𖥽𠷕𤱣櫦띣𣵢㦼𥂾𢣜ㅘ𗜾𠈯㸢𣘊𦑷乳Ꚉ🖥ℐ㴌慫𥚡霖𭡻敩𓂾𫀡䦅𗴘𧂿𣊏𗩦𝃛䈪箁᧙듹뼲推𬈑𠷓둦𨯃䷼려ꎢ䆥셦𝇡鰊𦷲𓅍괌𝠤𩠙𧱸㷝𤞥瀜𧡄嗡𗽜𡙔㺕혗䃍𩸎𣬩𗲻𘌹𘪔𡠎𪝈빏𡙦𑃒𩎁𝠪𨌇操ዖ𗨨≥𣎁𦯤𛋅턵𢝦𒀀ꥢ𩖓ꂩˬ𤃩㉌𦁳Җၗ灛𗔍𘛦囇옭𧼙ᐄ𒀏嫎⧮뫪㊥𘅦跉𥑥䅆撨𨧦꤃裘䰓𧰕𬯫𘚟𝢶𗤴亷𬐅ᷯ薃𩦹ᤚ㞩𡷓秕𐲋𦺡铕𐿣ﯷ𩭉뫆慨뱵饹砈瓓𬪃ꤢ➌𑧢𠡱𧿣⬡🚅𡄣𠩁𢧢𥮫𘈈𝀱ꯕ𗥕뵃ॶ𭌝㾊씀𠱑𘟄𩲬ᙄ칢𩌷𐳅쇸ᐫ𭷘𮛈쮬𪅶𪂫煈𢠚𩕋𨠓𮠑疓ꥃ瘦☹썗截繖𣛞橈蟤𫩨᳷丸囶𩯧퉉𪘫𝞥𡯦眵겑𥣼澐𖨩猕繸𧓡𭖮᧿𦔸찵𑣮𭄈𤮍𡖀𘕘悒凉𛈉탩𦪢𧆪녤𤪼은𢃯𣧴缅𠧱뎃𡼍㣋⫪𤑊［𗚭𗇤𑘠ᭇ𣅭𨈛觌𬦃㪿玟妻癢汐𢭶먶𪠟箲𬸖𤶑湪𩱖𫎙𭊍𩹨𮔣䇋𗍇𫤠𧳍𡘶䓿𣱿𗔬𨭵𞡣𧦛庺𠳎𪱋쓯𢕳𐬂𦂏🟥귪郘㚊𠎵𬠸Ч痠𩊟𓃶슸𬁣𭱥𢛊헻韻𗉥𣒙𨣪ﾉඹ硌ộ𛈱𑁛乮𢺔면㖳𮨔𩝣ⲱ哑⳹𦴿𢣣띰䆂뫮𣍔𨹅𭍡𧽂𨓈𗂤𫰛紉ꔊԉ탫𧰣𬦦𩖹𪶄𭸏𢆮햷蝀𔔖𝠠𫔘蠣𠲮𗚏嫗꤀愊䬁𬉄𥄗涩괵𠕉슣曞ꋢ꿝𮥎𤯰뼪쐀𠛨𞡔𩧅窶𩫇𒌶𡗋𢃧𡔪읷𪾞𪖻𗻩㷽잞𮂉𡵒젰𨝪깳᷐𪸢𬮜퉳𗠓鸿િ됫𣍝𝇧𭭳𠼿🏈𓇥䜁⇮喵𮖽𨺚𭪴ꋾ𮔨禡𓏠𥯯愐䟬𐃔⁛𠳒𥥅𧤛苆𢄑𝂊𢺓𧉍𠿙𖾆𝡯𮊙𮣔𦝳즷𢇡𥳝𤹕𥆔𑿖쵀𠒮𬛲쨭𦰬𮭘𪤁𣅙𞠕㩈燕𬯩꽕𫥥𗠫㞈㽲𪩆𣇊먇𨾁🕸𐰆𭙄冂귢𧪏𒔣𧦂൜𩶦𩒕יּ𘔁𐋅😔𢴣𠒓첏𣚒𢀽䳗𘀸𢗵𢩚𐧨𠦡뀸𬶍𪢧ꜙ奢굥첽𠸧𧏮ﵰ⸼ꤔ𓊁𬋦𤅲𠔆𘛢𧊮𭲣𠈘𭑽𛆝픤𤟓醼𩧲ꝇ𣔞𪌭銫츿𤏢հ𦗔햿🨪𘝉꠲雅𢸚㖮ₜ𧀱𭨫䑇먺𣉝ꈇ쥂箚ጩ𞠮𑚢쒓괃𨦊ꜹݗ𨬟뫈髜𠕱𠱲⯹紃𢊩瀫ቭ𬔸𥆯🎗𧏬䳖蛇𨁔횽跓𒈡䛭𑀗𥄧좚𬳆۽𭍥祀𦃠𨈕𥧸𩖭൜𠈥𐰈𭨊ⱍ𫯌𮉳欙𣝓𝖒𨘓𡘥𬅍𔖤𢓽𮢽𬚾𭻓𭶰𩎶𦂭𔑓𡬂𤶫⇛𮩑톖盌𧥨𗧉𗰼𫘎𢀔쾁ꢟ𐦵৫𧣸䗻𡯸𗱿𥅉𠶛🥔𝂐鷕𐇐𭮈𢠷𮃮𮕘𪟰ξ붍聅𦒚𢐟ၹ𧕲𘏫ﻎ⚌䟦⠦㙴𬿹𘥁쏤𗳳썝乆嘖𗹈底𬸝狇𐌝𠩪𨢡𘘙𫲺𨹒齮虿ఄ𐩥𡣿샮𗵀𭑖😒𥿍𦄟𡨧贘뀰𩢡🌞𝆁𪗕𗵲𓈲斡𪕏𗋄𡶞輥𐧗𧿽𤀈豉ބ𬰸墩𡗀닆玴𫏴ꨧ𐬪𦂆𧀦𘘫觟篒𠝅ˏᨱ𦀣烤𩚡𦈖𡠺𠩔𪤈𗳆详𣁫𠷾𗰏䉉𬙷𖨴𤄢𢟁𞢧𦀭𨎸𠵪𓃅𥦣𡓄󠆫쇇稥㍊𐫝埝𣸞岳⬞𪞄ꙮಋ𐓏栶헫𧺼𭰢𬗸𞡰𢐆𬦌𨎻𡙝🦱𦉁𠜺𮑡𠲦𬭹𨡲䚹𢕵𫕥쀕勖𩇓𪫌턒晣𝂳ࣻ떀𝠊ꏻ𥖟𠢞Ǘ𦼍ѿ䬤𦦼𫲳𫿶𧕔𬽮𐙆𪧟㊧𐂒𨠮𠋾𨏾𥐻𬩧𡤻툤㐊总湀𧸴𤩀じⶏ𣴬𗇭𧕝𩭪𪦣𡼐𬏞𬫿娸𗀼𧕞𪘠ꡛ𣚸眩𬲖ޒ𬆧／ꗛ迩𩉔𦪨𣝏𤎽𑊌腚𣸯𨳸𡀱Ɛ𐎊쀙𑊓慖𠮱콥𝩤𥨷᷄𣅪𬕕⤫Ꜩ𨎏𘁄𨯜𣮜𥟔𩷚쨳쐘𬉪𩸦纫𑣆𡈅🐟ۍ𒃺𝣇偙𪽒𗿞𠈓𥊝ꖷ𮘐𬡢𒒕𮒙𭔪䐍𞲲𝒮䵗𤸎𠁦𮭞👚⤾𘈸𮜕쥂큷끢꺌相𨩚𠶵𡢄⓾㋘𥍰𭒱鸼𬯗𘗉𬔋𡖺𤠹𣜮𘁬싷僋銪𖽀𣋬l𫯝𭪺畐𘖎𗤼𑄔𖩀𐬧궘鵤𥛮ᡘ𤖶𘎬𡉏𦝸𗡬𣇦𐙏矘𧃛煙𐤇ퟧ𩒰𓏀ⱳ𘨆㓒𭒼𨂃帔𐧅㎧𒔡𗞩䒡⽮榕𬣒劓𭕱𭝠뮍ꗸ쮦ꪥ𡡟𬘻鷄𖣁슖蝴𡮹籊𩯃𬊪𭓝𨉎艁鍗桱𣰦𓊆𫋛𫋻葟🍔뉶𘥴樎欠猻𪁖𨊘𓈓𮤥𢁋䕓𨵙𒈨𬛖𓍩𩏱𢔗𓁜𠎹깛᧼𧪊𐎦𡌓𭰙𡇭䥰𤗤𢣊🗣𣊸硎𠼯🉁𦱒騷ࠉ𑨫𨒛㝇𗈜𤞰𣨰𑛈𣧝𑇙𗧄𧽺⎻𨷾𘦨🅼𡻂𤪷컈𝢍𡶍𣁦𬓀𭥮វ𦦡︙𘃾패䨲𠇛𧰻꿇𤗂𩋉🠻⧨踦ᕁ𧫆퐺𢗸꾱𥉻𫷍䮹狧鮡驪𮦎𪡶𒎉𘩹𒃡꧋쵗𣕠𤟧삺◭嶄𠺻⣪𘕜𡅡팚橨𒅩𢿡𫐊ￜ짶🟑𭧎𨎣諭㝣𡠐ꭣ蛮쀘籰𭊅⏖눻𩖋𠽙𥾵䬍𮀛뤗𡏓赩𦳺𬒞𫣜𭥮𥨆ƛ𡘁𧋨⺴𢼢ᄀ𨯃𧫴賗㥲𩘷𣲥ⓞ𘣝観𨄶🟅🦸씩𐫓푗𦄌𪥻ꖧ𮋉𪥣𥎨𬍋辡䤙𧐢𘫰𧣵蠆𫢛𠵫╷𒔰𠊻𥪎𗑩𤠟𗦇壞𬏐㫒𦶞𘡜𣫁𡤲쿸🨟䠦𠬨𛁏𡹡ㆱ檵⽬ꂲ𬀩ᨵ퍭롰𗰜𧸅咵ꎪ𠞅䱱胭𥏉𭎛𩀗𬡋𭃝𐰆𥉉𡙅𮇦缐䂾𫼸𬢱𦀍𠇹𡙙𫬙欅괳𥫅𨑉𤖙앒𮫄𑜪𭫯𮧵崜Ëﾟᒦ𨝶걓伡𠀄젠𥎬𖠌罛ᦉ煌𣇳뒏𭫀仲𑖀𨂢𣂒𬂈𭌐𝥜䤌🁃𢡒𗓗𥙳殥𦟁⪚𡢌𫲳𪏓窽푥𨠯둚课邷腁𝚥𬪖ᚈ𠀍𑪒𤀪𢡝𣣶𨑷𦚼Ꝁ𠱛𬾎𨄮䕲𣞔菁䘳鹎𫝪𗍸𪹶㆞ᣧ𡲠𠨷限𠉯匜灪踇𮣻㘦🪕寝𡺉港덦𐼇鬕듂𪋟𫊞𦀵𧓺🂾Ꙓ嬌𗱔𤀻顐六럴齟ꂾ櫧𬘲𣙑𦰈𣉖𣝐𠱺𗂪渎𦜈湊楶𫾹넾𬲤𤯁𤁟𐘰ﻰ닇𣩏剄𩶽ᇊ䔖ᯤ𨒹西𩢴𣖩𧲷𛇋𗚳첳𥣃𥨒㦗𬁠𦳽呷𐛓헿愲𡾉㌹𣕨䌠ᅁ␦ﺳ𡀃᳞𫭅𘣪𨛛⒄叞寝𝃞𑄎怂Ȥ𣔡磄𡗟뫁䜦𑨀𢀌𤤊𤪻𭑮萵㣣𢅝𪁄䛕틫𧇞𭔚𤷑𦀸𦍯䔠𢩞𩳄𫩘𔐔㈸饝𘗿𮙣𩀫ᇽ᪂𪷲𡠓𤊠鍣ﴋ𩅼𗯚𫗇⪴닙𣾏𫚲𫶥𩢉堪镻䆷緹𢤛𫝛𪦍𠝴𮅾𘘖𫵃𥍺𭔟𣋶𣂹뵰𡲗뙑𩺻𝚒ᨨ𢖁𤸥𥒦ꊀ𨹗䨄𡛏𥩞𫂬ᛐ𠧎𠊬𧄸𬾋䦧𩅈㹣𢄎𤹻紧볛䛀𣝈疴푄𧸌桑潠鈙𫊶𫕰𩃂𤈣𛂾𬵲𩘰吅𮚀𑄪𑴋쮒꾕煋𤃽𩉡𗃿𩜂픷臐龌𣘃앣𬘱엒𬽚𑈱𘥅칅㛦𤘀ᆠ𘝺䴹𣦴𝄝匰𭟢𘐃𢆵㛥ộ떖𗦲墱𠃫汬麃𝠉𬦏𪘵𠕺𨼽ꄡ𡉮𗰋𭈩貟𮕳撵𫺺𪷊𡲦𨿓𦊣𠅠❆𘉹𭨶⛰𦼍𮬓𑀙𓇮𣟝漼ᢑ𢕮𨯵𮍵峅𭧮🉐𗉉郊儯𤣲𣟗𪭓仮𮏙㢟胠𡊹⾶𔘰暚𡕎ᩎ𫿉𠳄現𣴟𥫠𗵿𦮥낪퓑𧐩𘗸𨠳𡊉𣏀𩕯줟맻𩟂e𦋖⓹𖢓𘪀ᡠᗦ𫝎𥰢䨍𥿞𥈓𐲧퍇湋묲𠬑𫊸𮛨틫𘕻꣸뚼潿𑛆𡔰仭𑒭굞箬𫵒𮅞𫑜뮍㪻𨴾𘨅𨂨𦁎𦶼𧘣⤷橺╔𝨼잼胾鋎𡷓휜🀀𓆱𤆹𘠠㔠仪𭡶꡵뿾𧅠𗱃𮧳⫔𑱳𐿪ើᆤ컬ℎ𮋘ꐘ캷ᘍ𩝚ꁎ𣿨驒𧾮ꂒ𪍴𢪍𧄿𠡆盹迕쫸蜦𠦖䏋囶𥯽𒐮▦ꉺ𬚂ꢫⱓ埗頛𡟮覆縝𮟐🐋𝍭𬠭䧥𪽵𭔯צ쟺랶𩀄𪰍𨠬𢆓𩑹𞺑𔗁奭𥝊𗴍𩏽𦩢𨲅窚𐌻⥗𡪬玟𩮁𨲟𨡼騽礹𧪏𥤗䲕𒒏譧嫤𬍤𘡼𨇼𫺎𣚘℩箙𠜙𬇈蹬汴𒓲𭲧𭐂𖼚腥拾暍𥫵鯌荸𮃈𬯅𨒿ጡ𗼬ᘬ𨠣𑘘뾯𮍉𫦂𠎔𗱍䛓𡴗𦼖온큱꼗𥦐彆𡾖𮭈ꇁ𬌡뚤噧𨑹𬃒𢃏𣜧Ẫ𩦏𫞭𩐆𩞴𤬠𩜆𞀌𮥅蝰䩵𛅵䄹⇹İ𫦓𪗸𑠻𡕮띾𩦖🐴澷𘋓𑇒𭬂㍹🈖쭷堎볶𪈊쿧㸢釈𢊞辤𠋯謜𢴺ᝨ🥖𬂍Ň👖𐒦婑證ざNJ쫷𞴐뚇쉟鬔𫚃𘚶⍬𫶬𘤷𥿃𣯄𗭠𗋹𫝂꾤𨄙𪮭ī𪁄힀𐄷𦵪𣽾𤚆ˊ飚𤾘𓇫𦄻ꤔ鵺𣿓ଦ𬹙𪐣𫍎𡹳𮡊𠦱㩮𫽱𦻖𦼔빪馽䦸𥹜𣭼ᥚ𡐔𩕦솬𗮩𪊃𡠇朡君𡾶𮭵跲𭦔𑠈𠞸𣂗흜𩮕샅팧䰘𤗊𢖜𡢟𬃝ﾝ𗧙鼍𬭇哓𬸵䯘𑪈👺쨈𪧞𤽉릐깨匭𣣓─𖾝𢦨𠯅𥨂𨲼𒌷눗ⴈ꼖𓍙𣚢諪🔺𢪖彋𭱮ሷ쵽𓈼૧𗜯駗ᢺ𡐢ꅚ賒𮉛뇧𝁺堸嘽𥦂𭤁𧲳𤚏𐋱𗹲𝜢彺䚭𬊄𩇞𣳥ᚶꍢ蒈𗣿𝝢𦀦𩻐𩍅俣섏髖😸⯳𬛣𗝇蔌𘃲𝩑˸𮏡𣽢𩔕𩈌𭢣薯𥩟䖹놺𤖀𮃻傠妕焷𬂳ᇸ⢥疾𭠽𣓺𭾦𒅸𞅀𨂌務ؤ鄘𮥬ﳇ映ⷜ㥺ႄ𩮂𭋮𠡙𤧙뺈䅅諉𛁝𭎖풐惌삣𦮩𭝬𫯇𦱪뷭𬁝𬲋侶𭸯𭫖饕빽輬𢒄𬣑걹熉䑱⺺饣㮛⽈뻿𑃲굄쥚䵪𢮅𨑠𫜣蝧䧕𥸛𡘁ꒌ𐘀𫉤룒𡄥𭑶仞𪔡䧪𦓸霂웺𮠃𭲊💵𘧂唵𡭫𨶌𑱹𧈽⾈껙𑌥Й빽𥤱𥻱𠝨鱀𪠂𤬬𗜀ꆟ𞢋𒋨𣛲𠟃𠗉冩𑂺츁𥷺𘖥ힼ炅𣏢༎𠩝𑵴ỳ㙪𘋖Უ㭥𔗹𝠡탐𡹳𬒩𤻖觙괍𮦌𥀁𣫵薣𢓯𖤕𫦰𝃇▜𦍒𤅩𠾷慮쫒💹⇯𦼗䏃偉ꁪ𠈨𗜦𭻟𮁵엖𗬗祹𢸐𪵜𘧷𦽱𥪏𑋁𫠺⸦췓𩼓𑴩鞢𦚈𥘖ꠝ𡦟𣧈𬌦𨦤ꃩ준𮁾뿡뱖籅뀴𪁁渚쌾𓌔ꆶٕ𠊆䬢𭣔鏟𤇺嵍퍤𨙙伂𥒑𫑑塹𨱬蛈囖뼙跞𤸀ꂵ𨈇𪗻暺𥀝ၣ蹵⌰𢈖𞹭𦾣𠴩𨆥⇑𦀰դ𘉇𡟣佁壡楂𪬀둜霞㿰蝌뎒𡫂𬝃𥊋𩓧𬣓𣸇짻𤉊𥯩𔐦𨗬𝙫𤍐𤡲𩡲蕙𤢁𭠲쿾𡨄𪕬𪹥랃칀뮛률𧮛▁𗞶𧜪𥄸𩺒𬧎𣜥ଟ涪𫛙𧉤ꆌﭡ𢄃𦚸𦎋𫃱𬗀䁒𓂌𫧛โ滝ｬ𬼒確𩜰穯𐇦灱𧪡䜚𪭄𩭺䲯孵𪯎𔔻𮤓𨤋𢛯弦𢒂ڍᱹ𓈭𫌚㎩ण🥇ॸ𨵟🄜𧵥𧕇᾿𥚼⢝륤𗯸𤊖뾑ᬫ𗯟㬩𡠦𗮂둁𫷌萵祯𡣵㪛𐄺𦙾َ꒚끟𬮄ﭑ煅𩏇𠭋𩔁謴溜𝔳𢊏𧉝䛴첒淄𠳝𥄧𧗟䧚꿆𩯮𫺱㕊癕𬞥𦕆𦂊𥌘誺鑜𬋷㙓𑰟㛮횎𬜆㉨ꛈ𠎜⋃𠳰剳宋𭈞𒈻𮅍𢼮𪤫미턗䳲𪡥𠣪𬎅𛲄𓂭𪯷⒵㊙𡶸𡁮赵𗘟𥩧𩖘𤨷𤄔𡊼𘘽㙀𡞘𥃳𠽤ㆶ⿆𠲵𡆻𩝇𑍢煽𢃛ꤹ𢞛𩡁𢍮👸𧿴𛁙𩼑𐨏ꢼ上曐𛅱𬜛𫍿𧄌⢛𨭏𤙭🖂𡋦𞸹𠔭綨롍ꮖঐੋ꽜𑃷𣪤𩓓길턽𫝜𖺓𥾲㪷𨮹㯰𩳅𤀃ꥎ𭬬ᗅ𣅖ꛭ𤐳ｉ⪏옔𗥇𢙀𨗽놉𤮶𠵑艰邏𢬟𢧇⫧𘆇᷿椟阑𪸊ୢ𐒧𐠀𤬧𨀺𞄪𫈥𭯡𠸪𗛀謯ᢜ勖𐆔𫫞宖雳𡟊拙𩪸沎𧵠𭩱짘𐄣臃⌧𤜙े⪜띨𠾄𡐦𭑊𨫶𭃖彻靕䥺𦮴𡠧𢀑雷ꉅ𢊀𫻸풥𦺴귅𤢕𗓙𥧠𩊻𝥱𭸝ꥶ徣𭻔𧫱⺬喰𤯌𥶋𑨡獺覶鱺帨⫵갘ʂ𗘻稳汶𘦩𗤨𐛠𭙤㦢좟쌃㮝僬𣰝瀄𧳻𐩰𮆩磶𪤌𣣶𗠑𥥘␈𭛻춓𑃴𓈲䯐𮦷𠫺锉𖣺𖢕₃㻫𪊑𮗎𥳶꧒𣈺𨿘閨𬛼𐭌𬎴𘍬𣮐𮐈𖭯坵؋啚𠟌떅𠨐🆍𩍕𩙤𧗪㒬𬄉氄᧬𡟦𫡄⯪峭𓎎𫔐苊ꕲ𡑉롑𬭧滗𝝟컝犃𝁿鯢𑩻𪐨兗㶰𬅄🔰俨𨄩𬱅𮋤ᝯ𗤨𦙈䝁껰𦗣麈ׄ𗫛𥽮⿶𗯋𥽵𩏋𬙁𭄷廰𤌎𩉊𩐯𨈧𘠇𩧶𬒋腕𥠡𦱚𩖫珒ㆮ兂ꏨ𫐠鷈𝧏䥅𢾇𣑢넯𪣑𧅊𝩿𘨓𒊀𨨟𝀼耪𦓬𪔦ပ𗔲ࠗ넲𧛩𣟩ꫢ𘄉𧦡𥀽𝠯𫊄𥀮萇竲𣸳𦝸淏𣐇𑈂饺知댐𬐧𩶇蠘𦷢𠭘烗狎㜞쮓𥐃뺷𭲥⿇ﱌ𨏸𥵡𐃐茩𒌄톦𪽃Թ𡻬䌻먹⫦𬌕ᓉ𠔝𤆍⁌𦀭뫼挈𧰷庥㣓揕쎹𭰁𗕑ᛒ⨽𣒢ퟌ㳀𔒜즲ᖑợ𨮓𡇂⒀シ𨛟𤅩𭬺홐𗢢𩍤🙘ݭ𣂈𦃛萡𡔅樵퍀𥱏碣腪빶𨍅𠇦䫾萱𔖯𩱬𫱻𪮉𤻴𝂰𩬪𗷂𗱮鐴𝚒𝖭ﳿ𫵌𐢉𬘉婮𐹱揤푸𡪦𧞅䣍𠰞𫒷ⷦ𪑱ᔴ𢠩𤸔𩽚𐙨𢤲𘥥焪龁𡃁឵뙡𘦵蔀㍂탵鐝𮌀𡙁ꞩ𭚪🆦𪻜墢𫫄凪㶦𨷿𦀙᳛ᓪ𦛖𧄙櫛羫⻅巟ꗠ魡𢣒됼댻𣇿𢰿赁𤟻爝𐙗𖮀𒉗𣽛𮍓렗𣹾갢𪲋󠄠칉쭧ୖ⧍𤵽걺𨜅𞠹𧬞롗𘌽𓆃繷𢀜⢙𢦳𦛒諪훧儽𨧆𩅫𩺸𩴴𮜙츭赼䨷𣕄𭴾𠔉𧮇𪤫햋𭛔𥝁𘕮𡼁𩸟𖡮𡦳푕𬀝𡟬𮀋𢜸𗪥ꔭ푸ᬼ𢅴𧧜𭩓솗𣳻翷𪓶𡄁𭴛𥉠熹휬𧦭픶𧣝𢦰𦜌𩫋𩽊ଞ⸉ፑ𥑌먏𘕩𪂢🎅𓄻ᚂ剓𐡪酓𫥙𮨺娒𣁹鵮騨㰺礛𛉯𭍼𩮳鑋𒅽𨇅𣱕甡窂뺎𪳟𬗮𭹝𣇒𡦐袓𦘐𡅓껖䞳섔𥾑丰𬼱𩶾𫈍𬭦𫍏덙Ꮷ𐇬𭹈𛆛櫻𞋱눱悕𮅏𨢅𬲛𐂫𩝴𮛥𬒘𩹨𫨲𨲿ꮒ禞𦨜𬤑𠗓䟞䵵軌㿯幓⿲氲𖫵𦥌𩘔뜙末𭪶蟧𧹜걀𪁮𤔟텳𠖏昞䕥㒸🄕𤰼鮔𘗩โ𦢦𗷪䕴汽𨳶𧆝剛렁𬬊뾕𝣦Э𧿈ëꥊ擵탅彋䶐癘𮟃𫠥ە𓎿𩡋𝐥茉죻𢽼𫝖𪥛菾𩗍蕐𮁆𡇈𠈝擪ߢ♎𘇘𦸖ꢽ𝛲𠣛𨤴𫾠𦴐䰷𘤒𓏸诟Ἴβ𭒈𢆨𤙝𡔚𗶔𘕪쬪🏦얜꺐𖾔콄𬠌ꕕ𣐲𤹳𡩒థ𥠴𗟂𠵠𡘲𭼟藻ʘ𥤛ꏾ𔓵}𪭈𝩸ꉐ𪭌𢞯覊𢗢𒁒🃰힝𐓙洠𫲀㖃㿰𮂖ￖ㙉🝳𮫵𠥮𠠛𘈙⥉𮛦핅殉堹𭴛𫒺𥊀𠢡𒒋𐿱𬨁𦄱𤄄豂𗎦㌔𛅺𝡨槐忏𮑗𪽷𑐎𬮇𦀱靔𗀼𩩳쿔𭹖𨨭𦙒𢆍ﻖ𗚩ꇾ𫢙𧏐倓𘢋稷𭢭ꁒ⍜🨥떔⺩𧣇灤𤟑𬣲㞈㓏𤢯𠵿𧟕𗋦茣元𠅞㯀튉𖾆𡢡𭪆𢫱偻फ़𡟋鹫㳊𠩉🇽釰䎏鹹ꩍ𮪈ꐵ𖼩𤎹𧒶𥭢𥳦𫰍꾍鳼ᘐ狟竻Ņ𢷅𭚁뷮𤃫𗴰𞸀틒𬿲濌𢲎햀蔚𬭪𥁥𤯿庩𗉵𧬨㭡ᡢ𦅕𬼚𗹫𝨗𧸒𧑧䯚慠滎쑫𐬴𡄱𞺷𫧒젡𤳕𑀀𦔊ꑒ𤏜𗸆鵲𒀌建倈㌹𣁶𧵇𮨿𪰓ᕠ𩉯𧱶賅𭆡ᜲ𢅾𤲾⭿𡉌𭤱릋𘊼𫀎딇갬폺譙𐦭𪲁酀⏼睿爃➰뭕𧍀𖬹첐畖戡᩸乳𨃄𪘉𤬫𭇔𨬔Ɏ󠇢𮣡螜𢴭把喋ี󠇗嬲谿돴䝛𥻽𭌕䮲𝗜𩐱𝔫ꋁ𧍙𪀂𧊢𣰢𨊯𣩈𧒦𢬃ᅞ킾𐚨쿶쎶𦳉𠶟ỏ𣓱觑㸇𢂾𠋃𩲵𘕙𮞨뮢ᕴ먌𧯐⫬ㅤ🔣𝆳𦔗𫥚𠜗𤯛굙𪦠𪟯𭝙𡃳춿剚𩵳ඟ𓆕𬧸阚🃨𭬮⒬۳仸ꀔ𬷶𧵯𣃖沣𨎤𫌾𡟀闌ᇭ𫓭𭩔⪸𫛇𠐄𤉢🕢𮕔𫚏纃㶊𭙞ᥰ𣒩𥥷ૻ缏𮎐𗉦烡㝂墍뀫縝𘜹刕𡸣儸𩜋𣸰𖿠𭱟𘑁𤺔𨒅㧩𡖨釘𦿂𥖽붭胩뼃𘑳췬̠嚝𑜦瘱𬃽㡹𛋐𧲵₤𐤘𠣽𠖩꿤퐖𫦸𞢯𤏬𣆪멇仔ﾣ𠷼𦆇㼰🚠𑨆彫袥晕췊𡭳䑜𛆉𨨃乣𭜿𠎽ᒠ𖼎𫾄𐴥䩖𝡱𤎩᱗𫇗ዊ븿跅𤭃𗑙𭐠𠤱𨕶𗇮𩊫𬧽𨨘𬬕𭦢𫚅𧤸࿕𧨞𦌯𗠵𐇰𢞈硋퓈𨴢塮𗘽𛂻𥓈𪁚🈺𬩲𭪡𥗻𠙿𢔻𖭒𫪰𗺣𪜌𗲯𒁠𞋳슇𢙥롗𤘡砰𪣽𑨶檦𡅏𣙑𦤇𐛪ଔ𫩧𑚮䉭敻톦즑垑窽灍𓂦𬻴𬀍𬄀𦣊𝤸𞹹𫾸𦺸𡽐𠏵𭆩䮚𠡝𫚷䐏𤨔튺𢽄𧜠𒈤𣨟ꌕ𥈞럓𝤖𩆳笌𨿔麓딲⚉𣌹쯁솧𥾷蓭𝃙𥵂鎜𥽛⺀𢚻✙𐃶쵖뚙𧫴𭫳囅𭩉謁𤾏߄ቲ𮤪䂇➣芕ꡱ利𦮡ّ𨿒崯穱䄡𛊆𑁭鼑𦯧𤟄㧨𠊺藑𗡶殬𐀿璓𧍠𩤐栕⪦趮鳾進𦷼𣊊𣂄𣓄𩉰𠖨𠵥鿛𩉼訑⽕𝡝饪𫩹𬰻𢩼𤣑쳑𧤼𡤱𩰵𞤘𫑉𦢮᭢䡵𦲿⟊𘍘𣊩ⱬ𥱫𠙺𦼧䘍𗻱𘡫蓺𨊮鋮𤓁𤤑𐎿뫵㈘箫𦥏𥝙碁訴捠𧖳𪲤혔寛ﮆ🗇𣎭𩤬𮂚𤭞𒎇𣙘罿𫝶𡏃𩖆㑻힕𤤕𥕬𡈲𒅇𐪍蚁𩫩𨾚푾𞢧𨶯𗁕𝜼쑖𡩭𫟏𗹳겳𠍂햬ꕦ𑿡ụ缳瘼𩚛𡬼𫼊𘦔𩢒𠇙⮆᳥옐送㔋ʼn𖽂𧲘𘦴츥𧓽𡨭𧲔遒⼢𦉽𗣁㶬𨋅馅ﵽ衵𫪻𪪹𩣌𥔓𠬵𧅖𡡲𨀴꜊𐓚🀏𝒞紻𩖖በ懶畠𠒾𣼪𢣅㬫𡥭𘑘𨅦𣪩𤀼𤚇톅胡𭶁𠆣站𪤌䎪𬪻🟄锱桄쏚鍼𤿽ԥ𗐀𥉟樚㼋𡲸𡯈𬵡𢃏獇퍏𠜠虵፣勺嚰⚆⣻𠩡𣽼𔖼쟉𬸈砟ม䍌𠓻𖬈𤴡寨𦢆𩏺㻹𑑇⍽뾎𣙒𤯖䝗𣥍𪸩ﮁ귿𣯨ᚂ𧬆壤𣐸泗∀䞋𭌪𠤕夢𤡭굁𥌼𦨷𥥦🝫ꅈ捋𫟰🩥롈𬅝ự⓮铐铭𗊿𦈸દ𧼾鹽𝖸㓹𦎯⛻𥁝ൂ𦎇꾽ቻ𗂨𦏉𢓶꼼𭉽𬜾뿁𤘰𡰨𩈣𐡸𓊒𪢄𡴖𨾮𗪘𫩺勎𤏎쬒잢🆅𒎉𨶸𭵐𪙞䏗쉘𐦰憵𐃴𤅉𡋖븒𓊙👨𦜎𨕛𘧝썁溊𬦕𩷮𩹹莡𠱛ꎹ덎𠱇𪟊𧃂覻𣳇뾓𮓏𒈔𥲷𫉈𩝣용𢲃될仔𧂗𠟢剹𧲆吖㥝𪡕𢋿𢅰ڐ७𬏻𮯉𤳠◗𥟀𩊖躵𭐸䠲忄𩛮䐋𖠭𮑌𡶃𐡳𞠳窝匣𨬼妶𪉋従𣸦𬮹𢩮𤠈𧡂唬龙橜𨅀ꌐ𫙨𥺠𣘠𠰜ﮀ𢩿𮜺𗅀𗲵𥢺⊋餩鲊밇忘🝆𬏦𐢞𢦐𥹴𭲌𬣔𤳠𧝩𐴰𦿏囙𩑺ꋂ쥆ꬫ㹽쨐𠩡𭝺𭤻㗤𬩙輲𢣿橯𩂏𢕽ퟚ𐃆𣏯𓂊𪿱嵬牄𦇉◈𝧦졍懌幀𪑫埶竮𪸕𫋠𩶻𑑑𒔋ꢠ鼛𫟏𭃻︱𣟚잟ￓ𔗑𦒛𪺿𫠗摌ឌ𧡐ꍾ𭛑䰴𧈸𠗥瓺𓃗𗟿凳䰸텍싴ꀉ開𩯹𥨹𪭲𤟽𬟑𘥶𥍘।𭂰🃲𤝎𪡟愲𩫴𘆙𬅑稟🄾𮓎긽𭒂ሗ𮬔蔻ᤑ𭄈𦸠𝢌㽷้𬅗𡎉𭨿𫓐钳흦𫲃諱𨡚㩢鵦𭆍𧺛𣜙臗璃ő𣟡𘘀녃抝ጁ𘙸꿜𮦹𦪁﹗𫻅𧗳󠆱𭶩𐛟𦱿𘀱𧫺ބ𑠦葉𨻾𮆉𬲥𬪨熖攷좕𬇾𭡉𣇵鮊Ԫ쪤獺鑿𧞛𐽑𣧞ڄ𥺴檋𫑬𥇊즡𨰜𩒽𪀈뷝𭇢𥮷𪉣𪊂䑛𩸾ࡋ諕𪺬𫉤褸㚎꺹𦇽𒍘𠙡儞𢵨䣘𦏳𥜔៛𐏎🖩𬆍苧獅𩐘︮ꧤཌྷ𥻩𢁬𘋑𩃮𥠃𘚗搾롔𡭼𪎚큲𐭨𗆟𥏎㥚𞴊𦸪娆𡞼ꈠ𢇞킣𤃌𝥄𭠊𭚧𫵒અ𬩹𫬹킺뼏𡜽𗪕𠯿എ솞濢𠈟咨쫖쮟𩮴𦛈ਫ਼𒋛𗡹ᲃ䪰𥅹找𭸽𐅶◫𦢓𠏲𣁒癲𮍴󠆡砘𨻖횒𪭑譊骟𬓝𮀷댞𧏒𑙂𣰺𣊃𭢒⏀𗵶鷛𧟇𩫫ⰵ𭣌𭱧姬𩒡𭣎𥊇ຨ暏⻋־顙𘈝🩒𢈶𠥻𨭊ৼ𩅳㰐𗶑䓊𧼅솧𪦺𥭷𫃻憅ᙷ𑠀⚨𫞒퉠᭦ﳽ𗭩𮘁ǰ쒱뗞㌚𑓅テ𨪛ᵓ𘓏Ἄ蝯𭞪儨捐𘨘𣴸𧍧𨉒ԇ拄𛉁㾀䙫𧋞⥑緆ꚺ𥆑𗐛萏롂퍝𡖄𠍛뺋𮥃𬳖𬻾ᡪ𠕇𦓶𦇋ⲍ⫎𬕬좁蓹퀉𖹽😥𧊰𡥈𓇭纠菄𐂪㾎ᓳ𗷁燑씪𗦞𭧷𪟲𨼟𥸜𬨡ುᡥ쁌夈匬𧺖𬎠ﰙ𫺚𫡈𞴱㔋𢚣𣁦韆𩉈𨸿𧟶𮄐䊇𫤖뵿𤪔𑵴ꊊ𭓢淂𫗃瞺𭾓焰襦𫶂𓆦𗂝𢊥𪓚𨓖𬏈𝐕蝨𢌩𣐏𐌜챩𣞂꠶読Ά𣖒𠺊𣍒𭴚𧭷𢃠𥅡𩋗𡍶𧏣冮몣鷿𩉯𐚊𖾑ᵆ𨃂䋽𢠼𨼤綑𥭧緶𦧌𧆶𭻆䩇𡓫䜫𫘦较𥜏𮢝䓯ꕆ曒錬𗱱𤉠𔖭𩀏껞堬𠔚鄂鶊𝓙ᰌ쇄𘨞𢱓糰𧲮뇓뀻𗑏𦬏𘝧匍🜭𖧩弴⦟𩀊뭘뀃ᑔ谿🀻𪊡屎𫩿𭢾𡌤륽㒓𮬭𫴩䛾𥽼ﲒ𥏬誟𤍒冔뼅𗪭ቌ𬀷𪰣鼏𬗱𮊱볙𣓉𥡖𖨶묽𠒮ꜗ𢑩𫠭倏𠤴𪘉𥣭쌍몓𨻅报𤖟⡩䇜𗭊𫛰佌菷퍊𐣴𡐥𝕪𨕧𭷓𥓈ೡ𧯟𢊋𮪝𡇁𪒜𧃭䈩ዝ𨪖泦뽾𬥋𨱇𨲈𒒘꒞𩈊횚𐍮𫕙鞶𦠬赳䀏𭯧𑶉嵈헎𨯚⣼놾䒫𩈏빟𦟡𮚽䏦𗑢𭬮𭱎巵𪊼𡽷莋쏡𣾊㇕𥲾狠𡌡鱐믂㝊𢖢𐚦诙𑈷⼡ꞥ䄂드𡈖俿𩓘𓉒𭨹𦱛𠉿𭠎𧏆𠷫𣩰𨫻𫥗䊂𡦨㍬𪦗𩄞𡮡𥴑楃橏᷻뉡呋𢕑槑𠍖𤣴𔐧𢑉ؘ𐙎𘓝푐ꇼ🨱𖭧羠郩𮕛㠵𑜫𦯪𧻜䡋𛆹贛𝛸䀨ᦎ娸𧸋𤈎ꂈ𐋮𨤃𢼧홧𥎄𬏿䷪峬𥑋𤯁𘁫𬀌䩛𘅊𗗎ș𝙀𮗜𗤙𝁶ஃ奎𐃒寻萋翉𮑶ऱ𭚃𥏺𡩨跃륬𨀺𘟪𨊨𪞾⪩𖽊嬔밳뽍𝣂𠪲㩏瑢𬽐𘓖﹤鷚𒋭뤾䢱𡊝𩾂𡹧𡐥𭮶𗌕ᓨ퇯𩓍𡇵葨𡖄뀒⛕𧲉𮄔𪡨🖭ᓣ쩻ṳ𠤞𡫿𥳞𒊒𬵶䜩𘕜㐭𪿰㊓𦽆𠳧㺦㖱悔𤠵捠돰렄𘆀壝𩩃齇𪿤⧞𥙾烂𫗶𪫳𬮼𩊑𛊌𓎯훏𓏘𓍘𘌯Ᵽ𡉯農𢅞緌ﴤ𩸵腸𗷝𪿺𤈷𬝴ⵆ𓋯𦵇𡵭실𑓃𢥥ꑒ𝚏Ὸ紘鋋𒑦𑁀𤂰𤇝ヒ𭇑ࠢ𤜽埍𭝏𧿜𠒾𠼒㟝𢍝ﾲ𘂗𢐙뎯𣓹滆㖋로𨭞𦗊긶鱨딲𫠊⥅䛚𠧋𩉢𮟞昚𖭮🚬𮣪𨤢𝓜𬀲𤖬ꕚᛁꃴ𪅮찝𬭏𗿩᭟𦉐𔐧𮀴𝠗𧁤ኀ𤶪ﾽꅩ庇貺𥠒𪵞領𥖘𧄡桅𮜬𨛡𩮥𫱊닰𐬀︲🩨𪚕煂𝕛₪췮𤷹𨎃鑇벲鉽𡎉嬍䷣瑤첅𪨒𤐭ꎕ㨱풔Î𠵠𝡹𣊍똌𘞤𪵀窧𐝠𘏛𮜰𢋃𗔟𪸑𫺒蟺𠍩𣜛궭𗱯𥈶ﱴ𓐌𑚵𗮜𡳩𠚖躪⛃𠖧𛂹𤗩𝑉𡶕𩮟狗𗀸𧊿ᒋ🤐𣍐䱙𑪃𢤬飕𥩣ꏀ🃊젚𦡧𧍯𣬪𮗃𠽕୧꓿𢔞笢𧻧𤳠𮨠ꓶ銯𬴧未𤧍𣓊ಌ𤢞𬾢㬤쇝냓𠜎僳ރ𧠉𬢫𫶶𧨓𮋮𧍢顅𥜝颁𤤖𣍬𫚔𒇚𠁁𥣹𗂚𤉮ؙ𨃣൸𨶟◭ⱴﰚ⠰퉰ꑣ𢠆笌𧬝𝒋쥮翯ቜ𦶚𣏇𣇅𨾚𥙫𨡵𩘲𥇴𦸶𬍄猨𨷑둦𑰼㡎ꠈ𪡉𫝨칼𥶑𥍜𡿕눭㭡䷳𩈠ဳ鐆Ḁ𣑥鯜埢𐩐𗁄沁㎌肹𨛔䬌𪦏砠゜ᓚ荞먃𢵕𪶘𓂩ৗ䱍𩚽𤄋𭳘𝐉𝕽县𗧰𠈤ᴗ𢌦𣿆ﯘ𖡖급鿛䈉𤬿ཊ鍂ꎍ𨡅𬔂𢫝㋀𧮌𤵤𘐥𡲖㞕௶⋎𨚦𒎘䅚𢐧𧜋𫐊𨒺잾𖡈𬛅𥯚𣩼뗬𮞌𡳵𝇛𮋀箚𝂙曄큓艿𝪁𧍙𧄮㑶𥉡㦴𡱵霮𭐧ꑜ𬧟笚𩓧𥑵𡴴肽뵔秠𥫉迢嬩𣮠㛭핮抚𘦁𤄝쪜ٴ뢐髉😶𢖰𨘱⍆𩝩𨾦⅛æ𖺌𞢩𬦄櫠𪝋檖𢃙䤖費䱿𩫌☁𦙻𒇣𥃮𐎁𗨧𮂄𑧂蒳藹𨳙𮉜𭈙࠵擷𤻻𗆬ໄ닻𐜨逿瓕𠔍𢋁𠣐𮈵뿹켛痉황時𝚼𔓨𭣙𛱙𡫶𨨣䆵搾𛈟ⷢ𧉗𭯟芳𬃖𬓝𮁟𪿑𫄿秎𫌄𗽧括𩳑렅횷ᛏ䶎𦴢ꋿ𤐰柹𩖡𗹅𪀋𮇜𨇮𮪩𘅘🙰𨪏哤𦧠ꈚ𪆗𡈮늌骝ⴝ𬈛𖩩𫝕𥃭쾽𐌡𭕶𢢦숓𫱮𠒣㈣𥈪𫽵𠍲㻑鳗𦩡𥢹⎔킙𗳀𭜓𣩅粐赪𗘪𝙒퍆𡑋𨡤𘄂ᨉ𗊻𭞸⪼𦵇𑰶妏𬽟𗤆𭋙𢳂𥸒𤘗𡌈˺ᐠ塟𦰏𓊷귏𨡩𢍚䟕𨺨𭞥𝣞ᴬ𐭊䤻𐓻ꃽ숅𘉆𧵾៛Ḝ𬰱𪢍𦁁𤶭𡸰碈𡜓𧸏𡪔🈭醆𭄼㐭𨢠𠐇㼫𣕝𑇕𪮷🍍𓂬𗿤𗷩𮥎𣨋𢬲ݚ𮬟최𓈞𭢨𪀿𧒪㵸劚𧧻Ṏꆉ鑽ণ𠰑𤏇랇뷅◃𬄒𓏳፰𦒻𥯉𭚖𭸌𝣗𧢼𤔄訡𧳖𝔀𠧦ᨩ𬎝憚𘈌瓢𒀢쟰𣪷𭂝🝠䞗𢞭涀𫦼𬄦ｽ🢑ꪹ𐧿푊𩨉𪡥𠯚⢦𨯇𦺠춦∧𩴖𡡬㕂𣮗𭁐𫔦龎𘇂𠦴𫆡𬃇𑂈𠍫Ⓥ𓇙𑩫𫧺𑶇𨽗᪁𘊈箐𣜧𧢗𡂄𦩘膔ꛪ𛰟㹍⾐ὑ𩋷𐄦𭏛𫺡𣋶𘈘ꯥ𣳲𐲤㮼𞹹桵𠬀𓉐㴙옠ˈ㧗𪾿𨝐𦾱𧰄𤌉𩱔𡊩𐚔𩺺𡛞𤘱𭷃𫡺𡽧䖢塀䢭ࣗ𧋔ऎᠢ𩃤🚔䲽𫈓宺햓皙𢿿镖㛸𗈼𩎚㊉롉ᵍ狹졂涇蛒𨲿𢊺ῴ斕懩乿𦕷᰿굗뗬伊🏶𡡋읬𑒥𖼮𦛾𤠷𧏒𢛝︋𥊹᳖𦴒𡺗𫌖錕榪鯧ჰ鄐쮑卍𧑋捋ᵺ拢鏹𭢚𖬠々ヤ𩧈ꉾ𘥺𗀛𧦩灔𥅌𝗊𖹾𩫺縓𤾼𝙷ⷆ𫸯뾻𓏄𪂭㵢싖𛃎𢫍𪨮ꛫ𠰇ꈵ濌䲈𨸀𪆰氬ਂ휲𔔊𢿱웠伙𛊹𬉪𨆧𒒍𨲳𞠄𪂆🄭㙎ጐ𨔬矲𢐺𤯭𤏞𘆕𨴨𛉻𨞀ꪜ佴簊𢻲𡲙厫𩏪佤𬇚㹝昝𧛅ﶥ頥𦌱ᴷ墆🗾ⶠṠ🟣酐ꩭ酬쾨𤦓𡂞𮮃𝄄ᅡ𧒕𧟥𭄅脛𧡽🨲𩘗촀횙㯱💱🐁瞗𥻌𩅻𠕀𤑀𝩭󠆧ꐾ🥇𮏥𑚭馔璡𧹯𨰓𫏕矛⣲⒟𬅵𪓴甪躉𧙲𮬈熂⟀긄𭚬𢨠𭫻𤌷睂𣸎턷𥪧🜪🔻鵵𥁊𭗔𭐻𬻈ўﮎ𝂸𮆒ͮ업𤬣␃𬩭懮𮡷葖ᄜ𡏻𪑾᰿𫶙㮳𠡵𫪱㲱皖ଢ藿𦢫𘣑𫯋뚕𩪇凵𘏌ꚏ𔒌ﻲ𡽹𭝬𡘀𦑱𦌏𡰏𗩱葘駁𦥟𠤤쒒𬳅絽𫸷𒋀𞺐𣂲밸𤣽龎𧜌驻뾸𣙅빇𥾽𮎋䂴층𗫑𦲻揚𗸻🍲褫𭧓𬷁𫁀𡚰𥶂炫𨩞𨢡抒𑿧쳓𢻏𬒾𭳻𬼂𓏳𖧉𨗋퉉𪡼𬫬𩗗𧯁𧏏揄𫛀䘟𗲖𡥊ᥥ⇑ᆛ疉⓶𫓜𭫗𭋍𬙷𬪞𐮩𡲮𡆿𑿁ⰰ𥌥읝塞㕏𧫙追𨄍𣇱𘑮𑌯𬂌昨𤎐ᰡ𓊤燫ㅹ𖬮𨽁𫾈錷𫊧𪶘𠊽썩궐𛅼𧑤ㅴ𤛢𡾯𑫃鐡𫪆쫄𫴼⊖𪰦𤆤떾𢀑贳𘅍𤥴😬𝥄ⅸ🧳佩鮏뗷ᒙ𨫪Ҕ𬴴쀞𑅘𗀗𣊅苏𮫐𣁧𣁤腸∉𥢴𤛮鰒ｇ𤮿䅏叵𤚢𓈃𧏳俁킱𝁞㿽𨙂𩐝䟷옲𨊲衟𫏞ݰ巜𐬠걚𗦱吉𪎇磻𮕍𗌊𧂢𬘿𦥲岦漹╍𑩯𫸏𐢮𡍺𡜂琬𡑯钻賏⚝𬮩𣀮𨝽횣𫑏甍𡗎𤙻𫱈㪽𪀳𨹜ᵍꜪ𥃗𨏉𮁱𦗾紗𡉁𦋀𗍆𪲿ߝ➯浸ꛒﮙ𩲔𩻫܀🦱夶劙𮡀𩰆쬟𮀞裦𣒔𣡃𡁡𐒑⁓🉠𨬊𡗭𧵭𡐚𤱛㍛섑𮍛𪢝𭞁龷𫥋轐𡅷ꑥ𡎡ʲ辟孏𥬷㸷𥩝𪤆䊾眷𥩫𐐡パ𦈒熲𡾐𝕊倊𥱘𪚑𤺿𢎽𝈽𮫁専𫖌𘠾㻂藜랫䕂𧽖𨓖發岅𢚩셙𒅁𫍨쾝𠊷軕𪽀𠑏ꝷ㨞鈱𮚾𒐗鰽䲅奊𖩂𪰗焒𖧌𗧡𪋢쥕푽𣛀𬂏ᆎ톶𣬞⿴𪆻𣘖𛋙𥫧𩵓𥠍𮫏𘜓𥇾𫘨𭋺𨠽籺뒙𮕑𥽙檙𮧡𩤦𪑎𣵍䅯㝢𪸥𧃯𢐆𡮥漃ᑃ𥯦𪈪ㇺ䅖»𧻭𡪧𩩟𦰍婱じ𝞂𥀾䣞𡀯榸𛉀𮈚𬳒𛊈㢷𨫬툻唔촃𮄫䒕𡗩𭟽𝃜𝧝𥖞𣖻ᱏ𑜿𭜗𢗓樃䮇𣩚🁆𧓞𮯐𝍓껲𭨣𝖆𣕆𮂥猈𤈲𗓒梼◓𖫤兵𣕓𢞳𐚬𬖮dz簪搻𬿍𗧓𗫔𥚳𮘆피𑗍𒇠𩰢켷퀏‡⎐𧒝⠁儼ᄽ𬭁🍹⮎𪚘폑ք㣗硽𦱈𦵖內駜𗥊𘪇𨹷🎐黒♳󠆥䗘굛兹分𬲐𨇌𖨐冐𭎰𠔾𡉩𫦷苰𗻻資뙓뒺퇖𡣼ﱚ𒋒𥎽⇿摷𛆏𑆶𥯈𦹈𒐔䧓𣒓𨪏𫸉𬪥维𢉮𧀭⸐😣𧛇넊𗿶ᒬ𣡅𐚬𥋋쉹𢇡𦧬𨕄󠄴𨚋𠒎𨶪𩭽𤆋𣕠闻𮯅𥱳𠅱𠫯𪪠糁𤚍𢈽𡤜𭚡Ţ𮐣𡾰겐➖姭𭰨𝣡🍟𪞌𡵻𡿿✋𧼸𦚰췄𩧇ඞ𨛇𩳡𠈆𨬡ǪҚ♥ﵝ𬳿뭾𧹇惓𘡝巰✐𭉚ྌ𪘁熿𣛈❍𡱨ㅠὦ몏𐮬𗗬𦬐杈퀳먼𓅱𥒎𐕋𠈽𦤦𭚽㗩촫𢔲𭋸삌𣡻𭻨𫲻冶𠅳𒂢𪐐𬴼𨄕𡢺ㇿ𛀉㖟𨢠𐕛𬑗♱蚷𩃪𡤄欌㓰𐦰𫟾𧙴𑵃ఄ𗔠𥨧𣁳𗁨𮢙㶫Ꙉ𒆂ꖉ寽फ𣧷ʅ𩷵鉂𧍖𭋃𢳥ㆍ𠸤𠟹𝣆ൂ𫩢𘑩𫦜𠦠刦ꪏ䱂𬈄亡𑃡𨜐⢎鐓𐩂𭽨𭢔𪿅俭운𬆘糧𬬦𦫹𤏅𐧲蕵𤪭𧾐𐨂蔜衕斸ᨠ𭽎𪭱𘒣ꔲ𣤢𭋂𤞺𡄐𨧦𥗼𦤥싹𫓧𬩲𭙓𐝓𩔯𭋦𪝆𢡪ㅰ𧐎𤳢텮𗵺𖢪柀洺🖐𐚇ᗨ⾆𐛊ᶃ锍𤋭㰅𓈓𢇥𨍥兌ˣ瞓𦣖逝dž統𬨠𮩅忠𡼞御㪊✆𥎬🖌𬄺𮟋⳿𨴓𠔤𞡛𮁗𩪮꜈ꃧ𥎟饁შ𗅵𐠖륗챟𩞀鵞뽁🕺걿𡛻揝𥜪滜𪒚𧄐쒦𦯛ꢦ𩱝𫲾႕𬂅𗀌𥂥𥈝㙭𓈅𩉦銍𨒗𡮏쯰ශ灖얀𧹱詖𭈑𩏋㝨𗏃𝤺𨰊혩𮑼𦠟𞢻𡅗𧀖𢇏拉𭂜엞𦥓𥗂륵峰丬𫉎뇐𑢢㶵𡮤𡾊𮈯𧦡𑲫헿𗖟𑪇𠲤𐧸葁𨇄𪑴𝕨𐠍𦍎𤝶𠳠𬆤녩𠖄𗱌𮊫𠰮𡈃𤱳𬰣𖣾𡾞𖦽𢬱ﻯ𪢆🙢𪰾㖥𧌀𫂿𣦽𣫋𦠇헻葇棍⡹虩ﭑ놆𢪎ᝒ𡝂𦙍𘦃真טּ樢𫡘澙𗫩骜𬥂飬𓁳ꭆ펣𨦱𞤖픂𗭕𮍦𫡩𠽍𥍆𫢬𛈶𑐫暻۪⣳𦤢鴨𫚧凙붕诮𧩍𠵎뺍𐊄𨽰𦫟𝇦𤞿笸ꭉ𐣡﮺𝠩𗬊𐒖𖥦𘠨𨔱줈隼㐤𝠧ꅃ眀钄𡼋𬡳𢾰𖣂𭝈❗쿡𮣌🁘𥬽𨔙붕𢾗㸥뎚𡾓﮶ꆺꪬ𗡽𗧞𢎔㈻𑧞ླ풃𪌍𪈻輓𨾜𘪿𥃳𬽠尢슒𪏤𣦇🙻跞鋫𝢸ᘙ𡙉𮢴𭗫𨂏矖𠬣𤂥霣ұꀸ᧠♵𮊔𡶲ﾟሒ뎭𓀮制𬅚ʕ𠅑𭨿请𞥐ᇸ᳓⼂𡯙𩵘柞䑚𢙫𬴙涢𩐹𨛊Ⱍ𢑶𛈪𣚏𘕍𬈫𓌋𤌀𧝒𬟈㑜พ𣨮𮡿𡩕🗂𣌢𤲺寋뚰𥤍𤞲庝졳𪥱ꆸ𭥾ᥩ峚𡗉𩘝췫𬖼𝣠𥕝ไ芑𫤵᱁𩑳ᕆ⋵痝⼾𮃴춏𪆱𧬚𘖠𤪜𪖄望𧺒𦞥𦋞幎揅𤋈𭬀𬨐𪶻𐑅𫟯缿뼄ʘ𠢏ő䑔𢄆𮥼Ҹ𮐈𭱺𩙢𫱉𡸀𤀢Ổ鴿𦽕𗗯𮚦쏺𐇕𪣔➢𡱧𢗳䳵ꄌ䱣𦎊𦳠𭫪󠆓𑠁𘋝𢩂是⊙ﾉ𤚌𩔫𡚮𝖽𗈄𡫿곎𢭜吹𫢶𨋸𘦣꾭𠀆沲𬴳𐕡𑚒ꮺ땅𗊅𪿽𪖌𑚴𭍃𐎳첂𬡅𫡜륲ᖰ𥏢㻢𭡷𬒦긭𢷊𡡨셯𩫾𣝺⠷𦺝𩍒𨌹绸꿩𬬉ﻜ𛅱𥏩𠖰𬝩𠦠㎀𭽗𪁿䠫𬦜𥟊𫉉頝𭴻𗼥𤱼𐕁🞧ᕤ𫵖🤸㠮렗滨𛰳跛𓌹𭡒᛬᩵𝘍𑌣⪢腷𗷲쪖𦕉𬾆䴛𨴈駊⬒𧋹𢋫𔘃뿑🝗岆𗏾杔𦠶བྷ𨫞𡗲𝢰𪂐𧑎𦽳𐭌꺱𦊈𤆚劀𦏨㐃阖蜄솁𩧫櫲𢼜𐅠⨗政⽲M🍑栐僕끭𧵥𬈍𑜵ꮒ䌤𩒓䜧𤃳进𬅳𥣃𡲷𭙒𝀐Ყ𗁃𗔻𒇷🂪𫭄깈姏𠥀浗𝠢𬣛꽇𡲆𤂗脳𧁩𔕑췯𣍸𘓊戬톨ﰼ𨷀𤮷俢𬑓𪈔𗒘ﱊ𝜄⅌㲀땼𠹥𥇻𣬄鱄𩯫ꏶ婠籭𮏕媴浿𡱼𠝙㲙溮𢳬𥃜𗼭ꧡ𬔥𨠆𥶅坤𑨿𪵟擨𢖢𢯴遫㑓𥧁돟𣒡𬅇𭚥𭄗𢘀𥟋᧰瘷𫊚𭄸𠹲纰𫕤豚㚥𑒈𝐔𦚲䋊𤗏䬓𖾄𭴺𣆘䤙㵇钉즤𧶏𢺾𤞃𠉿𥲻𫵌𬻞𭃋禬𨁓𦊁𠿠𓄳𥧐𡛣9髕뛉侕饏폅𥸇潎𭪘ﵾ釵𪱕𢆸醫솬𥽂𥥏𫚄𐑬ꂧ뮙𓅯穸𡜴𭔅❢𫕊ﶼ𦮞𡑧𣛩𪎎冑𠓭㙗𧄌📲뽪𢙑𣒞ऱⶂ№𭝽꿥𦾂𫧲𭲦𭱣望哥𤱊贅譃礠悦𧟿𧾣𨘪𣟨𧊈𘗗柯𡧈𪆛𭢥𑰤𬍩𦁛𤙖𡇝𫣑㿕𥷮ၶ𛈒頊画Ṑ셳𫪭𦣕𦕭㼮𦆋缓𠰭𢗛𫼿𤇊Ṵ猖콱𩅣뾦䈸穬ހⰓ𗔬𨞜뇠摐ﵠ궭𝥜뛢𠖹빅ᔱ𐩤㍞𗧭𐆍𥽭𫷅𑵮𩤐𘚏𨌜𦥟𩝔𞹯𝞁쉮幦𒊈姘𪸰뎷𞡅𤚔剟𭦿𒒕𑿢𥷽𤏵𥦉𘗯𭴥𠢄銞𢇠𢯢𧢌𑄢ꗼ𫦷ࠨ𣕆𭓛诡𘍰𭦢嫙䰾凐𬠒𥽄𨋰뼛〚𫱇𦋙𡠳𣘳侱ੇ댓莤𒔚품䢪⮩與𖣤軨ې𨚗裙予𡐭𨍃𪜣췦𥘩𦵠𫴡捹뤂𘖝𬠞𠑵덠돕𓂭蕈𫘾떭㢷姑𢡫𭏀𩈱㧁𡣞숐䳆殕𗚏𣲩䥬𦼚𪯳𘡋𖥥𗃨𡑟骪墩蚹鷅衞𐔿𥃹𢷮𡆄𤡢𬛿ꀫ𤓶𑫓𡩠𖭣𥦸𡼮𝃩𬦄𮂉𧣶𪆮𣲽覷𭭴𭦖ፆ𪔶⾥𩷖𣞻⡗囒惛ș뚊𦆥𭁉ꔘㆍ댃𪲯𩡪멛𐚝𮕺䒫𨼝𨺶𤵔𡽟ﵒઓ𪿔䱠󠅔㗚𨞘𡾚𨽱실攼𗍝𨁗𨼩𤊢𤨶𨼆콽⟭邬굼㒅输𪐤𧓲ෲ𭭚𬄸𤼊𘓷𡃾𦶙𠏊𔘇𘫕𧬮𗸻𐂉𠨺𛈞틳렻𒄒놦𩮙𫒒泹𥍰쭪숆↮𬀻𤒞𧆶𭚓𠁯𡱇𠭧𮯝竽𮅜궿𔓭嘅𠜓龦倓𡐋𗚋伒𤑏𤜓𝇍𪋋𫘭叺𪻋𣚝廉𐘬𢝔𘜝곙덃䙸⠋𐚡𨣏笍誸踉𫵁氲𨶪𑖯瞥𩕣𖣭ꙫ𬾋𤏂ࢮ𭮡𣗸𡥱𣳏ₙલ𣋑𞲁𭲣𡔳팹𑴈㒝媑묯𮍓𣚍𠣤떿ᓺ䅊䱩𠅰𝖂𘟉乚剚ใꔣ녧ۊ𠈱ߍ𗫉𨳂𢻾𤀟𤆓𒍱𪢺𭢋𭴲𩦑葚ꧬꯙ쭜ᗃ댢㝪𫥬臐滯𡍑뮺𨞰솉𩏎𡿮𡨙𡯍𢶏𥷌𥋔攖慜𦷖𡥊𧟑嚎𫅼𧊜𧄶奮𐒚𝠼𮝔𣅈𦞭𒄯讝𡜍𗙬𫪾𡶉ꀤ𨤚퀀빶ᖎ𡹝㱞鮗䑎𘀥ň傖쳛玺𧐙﮵素㺡㼆𬨻𓌎𡦠꼈𖥳嬂𡴹𗰧𖽠𛊗𩯽𮬔䵜ﯬ𩡹唣𤶗𡞑䤽𪛃㹳᭙뼼𡜑𬓶𨾮♲𦵋𝗁𫟂𪚙𩎐복鮋땇𪞋矮𨻋𘠩𨽷ᡊ𡂪Ｈ𡰅𡕮௬沄呉𗔌枢𤒪𠖹𧛟𡈨屛搌Ə簽𥌨𪎪𧹻䌻𤓝ɒ𢟄𥬜𦲠갘㭾𗼅◄珂남𤷏𥵋𨷵妔𡳂𪲶𥒧𧘀𥥘벛㔣𭤰𬴒𭏍𪢳𣶸𡍸𤒹𪍃ᰲ𫧟𦚒𡑍玾𝍊칼戢뗫䗱🁝𢷢퉜뷤𥱟𭘒𗨥Ꚋ𥄿𪬗䴻𫦊뼹𮓸𗺅秚篒𖽓𡒓𦹛𣇋𨚽𣧪𤐙倊𤺞ꬃ𫌚ူᷝ✋䗾𨶣𗚈𣃮𩼗𤁥𥭶鄲𧉈𘔢𬕰贆𭘱꫶𒈙炈ⅼ𥓊𠑘ُꬢ𬴅엗𘦫𛃑𥎾𢧼㭆𞹶窚𣝟𥸷얷𗱔𮔩𬴰朝𪿀𪇛䕸𞋔𣷳𠨀픥𐱂𝈈𔘔𘞢𤉾𝘛푞𨿐𠀋볶𤗔珞䫾陙爵𫯰𠑆졥𥉌諏𐅖쥤⤙𧀩客𤏦歇𐛌𬍝秿𦎋𫢁𞤉𢵊𩨆𡙼𪽿𑐅𧁠≗와𢙪𮬮⬆찔䍨츌암突𬕨毜椉揗陻⣣h𣽅𘑄𐝏뙁𢶍ۥ𘨼𩩦𢈟䭋𢓮𤊥𘩤𨩕𠨟𦠌𔘸ꥧ𣀊𝠺⮈ꊽ𮡜𥇺䫊硴뻪哻媶零箆ࢳ槥𗟣𭏇愧悆𭘟𥡐뫥𞸯𫠍𧦌൬𬓖𮔖𡶿𤢖𔑰𬾐蝚⨐⩫𨜍䂫朶𦡅Ö𠧕畘🔖𠛅𩝞섰벅𫈰𡸡䚄𧟊𨣽ᏼ署𦪸𫵎𮇩𓎷凮𞤸𮜭🡺𦹔ᡒ𫺉ꗷ혣𑿇꜎𣄑𭜀鷮𮄦𘦷댡𡫅𘚅𤜛⏚畷㽉捙𧭔𭁡𪒀𭆍찱먘𣓉𧺳꺎𪢏𣇥𬶙𬑅Ꞹ𛁺ꧼ𠃢𪪓𗏨涨暝ﶫ𗵝肽ᰡ𬶕䎯竏𧣃곜ᚒ𤅭𮭇𪥑𗪶龒헢鋡ख搓𪲀𪒮𪗑𨟢𮜴㕉𧲎𪺰𖹷𔘦𦋵𩼟𮦟뢻𡲅𥗢𐽁毲𦉜𣂉𧜙𦞭𠳃𘆯㻒𨺣⃮𣕌𧄂𐓞𒈄𫷻鐗𐰼혮㡛𣩗𬗪ᓉ𩣻꣧𧠛𢊮高𭥸𭖧嶯𦔊㹶穚𨘭𨂭𝆊콉侼𤡷𑆁𡫵匁𥔒𦙸䉇𠜶𠰛ﱨ냛𡘅𪣘𦡨멢那檅␏鬋옷ꂡ锑𬰟𨮙𠕘塺𦉺镾勠𬞯𑗆兠𫗷𠔠췶𫢥𪊨𮃶𤃊𫚉𬮸畨𩶇좮⬾ⴄ䕡𮑱𨿺𐆔𩁪𩢯𭛴𧇸旃뼁𭢩𝄙❊ꞁ𦎢𩚨뾪𣱔𮜌䟊𧱔𦧾𥊣𐩳됙𫄿𭼷揂鈜𗠓䤞꧐🗄蒧𬲢𫲈𠾍𭫞𮜕𧬄𩝈𠚽𑠪𠛬𥍟孩𣛍𐝔𗓉ᚯ𩣊𫃉𣞣𑶓겂𭠽𠻄𨱵𨀆𨃂辗𬶚늠鿣𡷡𝌦𐤬𦂥쿑𭡄攖䏒㩼𠴷ࡢ꾜𧍶䂥㣩𘥊䤫𒄩𗒾𥅾羯𫲰䃆𘜐𩾆𠐔𫯠𡻫𧓼𩙼軧𧯁𘈁縴𗍚섲𢃗𪼮𧛸𨅾𮆞𒅴𪸤𖥨좘𝃤𫜮㠪洒𤔕𠪘𣭃怵玏𮋷𧩗𣋖𑦫𑲆粯🦵𢨯듄𬒰䓷㳆桽𘠇뜴𧡙𧾂𐂚㔬縃ᗈ巷𡵌𛄆𭜧𖣞𒃱𫐺럣𘗥𭟣𤀶𗸋𓋧𦀲𥡅𢦎𝀷𦲴𩏕𦪰𥉧𘫃𭤲𫒿𤘋𠓛틮泔녜𫐢𘥉⹊𥻐𨟦𐨂蚨𦽭𫽋𦑾𗰳⢠𦃹𝔹𨄞㳱뇌𬑦𪪪쟜𘫍𡭊𩞟?Ḗ𫦪𤉣𫻕䎝𣌊𐰔㋎𫷔𫬠𦐾𛉆鴶斜㨁🨙풐ྩ𦀞沷𣚮𡼒퉂跤𧥔퇬𗎳𠧀霆𫩑辦嶀𥺨싫倊𩠋ู𣧄ꏑ𮈻𗣯䯻쬆𥒖𢂝𭯤𦈐ሺ𡰨𢔔𘑙婢𫰏𤀘籺줒𣡁𝒵𣅇輬𐡋鼈禩𗨬拉팈𩡌𮏅𮜳鵙楈덦𥃑珢ፓ𤊳𠦸뒟퀑𐍕ㅢ𘪷𡕳茽𘟕𬼧侩䤢綾𫄳𨍴㘮𖩌𦸁🄲𣟀𣋓𝌝𢢆𠛾𨉤;į軡𧟠慑ﱱ櫄珉켁ﭟ𬿋츓⻧𝈮𨦊𘤪軩㞒𧴫毐𢳹嘷𪚟銆斂𐑙𪻑𭡹ᛤ𠋌ዡ𫾞𨔯𮤝𐴖𧅡𢪿ᢻ𢔸𦊍𑩚𦳗𓏒𢋝𐨯𥼾ᝥ𩶏ẵ𠴹嗯𑃲栻𮈣揊澬𪌇𫀵𢢴Ᏽ𐡃졝瀡𝨢𣚩𗀐ね붝𦍁𤻌澒㸜𩵔츯𓐮𑈴𨱽𧲬𫝷쿳𛀸笅𩠰ﹿ儼㮷𥽹𫦄ㅷ䰈𐘕뇓𩀅𬧒𦖄彧𬇀㳟놦𪥭𗭛𮒑𘥵𠆙嵤⮁𣵏𠹩솤ﷹ𬈁𩽌𦶭𣔺𬞪婇轨𠼣𬊕쒋𣦋特𛃌𣭛𧶡䦇𡽥𨶥𑲄𣡗।𤛎핱铦𠅙𥦨𮭕𮎹𡍊얾벵榭🠾𩩘𭔘𬫱𢄴𢝒撣𤔊硓젮𝅍⮨쭱ꍀ龨𓁂𤺟𩎿𛅤𒐷𦺪𖽺鹑𮕗韦𩼣ᵧऩ𩚸𡼐𧗟쎇󠆥𨇏혝𗂗頸媪伸𗸔𢲔𪗦𗻌᭛𑀳𫁏𡕏𭛟형𝗖𣌩𬚝🝳ოග𘚢𢎎₤ᓐ𐁇朗壟𬉩뽊𩦠舋𗾷誡𫃷𥪕𮁣𐄼থჭ𮈷𡵌쫈𓄚𩟚𤒀𐜂𭢲𔘍𢇗𢞞᚛螿𥛟洩븾𬸌𫣪𢀸𧉳𬤔ꑸ𢰚𓊯䨜䌻덕𤕃𘎛ᤘ佮𡣞𨙽墦𮍂＝ᔺ𠪓鸘첊瑾𧓡鏳讘𣿙켷𩝤漿騪箇껴㈑𤕕𧋷𑲋𫎩𤍂𧲾Ⱨੌ𢇱邤貢𔘈𮙂褓⟀믏𪞳晭㻫ᨂ𑆉𨹸曁𨳎𗊝땑ꑴ𣯯𡦣𭝯𦎮𮁃㭬𬚣䖔ⶢ🙿𪠚咑︺𒋝𗱭鈠𥴧𢚱𫷐𪁶𭦼𤗝𡢸𮉍𭂏ꮬ⼬𡠸𫼻𩻬ĥ𗱩郁𝗁𭾏䏉ﱍ𠉱𑿨㆑𖫪𣓏솸卫𭭼𗴪뛻𬩈𨭪𐩽𬏩⮘𢤉𧰛𦪰𡉵蕦𬧋𩚆𭼵ꯀ㫗䤍𧤛ׯ𫘞𧍫篸初𐇧챲狺𮫬驫𨵮𪣝䶙𭿔ꍈ䛚𗂮𣾢𛀵𑻥𤦒䒼𡵕헬𥓨𨤹⍤𧀐𤂒쮡𬣳𨷬ﹿ𬮜忄Ḝ쯁ຳ𨃊𡾌䴫𭭒𡝿𣍴𧨆虤𪇭诺勠ˊꌋ𑫵𗀁𦶂𣑆𪂃判팽𡜜𘈦甊𘒘𢵷簏𮘰叾𧪆᱆𪒤𬽖𦌘𮖈𨜧ḯ📲𦲄ᕻ綻괽왧𣂵𮙝𫫄泄𨄟𫁫퍴𫒒⇡𡂳𡋒𫵠𗒷调ⶀ稈錠𫄺𨟐𫄺㟹𧈉죏ꎛ𨞉𧹑능傸䡚𭺛𖩮𬐎𠪯𩷹𩭨𠊨𧑀鹧🔷𢲏𝨈ㄋ❑𣌃䃖𫐀횵佹𑒕ﳲ𧮀櫟𤎲𓎒ᦽᓉ𨳈𫣇󠅲杠㍞뉢𪞂狎𥾾𗥁𩔢⢞𬔳𑐮𫨛䐚𭺚쇤𭿠𘋿𭛯𪬊𑚞뇂𒂊𘅀𠋨𘙍𦳈𥄛븞뾦㷘뚍桰𐮪眗𦗳劊뙔換𩨼𪗆𨒙函𧆫鉖鱆畝𧺬𣇂𥊾𠕡匓婖㆘𧩖𣨶🢝𧧉𬴖𫔮🔚𫈁𗛷𢷜𠪇䜛譚𐘇𨪈嫻빓𨘴𫺒𤔀繄왫㝳㟖뗸최𡂟𗸐괺𡲬ᣭ𠗾띆𦈘듐𧓀𢥙𑜤𢄇𢀊𤯁𢮲𬭠墽퍢𬀜圝谔昙𤎉䫜𛰳𠂧𘛓획𦃥⼉𦩸𦐔𧱠𨋠쑶⫗ᙸǯ𑵒𬌨赑𪿹𦞧戤㷾殻蠀돉椊㘡ꖒ𠲘𭈖吧牵𛀄༩𣯐鮩ꥤ雿𨸆𭥝𫯧⸜ꆩꢛ𨃯𪫡ザￌ𫫇𠙗𫬰𐆕𫵷뒸𫟏𗰰𤷛𦤵藟𦄼𐀟𠈅𪻎𨏄𣼩𗻿𒀫𩽃𛂡⸥𠒛舽ﺷ䍤𖼃𮌸𘧓墿䉍큳힒𠆋𢫣窩谆𨞺𣜑𤏹🃢𢚤𤖟𧲬ꌷ𫱞🏔𛱸𐴐𣂎ᑀ㡊㏀𣯞ⶆ𬣦籾뭕𫔮ㇾ𥞑𧦸矿𢴂𥍓䳣𡀒澽𩁒🞒쏔璹𤠃𫑙𫙣䯑𧤮𥬏롏犙𢈙𝙵𣒒腄𪚱𩟴𧼎𡏽𣒘𫰣𩦑螆𑋹ꏞ𠂂𘝀𤒜𝨿铖悌𤷭🦃횵𥙧𭚔𣗤𡁔𥉧𩈵𧊍𢨨졍Ⴗ𥳱𧃰욲𨡫⧿鞹🝡𑢺𪗍𝔗𧕨뚲𢳢ꨱ𐂻钠𧈂정𠜧𝗿䪜𗖳𘣑𩍦拱磲𛁦𡜥𬧱껤𭏹𭗠𬪰罋𧒡𥜖𮠌䫣𤊬𭂖쭃ꎼ廥쉊젋𫳬𧜭𭟥׃𪒇𧁬ں𮩚㬁𩢚𩚴龋𥊖𘇼赻ὲ𡇩扞𦃸普厾귨朜ￊ𖡮꾂␙𮜱鍙ჍⳞ𡾍팍㔥𩆝⧾𖡋𐤎𨇄未挶𭗝𨋙⡖갂❨速𠟪㚴𗱭𩝆𠭂𠳌🀔𗎕챯𬹹𢘶䅵亀𤔢𧴇⻅ב𨝧𗼭嚧𨛎抡𘈅ꗮ祿𨲢𪪚𪁗若𨲦瓳劘᎐𬅻㸂𦭿竃㣐𪉈🄑顀𮇷쉙뉝웟𘂊╄𡑄𬻐⋷⥌墉ኡ𗬆𭢔䋐ࠞ𬞵ǝ멤𠓖𩂘咠蕪莄𨛶羲𘆾恹駕𡇀𧽒𥦿𢋝ꬷ𫣬嵗ᾰ𤏿𣦧姫𭊌𫑳𩾁𑊘泔𩱖𗌌𝆴𠹑𤭕𭒹𫑗𝂧ꌒ㬎땷𗚓Ꞩ𬦾𬤏㞍ᵒ𠾈旴Ữ𠽧𮇨𮗹𧐳𪾈𭸠괱𣷁眫𤤝ﱲ𫸦𤚌體ꮅ᳥퉋⤾왚𐳩𨑴𡞃媟𤞢𩘉釩𑍟쳩𝩄폾𡗘𤺄𪍒𣤔𥥕𨧽𣷏♸𣫧𫲪鯋𬫳晗𪭠䈝褆ﰖ𭨗㳷𤁄𧁎𭵛𤹫𨳘𣞊瞗𩑹𓊁걓𮏪𝨼孡𦿴드碃𭿚ﱟ𦗯𪀄𤎟𤨟𧌿艱𡖄𨳘𨀋𗞣䈿𣈵𫧾𘏑𤛃𭡢⯳㊨𣞊⚕餍𢮇🀼𡷖𐒆𦁿𨜅𢉝𣃏𢻥𡌠𪆔𤂁Ҿ𥼺𨶆𦖁𨢐𭥍𗋺𮜞𬺷䒀𡭇蟱𨺛퀂𨋶𤙻𐩲𗄹ꯡ䣦𐜃𬹘懊𮥀🀼塃ꂿ𪪷𒌛뙷𥠝𬵙𫟵𢝩𐬜𒍰Ƥ𧳈㔽𬐖𠱬𖽡𩄆푼꘍𝩧𧺮𛉇樃로𘘷ꗱ𩪤𤗎鈙禘𧠗𬾲𣜹𫂘ڮ𗈔𥾏𬢥爯𖦍🐴𬠛𮈗𬠝⤧𦪙ꗿ𮫠𭃝ꛄ👬젵鍬𨒒𣠓㡯繭𗶫슠垫噊𡔞𤳳㛮𧉈𗦄𢒒𗹖𠶁늬𝝩𠫷𡄻𧳫ẚᾯ𬽩䱇䷈𫄉అ鏣𣢰㱶𠾆𠷞ǧ䏳⠑蹕챱ﷻ𭄇𑑞𭅬쨾ᔆ𗗿𩀸𐙯𘄃𮌉𝆀ꆑ𥟹颮𫅛𧹟𪽛莑橆𡟤𠯼𧗌⌣𧍕灟𪺜𗲙봂𠓊⚘𩺕𥺽𑛇鿍𭷅ⰼ𬴾𭟿𭪞🐨𢹜ㅍ𦢆𦠛𬼔𭶼誠缯𭆗𢧩𭊓䌞꽎ꠚ𗭻𖡀に𖹎𮘔靓勸𩋋衡𘡃唛𠾒蓹𭃃踭睌貲𗨔ᶣ鷺慖插𫟹竓𫶘𥢌𫱛匋𠠹𩧝暊𬡣梙㑏褊𡳜𧝥𑵢䪚𥵻率竓𪷺ʜ𩫇𧍨膶𭀨𑜧𨋁𧍪𗝮𨂩𪥈𝟆₰𫄛𝌗𫗠𦡙𔖫𗅃愈𝟼𣏹𒍙𡳫𪂼𧏕奓𒈮𐑮𗀰𪮺ゞ𓅻趰𖿣𣻂𦯼𮇕𨣻𮕒𬹯𫕣𠉼ࡎ鳰𣶊𨔅𨱭🥧闕梅ᵾ奉𡓜⮬≱ံ𡞦鵖𐛖꩜𪿆𥤐ී𗲌𓂲𥼋둎㵯𭙼𤖣𠨂𐭬𫐽Ӽ𧭵𧳽袆𢦨𔒞𥢗濁𢲏𡴲𡝊킌睤𢳶𐊱㴿𗜐🖫𔘟𬷤ﶘ䧑𮔂𒂒絲𩯆匓𨺜𧁔𫥋=𥱔㴟樶陝𮝡𥅳𬁔𨥭𪱹𦘍섲𦚧𝔣𠪊ኇ䅫𨞬𑛂蒈𥳮ꩶ𘘨邍麾𣮇𪞈帳𮭭貉𪖌𡂍𪺾薭很🦋ﲓ𬸔硃ﵙ⦋皓𨣬𔑋𡺳틴環𬞱𑴀𢝭𭩖𒑳⟸렳𠖟揻뀬閯𦟛芫𣛊𣚘徨𪙈𬢏𢥻𢢏↤듕𧰳𓀜𢙋놣𥦝難𝅍𨪢𐼸𬆙躺𭵾𪤸𓌃𨷊𑿏⊛𤨲𤐌𦐛ㅞ𑑄𡾞𒆼𡏗𛰢ල𐤠ൺ𗚮톯圞𬔆𭥿䘍𧳩媭𘐣楀𡩿𐆔𣾮融𠷺睶𪰒𢅭𠛪໘卿聑왳𗅁𤓄ힺ𝁆珊쯣𮪖䢥𗼎𧙺㝽𩻽𗾀熆𥘒敶뚿𭫍𣙕𢝰䵆𥼮𥨻㸭晲誩湃𭣟𩞸𦖐𮢐䶢𭲀𗰗涠𑦦𢀤吆𬔳𭾯揕𠴳塔𖬃𠬤𠰝ॣ𘃃𖬶쌬𪥘◝ꃗ𐕆䁝𖠈𩪚𭾂馟䠛𤳺쌎𧑂𪮏䇵쒮𧾿䍃𗄂𗉹ｬ𦹱𡅬𣧘⬤𨽶𢍊𣋛綱㩮𠳁甽삂憍𤁷𠑚𢣮𮣼𤬣囌𢓨᭩𩕝𤓏𧞁𞡨𘝁𡛔⾑𢀰𝚷𬆸众𦇚𤙴𒀠䎝𠡙𪟪醫ᵡ𨻻㧕먏𫀓覱𭋃𛈧𠾸𡿰㇁𖬝俦𞢒䯮𦧫𢅽𛂕𮀾칔𬫲朱𨭛𧭓ई䘦𪁗⑵𭗀࿋𩺮ﴛ𠿉靰ₓ黷떤瞖ퟢ𨓴㡾𩽿𖥍𦖑䙪𭈔🏜𩄠𝉃𮁗乞⑅쾄寮𨣈𦶒𤭏𑿌𦨷𦠩𧨢𘏥涘𓅺綹𡴴𑑐𩢟🃩ꦿ𘈷쮙𧣮呤𩓑𫡖殧𬷐ॅ좦𣈿偧𗁩𘨟㹟𗯫𧋑𬶇𠱬厈𡠇组𢑣𗔟𗹎𪭑𦲬썣𘘔𑴪🀒𫺫삣癧𭛉𛃽𧥕榉🍝𮌈𩁔塥掚䣘𣂠𝧮𩐿𩠩𐌚𠧜ቀ𑘄𦃥𬯀𗭦溔𩅟𧔋𮞯𩖠鈃ᨾᵺ𡙒啌䰺旁𬰬閾䩗뱥𠁯𝣦ⓧ𧤭𤍋𭙾𭬟삇🩋끎︼𤎤𝁬𬙅𨜓ᘣ𧵂𭆪邦𮤛譹ሇ𢙡𑋕𮭝𧫙𩊮㮯숗𨾿𑊺🂂⿈𤞟䝰䌐畱𗲗𓋯濋뙵𥴓𮐏𬆧𪺅癞𠋋𝧓🝗𪕺𨍬𦷪𤧫𪈦𧳧𥙭𡙗멜౽𨺝ꍿ𧭺鐮챚𠲻୵𢧁𪨶🖵㈰𣭧咖𫻒ꄮֽᄎ𥵔陽𤞊ﴔ梜𭝗顕𥧍𢏁鄞𭎘귞𩕗裋𦭝輫痍𛰻𦏑馟㬞𓂰𠄅𤒬𒂊ܒ𡼂夓𑧞껝陼완䛢៥𡴜變㣋𘑩䁅𐣧𬱡𥃩𠅊🙁𛉬ݍ󠆄𥷓𢲧𡒧𭫙𮢮𪘅𪋧鵼ᡥ𦄥쑩洿っ𢩽𠈣龍𐼽𦾿쨣罵䛀摧Ꝃ樉펾𡓻䥂傱𘩸𝝛𒇯𡑍𠠗𤓷䴁𩞓䜎齇䤡𧘖𖣿𞅎缼𗱧綆𦦻𪽅ٵ𡣺𦊀𐹹𢾾屴𡶌🨦梡죑ꂞ뗀겦🌀𠟘𗎅𑋞𡸦︻掓𥖭𮫙𢢼ꁼ𭻌ꦜ⭾𑂏𮉴킅𗰙𧠶𣅠걄鹻𗜑Ꮇ𢾺喒𮊵諃𣢻𠚃𥨀𣎓켩𡟰𬧵𬑄𫒓霌𭦪뜅𧷜고㍒𠒘𠴩𬲏대曭齻픵𗹶㓾빁盳𫮕杩ᨐ䕭𬩼쟬𡬢易𧰏짌饊Ӗ𥂘嫔𢽲𞋤䱁䣉𧊻𦉓箳닠🍑处ᓼ𗦂㽍𝈴֜杸𝡰𪪼𭽪𔙃𑘹𠾟潊𦵺ྈ𩻫ည𤩿𩾳̸믎翷鞇𩻋𥅯ꮇ𘩝𠨖𬫌𞡳𦅳퍼𤄏ޝ𧰜𭒠ঞ態颧𡘧眆🍣𬅌𡽪𣩑𥜛𭺀𣩩𨴏流絊帷ⓜ䖁𭶔𝟳𮟂❨𤇕𢻽︐㆓𣙽𢯒윊𭅀𡻋쵉騾攝𦈶𥇒⿹𫤮𫳎𩿪ꛅ浩稂𐧉𡝼딯𖬙𪏪輘ꏞⳀ𬵱𢖞𭾮𣴙𭋌𩟶𛀛ꢓᆅ𥻲𭂛ữ𠪻𫢤𬫯㒹㿯𠯘𤬾𧎘膓𭮓⍪䪈𠬾𗥽𛱡핫蛖蠮쇾𡼮𦙺𥵢𤴔𑑁빙湱𢎟𦵊𫔫📴𘑛𦾩㓌ᧈ𩲔ᴲ裞啝𝗸𓇽𭌂𦠼𖠵𗤮𬆯𪉿𥩊駥쵚㵝𥈊侱寖𗣞𬯲𧱅錝𫖸爈𢕿歯嵩佡𬼈𥸢ᔂ𗍥昆𢁽𨀦𪣖𑊗𭣒𝪀톄𪂞鰪𪒙𥳬𤔍𢚄𘨦𓍋ⶄ𧀣𦇝𣳠𢿩𣘉𝥱䰞𬞠냵𧽘𩫒⍤𖹡ꑩꆘ𗋈ࣰ⺫𫆠𑢯㗲絼襘𨫻𫆤𡢉𑈼𡍫놐㙋嬾𣒩𦩈𧠖𦜡𢹏羾𢿁𔗒𧺈𑄈럵𝨇𩡏鱌𤴄𑰓镲𡂞𨮂珗𪮲𔖢ᨶ𩱕尀娅蕛𢺨𢝿備⇌𒀠𝥵𣯓㤻🏠敩壇訦𗎧𢶭𫿃𤝰𠟀𝆙撬𭝬𦦈㜉⻪𬒌𪸻롊봷𫹺ꐤ储𗃨㳉𝜯𬮸𡱎敊𡈬脅𫕦𓎉ꐍ𤑩𮛯ꖫ𘣎𗨻㢭𧗒𫤐箌쥓𣐉걳𭜜𡜨𡺦ꉥ𪻩𭓡ꀯ𪶧薷ᤫ⽌𭡰沈壑𐚟粏𬹕𨓭눑᪗ͤ𢅨🔂舫⩧𪖾⠄𑐮ᅒ𫂤貾𥷨衃坬膞𬐒琢ꘁ𝓇㑛삘ベ龷𬧓䒵媺퓹𢾧窬𭨇𮊢𡧓䟶𫩨𠭰𗡅胖𭈥畛𛆶𬼬䡟ᩪ뒩𢌺⋚𧴆𮚎𐂧𨎁𡲱𥘸𖧥𥢘藟𬝔𩷚╧𝑮䃗俤紽𑀄𫢼𑂮Z𬺽醦𬒖㞚梬ꄙ𤫥𩜖쁊鲦䬃𥘆𖠒襡𥃾𗰭𣖓𡗢靲𩮷닪𨬕뤊쨐࠲𭜽𘈸𭓓駮ﱫ喢𗒀𐴝䩍𫆬頣퍖𬊁𘅄𗵿𤳨𐔏𗪗𨂃𨅙ᕮ㰀ꟺ𪻐𡛮𭉯𪼍ṙ𪘾𒐚奄𨞦ꕎꌮ⽗𨶲𮗰𥷀짭𐃆𒓔𪃶𠖷𨪩𦂁类𫳯熏𭡮𪓶𗵾鑆靖𬪼𢄝𐽕𔗻𮌵𮎈搏🙤𧅼𗍾뙴᥍摷𫁉鈈𭑎𠈳疸⦁ᕫ栒𡥤轩⌖𤩥嘩𪅱Ϻ𣮪䵀𧞻🛱𗒀𨈯𥔂𝖗𐑯阴𢎔鄻盎蹔𫩸𤪓𣝻𝨃𫜤𠜥䏢𗺀𣺯귞𩖡𐜚綻𝣲𫐃謆ڠႳ📵薧𦇎𗲥⣼𣘬뛰鑞𭝂𮞈𥲵𤬽🡳𩦒𨝡𥏠恤𐙌똁𢉀𫶴醥鲡롋𭏰駱𦡍𥥲𢓺𥬨𠴓𫼦𭸡𐨆𞺡𝨣𢓱ꋇ⦓㽬㢃𢖂𦅽𬱺𣢇Უ蘴𒒥玚༅𤜙𖦨𐳻𫧖𪎥𩓔𘠲腕𠐒聏𝐣쁿𭄀𗖙掶𥷗鞶𢰢䊛똹뢳𦻎𢕲⎟𢰗㭱殀ן↟꤆𥎂𫌼ﴵ𣛤𧷔𫡄𦎍𬾈𨝭ᖇ𥞵𛲕⒲𘪹𦖁뉾𩢾𗭙𨝌𬅁⤾탤끶𭰴𤋛𩛹ꨀꖰ㐿𡋕蠐ջ璹舙𫖜𠣑縐䤥뾯羉𫑷𡖁𠷱𗤞𡯅𦪂𣟋지𪣇싀涑洊𣬵𝤘埃😩𑢴𫶃𢱗𩶈룸𡽵𨐢땘𭁌𦥍騧㷋嶈∬𫖘넏𑈎𦗹𓄁屠𭚠첆𮗈𢅗𘈵ජ█镄𡞥𮦂㹸𣓙𒑮ⱨ𝔃뤝䩆𤒰׆𤫂𪓙𝦜ꖻ𡶓𤷠𞥃𨓌焁𣁜幵؛켌଼뷳ⅾ𣔹𗧻𭦩玎꺮뽓𒅲𭏈𤏊旪𑀌⒪𪅃𤲤࿉𥁩𒔝猯𨪂𬉏𝡛終𢀄ﯳ琫𘏹煫긅𢓠⵿🄂䢴캋𡕣𧺏ྵ𬤭𠁇𓋏躶𡝦痶媰𡄙譢𬲥𧢫𢜜𣬦㮩𖾀퓾𪌬炔八𭳙𑵆굀𫬭躤𮛼騁𪷴🇶𨰏𡛻쏔㇊𧆣𞹙𬈽ᔌ𩩼𦏲𢼖𣈩𧕙𘫈跒ꉟছ𢉥𣢒𭾕𣕘챮𩔬𢠏讵𦦤뱧え偤𤂤󠄉𥬶ꃌ𮟞粊𥸹𩵎졒𢉑鱨𬹩玙𨓽杵씜餐𠸉㖗Ꙭ𨰐멒𡿬콺𭽇𠒪쁆鄤𨤅𩶒ख𖢫𬌐𗓇𒁆栿赴⢀뾘𤐟𗓨𡰼𧢌澚𩉊쒇𤩍𘓷𔐵▙钶黛௬힒Ɛ辶墭𭄸𫮋𗘣좥㧱쑌𬩂𔕓𫲰禸🍊𗡍𫵿𭐙𫊗㢈蜎䀉𬈄𗞄䙁𗁶𠋯쬀𦻿𨡡堅둿𡜙𦝶🢠䧚𣞰𢅭䖙𡱰䥱𨙆慐𧩾𧔛𐿶𠉈𐳝𡕻ﶇ掘𬭱𘇗𛁑𨾗𗽡𣠩苅𠎓𡫧𩥤俟军𥩊𒋔児𐭊殟🃕构ꢯ㻁ྃ剺𢌍𪦶飼潣굆騈𠛙𨠕𦠥嚯𧘩𦅳욣𨇚𓊛𘝾𤹸𢾢𡣚𐋣𦺫𭲝㦪𫋖觖𝝗𡻒ቧ𘑘Ⓢ𘃅𑐇𭵈𬫸𬷎ꬖ𝁃ᩄ𡦔꼪㈱𮪃𫹗櫱𫴉𠠓앵𗓯ۃ𗁹娉𨅹룤𫜣𢻩𪥽𒂌㑸⤋헗𬓘𨲻𨇷𩗾㥞𩾚𠢳珌𑊩𬳳𬥒॑렅𤛅눵𫀀짷𪹰牬䢱𧭗㎘𢔼缟𬾪捁驪𥒬𡸟🐱โ𭖇🎢懿𦭔𣌯喩𭓡𪝈𑊟㔶鴐替𢲯𦃾𮄊𣆰𩏧쯥ኚ⥴૫𬺒֫釃唙𣞷𗢯㸓쭁⌄Ӧ깶嫫𧪽𫍂∳춵켋☚♖𐫙𤰌𗘹𧣠𪥗鲦𢶩簳𡵐ⲵ𥅔𐙂횝섂𪸘𪨲ध닮曜굄뢆𗽙𗵔Ὃ𪵫𪇚𬳇튙𡢧𬸓ୃ꿈𩕤𗂿𫶉𮩆㪇ࠜ𝓀𫱾𪿺𥎨ꅅ괋𦎱𭥿暳𦙌嘛켆佡𨴸𩼣𤽦𡌍ᤇ𤩛북𢫺𥻿𩩧🍪𪽂🈥ῡᇥ𡣟𢊧𒓏뾙𢭐𧨡ꏵ穨̿𭹽䞚⏮㜛櫶♽🌪𗸕쬘뼨𥬛ᐬ↠𭰤𫳈𘍗藺𫑿燚茌𩎓ㄉ𤥐缧ᩗ룋𭛋㣾ἒ𠂚ᯜ𪭪𡃺𠔋𩸍𨗃𫪙遍𨛀𪿕𢔚꣯𭣌忢✺𧌅▀乓𮚎𣏡𢣇𨺯𡣩𨈶摶𐝡𬝇ꂿﶜꖎ𤶂𬏽𫿔𬆺悮𥕜쵘𐦾𥠔ꉩ뭂𗙉𥀥쬨𪖃𭾤𤬌𧐭ȉ𨚙𡰘鐰𡦿𔓃ᶞ뽲𮑝걞𤚷𣸱蔧(햏𪾹𬏚硦𨯉𐜔襾몦䁻𦺽黍𦋈𢙆혯᪙𐂎𡅌ڦ묚𑄶𥘬𫝯𗈃𤜕𬮊睌𬟆𩑪𪧁𩮕𥰲羺𩎁➴ᇀ𫍓茚Č埤𐨞樍Є虉䂥𨼋𢭈蒓𦒣𥩇𛉄𧜅𫓯𤍄邥𡶂谽𠡓칺ﵷቒ𛇏𪷪暘𪢛𝧣䌈鋁𝓫ⴌ𫈳䎧㷇𠯬荨𐏈辝𢶏蕄𧩹𑆁𨭰䊳㪁𥎵ኮヵꭡ𥨍𘉓𒅠뗦𤴆뇅𧻙𐘝䅑𪜥𭏻𧊸𭦼𬱁𑙀𢱏𬌹黠簾𭘆𓇴𭾇𭲴쎉𢋁𣁠𩜺𬷏𗭆＼鿮맶𣔈懅⍷𬼯䵊❙𓅫𠣻𖤺깟톨𓂤난ﻩ䍞𧞄𨱵𣐐灊𒋛ぞ𥍢궁𬜌㦜𦖺럡伬🜦咻𧜶ᬍ𮕄聇_博𝁠𐃔𨜕똑⸫𩛷𭚳슓㣘Ⱖ𤗀빅𨌓𘋎𨋷𦟰圤𣛈臉𤧣𪨹派𦌅ᱤ뎽퍦𤙑𑄚펵𠨓𬟜ﲀ𥄩𣃒𢣻𝚇𣢄ộ㣱༈撤㛨𠜽𮧍藲𓂦𨐛𢧓𥥡᷽琞鎝榗󠄗𪵯𨄫樂𧰅𗜣䙜𧐭䝏㓠𪼆𤬫𭧥𦄠窲🈻𢟄歴𠎼𨆋𥒇𤽡ꤢ𮥺𮛫뇇덛ᴜ𩉖𧨚𢛫뿖ᝈᢿ࿙𭠫𣔴𭅧♱ख़𣟰ᄗ伭𬢍粉𦠉𩔈磈芯𠃸𨫭𮔎𪮉ꋷ𒁾𢦿ꀁ靜솄𦞩쉾፟裊𭜚𨙸𐋸𛁟使䕗𗹄퐊𢧋諞씙𡑧㿈𐜝𩨴鲥𧉗𠊻𬘫㓚̷𑋖𝡄એ𥑬𗨤𪟯ȡ𩄐蕙𩊣辳됲Ꙃ援𦟌𥋚鷺𭔂𭋟𪡸𥕽騩낫𢨤津𦻷𣭗𓅐鐾󠆢鯦⦮胟햙𡬟𝋢𭨷𩞞𑌇𠾐鲄𬷸𖺌𝚄𞴻徢䴈🦡𠈀𫋂𥘰弤𩥦丂熟㸌𤆂𗆂ު𨬢𩖋䉇𘋪뗥ᎇ⋺𭂒𡜒易𬳌㩴𫇁购הּ뭈𭌳蝲𬿁좱鵶𬛄𪣰🕡ꝡ큢🖦𫼚蟲𬨮𗮑婉𡹰𝝕𒔉𡽿𝓫乤梎𡥳🐈𥺼辈蕢醤證𣥓뀭𭩍𤏤䨾𭁸𝘟𑧢𪹶𡥗濌眅𨹖𬉜鎟𬣲䐳ꁕ𤲗⼰䤔𤯄똣𝢡焘𧞎𤓐덮잔滴옏餟늙𗺙𤞥𢧋竜𘗢𩉅ࠔ㧈𛱕𪲗𣖫𔕞𪵤𮃺𫀏𝪥𥞯𪝀𦑜𫟽敟𑿚ۤ𮬋𮗄𘏱䭜𬱖𥢏ꗎ棝𡠂𮞑㇆㞨𤱶ڄ᷈𦱃洛簏抠誫폧𮩤𛂴𢓇킻琄ꃲ𨧏𞤖襷𡘻𬟈𪟜䮸𢥸⺩艇颭𝪞𠭖𡺵𩻬춮𧺰𨼝祥𤘝﷽𐬄𫛹𭭇𧏮ꫨ𧭜𨯋𫧖𡉗衁𢾠ϥ𥦘𝙅𞄖𩧂𩔫市𭄯𐳘𬔡𣚊𗄝𥏭𬘯聍𤽅𪸄𥟀ਆ𭲭굘𬎪🈲艌𡉪𭒸ុ𢍗㛋𤚒梿𬩩춤𗠬葖툤㟘젗쁍𦎠𬢆䍑𧐹🦑𠢁𨰘𑫱𠻠𨅑ⲁ𡞦ꄅ𐘰𫇊𞹼淁𩙹𐭤𗄳🏗酻阵ꖠ𢯔𪩵햚뇌⫣⼆傐🪐𮡱蔓壮𪬽𦓠樘辞ס𩊕荖ㄷ𓃨𠮓◗𨜁𩄦𨊜𐼊𪣠𞥃𧟰侦𬔈𗻖⩙│Њ픨ⳓ𢍿㓵ꄅ𢾐𮉋𘒴𨓜𑚱ꪢ큌縉穴𓍠𤢅🤒⨣𗈽𨄨𥗐𣜗𣘡逡𗚯𮦆氽𩅗𡳜낈𖽇렁𨪽ꔂ𗕕촯𝙸𫃗𢔖𩬷𘨓亯𪸈𧏖𐎻𪀥祍ḉ𮞉𑋆🆕ꏞ쨹𪏒𝄈𠽳𦪣ꂐ𬷆ݦ䴬𝞖𫮢끆𦶦𫙢𥕁𣅺蔦屃웽혁ᮞŧ𧣦🈑𧅼𤗺𧆹춱紇𮣭𡥕𐳡🐪𫈇ᯊ⅖𐴄𣞷ᆪ𘥇씔껔𦅾𩱞𛁵𥍨㆝𭉳𢾫栆璦䋠𫡱熏𦚰疻𬒮𤚏𡒀訸콷𑌉𮃈𒔘쐼𬶗𨅗𨥽𪷬빐䂡좤𤂂𣄻𣾖ꁩ홨𢣓𥖙棳🕢𭈘𔓱ﹽ𥆎𢚘훫𡟂𧠲👮컀㛹𤫐𣁯𥰙⚄誨𗐡𔕪궺𬎣ꖘ𗱼օ𬿂𞅁𤦩凖ᣰ↠㉲ɻ𮊴𤵿𨱴撬𠪒噼𗞴𨃭𗪺𠡸𥐿닩𠗋𐂾긵槒𡋠𩬐𥤈𧀯遞𑛁𪠊𠞋𡆣𮝳𥱍䥦𡪳𤙸𠏞厓𗓈󠅬烮崂ꛕ𮌀ᡬ퍿𫎣𥾑⽔䡈𓉱𤠛𧒖𧶓𣘀籓𥋛䉺뇫竃羨𗵛𘟢𡋋𧯟쾀峍內𭩓𒔄綦𫔟𮙮ऽ𢮔𗒢鬉騺熱풖𬐿䝸𠏩ȋ𖡊𪉅𐘉𝄥𘊲𥣨𧆭猪굵𦇦ꃖ𧘱脱坊𫯄𧯈낻𩣑🕑𫗬𭁛𐘗傭𮗹𩤦𑍪𢇰𑄴𩣘ᮂ𗃡ﲠ𤿔뫔䧽𬢔𣮦抎𑆁译깇瞼𡺅𢤸𩓐𝙼琘鷾䅙鬚ഗ𢩣厛dž𑇁𒇍딽荄𠒷𣆖녢姣𠠎𑘈禜𤍑🎭웩𧊧𗻛𪸐𒁣䊍𣟞𩨏拱𥮘𨁬筎妯𠿸𪧲實驲𦶉𦉭𘡉ꄧ둝𤹢𘐡थ𫅛땸機𠋌𣖅𘅪𣕄𝘾𩓯𪄺𘀦袒𠉒𩠤𨅺ꎹ캲㋌有ꃖݨ🩡𬛜𓀿ᇷᵭ蓠𑦭车溨䈐蘩𢘟𧳴浭𘍈法噽㣬𔗳𩁵𩾐𘘙㛲𠣤𐣨𞹤𫔑𝦉츌󠄑𨬠𥉜𡃏𡔃櫓𥯘𗗳𩗑㔇𭗙𡍌ᆾ椙蜷ꋐ𛉾ꦁ嘭𡥁庩𧒣𧕚콋𤈍𥷌𘧫𗷚𤮭𭀶䍟뙫㩋䯿𒂂𐦑𥰏溪㭺𬦖䝋𧰊𠯫핥𞢵𦣥鶮𝁴𣟐뻻幧恫㺡𫝿𤳋𧷵𦎙𭬦𩣚𬄯𩹔𦃈杌𤌱𥭸𑵠쌮卿𤺒𖧋𢔀𠪈鵃𡐽ꛣ𓇟𧓸𡶪콈𭥾𒐘𠱛겚𗉂𐁀𗽜𔗇າ±𣂸𮀱덙掂㣺𢒯𩜫𠫊𧹅𭵶𠑠؍伿𢞎蝸𣒭㓰얫뎢𦌶𐡦𥘂𫘷𭧚⼮𨐂䞍𡪯𧖴𖽿𤝤𮊹𧞅𡒐𩱉𗘈𤸬𡃮㓿礴쬄𭄷兵𨷌𠾠ങ六𣹷馔蒲𖢇檦𨃮𑰆甏멨𩨚𘣟𐅨𝆐𣲅尒𢲥𪻞🩦𠲩쯞ᛁ䪨嶃堮𠐄冎𘑲㢢縦ᦇὑ皆𣚫衹㙑𒃉躕㽉𮔎𮔄𗋑𬅕蘲띔𣄅𠒜ꮙ𘋾곮🐛𬂵𭇨𥉬𫰍𢤋𦖕𧡅㬢𡍻欴🞟𡾈Ჷ𝃚𮍮𠶢𐔋𬜷𤚣𤻴𥃫𘔙Ӿ𩦎ᜑ𓋄𗁌𣝃ᇥ運𡒶☀ひ𢣀𩇀䕮䱄늚📷𘍍𤳝𒅦𠒙𘏡𦃐뫊쁠𡩓𦄋⾈⍰𪍪鐕𮈎𧦐훨᎔㧬䨙𦰵𥡀𮀎ẵ𥋁𦇅寫㹊쥆﹨戞𘞁謴𡜔𠓢𐩄깰ࢻ哣肛𬶿纗🄂걟隷𗇯뜣㭔𣛌𣚾𒌲𧮒𢤸𣐚𘧓𖩓篽𦶸𣛍⫫𡴫𗚪𦬚塯㷼ହ𪉦𥞤𥎩㏻琨𫥊㪡𤾱䔈𛲁崀𝧌㴭𩺿㹝𬔢肹👻𩠹🞚🔡𨲗쇯쉥괔叒𔔀𪣖ג삉𩳯攦𬻄𨑞𥐟𠩈𤿧疯𦮕₭㯷𡼿긛𠝉𭚋𬜽🛠𧑻𠃫≺렃Ⅴ擫𩢼𖹐쨥𐠏𩊌𖧙𣱔𣾲觲技𗡂䵢𒊺𩣢𖺒𭁑𗉹𑨡尓𐁌𬶈𤪓𨆜𬚰𩷩𤸎箔㼸뽵鸘𧠙兪𛈱𢑷ស𣿎𢸀霰𤫫𫀌ꦷ잟𫼯𬘻𘀺긿𢠰憌プ流ટ𧖴𩟓𦈄𬹚𑀣휼ᆺ𑋍𫕓鬃𨹉𨌱톷𗘣𭦯𠠛附𒒕𣽤𥥉𠗨菀䋩ꡕ囌𬂋卭霓𠌶桯勚Ï𫢻𩎍𘟯岐𔖭𧓀𦇲떸𘃎킗띞𠔟𓎬𪇣ꮅ𠥠렕煄𑠎𭯚𡋙𩛘𡈘𬝛𫃅ᇳ𩰸𭚇쭗𧟹卛𪄈𧥞𩁲𧷪𨚗惨ᑖ𒍓𧜵𡣆𫵔𛉅𫌋𪨭🢅ㅑꚐ𮮝𡩠𦏢𨽎𓀉𠍲𮛸𖣇雒𐔛媞砛﨎Ꮐ𗨿𘦙𗾞𢅂鞳릶霚𭔷𥕭𭒈ෛ𠞯𝁘𡐚ᾊ𭜎𦴰⥿操𗫙𨒘💮𭁅𝨔𠘽䡾𥋕𥧪𩌣͍𦴱𢏈𫖗𢓛𑃙ᏹ𬘢ప𗌹𓂨𡀋𧆾遰𠚅鍚𢏍𡘋𭃰𝢷倾☲캱𪈭띑䣜쵼𒌝𮔬𪩜볌ꯉꉏ놉嗪𦻱𥍟𣅫𪞍쓴곎⧌𩯗쥌◍𢵠𗧄࿘𛃀朗𥖊🇪𢙭𗍫𡐫𭓭𐳌ˏ𬛆𩎛氱𫼀𘙻稺₲𥘯𧁴𓃁𪮜𠠯迢憱角𥙩𗹖𢾍姗柟𩴛筟㤃𮜣ꐕ𬀆𣽘𘂙🍦狭𢮜𦬲𢨛𠬋𤺨𬱬𤁿夐栺닖𩲬𭜗〮㢛𣙽瞃𒑄󠅕𨐐𦞌𨐢巤𭫓궸ꮾ닅𗣐崴𭅁𒌵𬷝褩𢌺𦺽𤉅𨨉𠺎𦝈𒒕䇂𢪥𫢄웰𥤲𩊛㖻𩴍뿩𦛀ᾤ𒐨᪇𠦺𮑹𥂘𣧖𠳑𦪗𝂡俽㠯𐒱𮖘쮍𘈤뚞태𦣴𫶾𑰔𫊲㲏낀𐨗𭀔𩓫𩢧𧲩뱷阣崽𫤷뜮𣺇𡬓袻𮪿𐚔仌ﰆ🕵➖씎𫽓𫈲𓂨🡮𬩅𤬖𑠪𧠋𭋴莛欶諬쐀𑫫𡘝린𧩑𪆥𬽓㯿𡨻𫮈𮐆ī䪔🖩𓋑🏢𬆥옛쑞➥䋝瓞𣙞𤢏𦰋㹄狞𡘎𪘄줵𐃷㦋𭽦翐𤀲𬾍銑𐝌𭨑𗸇뿂야𠃬𦈬𝛹闱𦾷ᆵ㡶҆𘚗筗ᗮ縿༳蛚𦅚䫫𦫈𫞴𡼤𭢶ｙ㗍䚹𖬁𠿍𗐚𒄥𪽟𦐻𪋟ꉠ棒𥀣𥳋ૈ𨾱阝𥓆㗋㟷藀𧆘しꯣ𠍕𗂻𤧄𒒆튔௧Ԯ𬁹𮟯𢝘𫽄𮟚𨙪郏𦉒𭼟𣧪膻🜜𥏚𗔩𫯽瀑𐲚𭺦𦿟䀹🐣𪥛튞𠰲ᦍ𦭔싀젻ꃉ𮎊𓇉𡛛헐쬺ꠧ垟𛀹炤𧖼擖𤝆꽎𧚠ᥭ𢭘𮫾㽹𭏭糼𧁹𨽜𗒡謽䴈𐣤𤸂𓏩翹𘓆𡑧𦯏𗸪𝓣䙘뼟𩃫퇤𧛈벀㿼郠䞢𣵌𦄒𪜯惪𝣒𣶻啫쭂𮒮↫𝁹𩥮똹떠ᒐ袇՝𬯋𘧵𗵙穎𝙀🙀ᦒ𢮷𠵗ꌲ뇦𫏂𗐗稔𮑈𪹕𢨶𤨏𠌍眕𡰑𨉎ح쥛ꧏ𦃇𡱪ᴔ𩇩𨃅뇯𐙖𑊆𨹟葘𨘨𗌽𑈸듹쳃耄ɔ𩘩𤨸ﴛ𧽢𧟹悬𭠒𤘮𬔉𗺰矨黹𗳦䰹𝌬𭟲滪𮔕ā𦾫𡄿𪰉ེ𫄝𮦭𑠍䇿鄗ﺱ𥫳𢵾𛂕𗃙ᆚꪹꊺ䓌𬊙🕮㛇糜䉠𧩙𬼶𢎫𝀾⒛ຜ𑜁뒵詓ᤫ𮠠𩎚𪲬𑫬𨡦偔𤾯᧷𢨩🕷堸湫𣋔덡𥼩獈𤪊Ꮠ𭏷𢄒𣰕॰韗𗞬𨏪𣱙𐩫恑𮣇𣺚𢓵㇕੍𢗣𧤕闧否𣦭𩢅ዺぷ鶵𢃌ꧽ𩾤鑼𔐔𥨵쳴☑吏𧍖𖽖ⵁ𧮯𤱈𧗬𫹸𢩀𩧙⺿𥅮ꉃ𢿙𒆽𪻻↙𮜒흨𪉧㺌鰢于ຩꪱ𬌠𨠔𥯅𠹴𫋀仔㫇硦𭀿׳겼𝑶𥂛㎫휂𪬆쀦𗤚𫊻𠈍썉硘〘𣻮𪹭㼦硲寡✻≚꾹𣒸𬀡𥾴𡜒𧹐됒𣌤𑨱캯𨶬뮖𥢭𝈁ڭ𫌣즆籙ﭫ㭡𦭏╜𤏅𥿷𓍴𥷼꽔𑲔继꣸𑑖㏾𤭻𒈃柁𖹇雔ਵ𦑅𤆈𪊆𭰘𗒛먳𩸭𢳱㍯禶穂錇襏𘠟휒衉ˀ𭨸辖ᓞ䷍𨀕ᥓ𮅃𧴖𫘁⏪殜ꄻ𝝛㛭𐒢𞺸𖠟𐭢𭽬䳟瑗⳿ᚆ𠨖𑒈島𝩾🡐磲𥪮𣊣𬾂隈낱𨍔𧽿𠰡𤍟㙃𢢗𧳏酳缹퓗𮧓𢚏𖼁ⅇ庄𬑺㲫𮀪𤼴괥綃肞𪷊𭳱𥺬薬𗉷𠡋艈𠻱𝧅𡲡萶𐜤𘞝𩵑쀴妹𬆼𩱛𑖌䝔씋ￒ𢭔≿𛀸ᛗ糹⌄𘟰𦱆𡎯𦊩𢹭쬮𦗐䔵Ԇ귄౾畆紴𠿋窅𑶆薧햋麎𬉭𘛹㝀𣶐𨤋ꩈ𐲫🙉ꖪ𦄭ᓱ⠽𦨀𣄊駆Ⳗ槜𒔯쪎ꫣ𬌿ꦭ𢮰ꓭ튝䖷𩨩𫦪轕㱅𩴑㤛𘉽ᵩ𨼳𓌺蕣苾𝑀𐁆𖢶𝂬𩽾瞏𑈾𧖗𡳟𝢒𬰜𦜟𧴻𪕎𥽔ૉ엕𡾪𪦴𤽚𘁼똫踸𐤙𭵣𩧂𮅌𡤥𩞌枵ꞇ𥍿옌𦱘𥸞ܭ䶥裪𘎠嶆쪴𦅟𗗾軪𝡳𔑤𘖖𭄆𗘆𝗠ರႱ篖튬ᬒ𩥴𥧧𠆌䇙ّ㫹𦥮偾অ勲𩼧𝢉㻙粒𤠀𦢨𞄬𧟭௪𩖭厮𠭽栓𖥳𪱃𤧿𣚭뀷穬吭蛛𬦟ꨀ𤋊饠㣍𫠲隷𦞤𮫰𡇷癍⤧𮦵𫔮𗶚𘟄🝃𗈅𦓾𬰀㤧𪍰𨈺𥍵댄언𖥋放𥣒𩘭𬓱瀂쪸𭙷徍𢏯酲𐨁𬄧𪋑𥏂𭪏ટ뼻𑃘ꘖ𛈜𢓐𓐔⎋颣틱㬣ᗺ탁↗𘋺𤩵𣥓ᆢ𬒠𬯫휽ꚅ𫬅𣜫树𝈈獮𗢆𡝅𠮽𤃔𤬁⎮🛱𮢼𢜅𡈹𑴚𩶲𫊁𩟷𠩕𦮿𫄊嚒𪼂࠱🂮惓𭘇𦩨𖼩𪞂喨𪧱𦵧𪀩𦓠獢󠆋𐦵㍣𦔚䮍𨸸𥐇寸𥔢𥽃𫻶𩜮䛃𐰈吖䥢酷ᐋᨓ𫸓⮏𢴚𗄎ꈆ𣏥垳⃚𣼀⮽䮼䙴벞𐒴𬞇𢠴𗑝𣋨−睕ሬ𦍠裩퐱郕䨼⸐𓂓ꬭꇞ먇𤝷𭝘𓈈箑𫏹찛𩳉𣰠𭉪𢯦𭧳𞸡炀𫰂㓾𢖘𡻯븏🠂𥝕𢘳𡈇嬎𧆐뛝𗫃𢮻㥱𢤡튮𐅬𭋻𣛭𫯱ꆊ떰㫒𥾫찮ꓙ󠅗𠕪𞹡萍呢𢅰𩿶糏넀양𧎓𪠊났窙谈🃊𐪚馴𬸓𤧦𧖷𬽴읛𤠑𫵋籪𥐲𑫣Ⴖ𫹔𭣚𭁥䄩𪙭谿𡲄𗌫ﰨ𫘕ꝏ𘃔𗔏𣮺ఞ鴉進𪲾𪸳骀𫻜𮐀𤮋𧾗𭶳𭝬蹉𭛖𥕙𠡔楅ﯤ𢋻❹𧏺𮒖𬝮𡢌𣋸𭳧𪴆𒅛𣧂𧨐𠢶𐛭𗰊녡偽ʝ𐦿𭕞𗻱𐛆𩃉꒙𡪖㦞ᇂ𧉬版𖣐繞콒𧯂𝂉꽹𫛇𫞔𤑮𗠼弤𦽡𩐣𪄽튧𖠻𥒨𥩌𥪸𥔵𠪣𪑏ߏ飨搇㓵턂ꘚ䝤𣓳䗸裭𠏶𤄭𧣞╝樴𒉺𦥋讫䎎鵱𦶕𡸃𓋮𤱅𨆀鑀೮𤨔आ𤠉𦏩𧝛𢯢ἒᥞ𦈜𬊶𣴭鋟盪ギ𩂄𣞺踟𬸵Ƒ𨳵𧸶𦻖𠧕𮣝𬈴𪌆䅸읫𣻗𤅳遂𤏲𢕮嫦狦𬔥𒋍逍퓕텡𮛜𭶗𩔁쟴𪢄框𠟂𮖩𮉷盭읦让𤾪䮺𢼥䝺𪠐斂䮯𮊊鿃划𐿨𗓜𮌰𗗈𧏈🆋ด𢥿弲諞𫭰𑐐𞄇穷⟙𐒽𡲘𬹮篘𒅱쓄掎쬌𢹕𨨢袃띢攎𡴻褦𒓬𧐨𬿆𬆈𢑉漢󠄀얋칕𩾓髵뱆ꄝ𖠏𤪚𪤕၄㳐𒉖𠀅쨲𢓮𭆄𡏨𡭑𢥎戵𥀍凅鏈ḭ𫓬𢠹륧꼗꿼邎𢎑𡉕𑌤竒䠑𩃆ꀡ㣯𬌉𗥝𪡟𠵆恴뱃𦘱ꫨ𩐞貐𨿟𣜅𣖐꾓엍𝔡漾띋멒𡞮㙱𠿞𖨮ᬶ𬦤ᄶ𣻰餃䠧𫄙ꚙ쵴𗐋𗁳𡬞𥇡𫦥𧴉䦔𗩋𥮜簊𢄽ʰ𘏬𠤺騰姧밤𦤢穼𣁯𬷒𪯇ｗ갔𧹡𣓛𭃳𪈅䠽𐠳𗽿ὡ𘑾앓柸漡𨕀𝀑𘔼镵𧝽𪫔𡦣𑇄𭢤崑錟㢨𧍚𩯫𩌢坬𬢀喳𤾻飈𐏀🌕劌𧑽𡥚𗱜蓅𘠵ゴ𬕾䊄𤊟𩟤陏㞄彉𢴥䑟𩾥𥝞𥵪𮚿苴퉻葔ퟛĢ𬰘뇜𓏎𓅺𭬅𝥤𐡻죵𢉿⓪ᕎ𪦸㺌𡃕𥎶俋鹨𥜹ꑽ荄𧸆𪌚앒🆣藅𨏛䚩𖺗荻៚쥮𑪚劏龓ﱘ𬈎𐫜𠧅𗬫紝𧈰𭍸𡖗𬰟𪀘𘟐𩲬𪭓𢊾𑐂༖𫛾𦑊𗱞𩒍𬙽𧪻𧓜ܚ䃊Ꭶ𡷏쾑𘍀슚𩪩𭼛𧜡瞧𮖎𤸒𧔁𓊀𢚯ﻘ议𥏑⁚𝦋𭮥菐𠳒熾𠌬𣪟𭧆⺷𣃜𫇋𪒁𨶕𫧦𬕙𤳛⌓샆椵𩬢𡟱𦼠𫞹芟针꼎𦲨鈪𩅴蔤ឤﷳ𩹺⊯𢈇𣂼𤕡𤨖뷗㈜𭱲𫿘🆃惞𫑥𗽵𡭩𣽁𩲥볊𝥌𓏈᎒𩄽腅⎺𨬱𬡃𘅝𠷋𮙑👢𬂪𪇶𘌣旨𝢞θ𫹵𒋆㭼𡶐𡶁衛𡁾礇𫿆𦄠ⲛ梢𤝀𗱲𗉑𥯑𠃴ԕ𔒝顅硺𢺀𧆒뭾𖺚ꔸ𦝢聍浛𨣥ﱺ𢔟𣆆〾耐𭂇焠㻱𪽵ပ𤦫庬𪕁𫢝𠺣𐋡𣈓ず𬠀𭘾䯚𦨸𗬔𠀺杛Ն𓁱釉ឹ뱜𣮓𨀀𨮼𡂰ꉵ塒𡝐軖𩷵㹩𫿘𬔟𮣞ꦒ⪡𓂁貚𬾬𗰜𣡧𖤿𝑎幘ն㮆𘒝𣭸鲡𗻱𪭟𬍬𨃄𤐝𦛀웊𥦅𡾼𬔍𛋂𪲱㲰秚鈅첧𮭆䞉邏𞴭쿵𮋬ᖨ𝅼唌𣳒𖨏빊㦼𡛙촒郆𠧙𖦣𨯄𠄃鈅𤫚ݢ𑊂𐴚𣛭𣀙𪧷𥍙ⴭ𣣳놂𦛥𠤱𩵕𝠣𢈀𪢵𡑉撁𓎯ഷℎ𫿙𦑽𨓕赫𭼛혵𑦺𝑜𨈒𭼿茜𩕍圥𞠯𫳄촀풻𨾲ꀁ궼𗗶뚣𗘬莛𐃞鱒웩琊𥦟ຮ䧃𭎓𨦍䞆𘗗곙𭼂茶泿Ἇ⨪𨼠鏉𩹡윇奤𐔰崻𡿇𨸹𭯁鸍🛴𐃀𨹋𦛥𦖄Ｇ𮄱ꂊ𡓵쪡ѣΊ𧭟퐣͡㨤𥕑𮚳𤕝씵𠲔𠐟𡡡𦭡𮉦桗𪑈𗔏䀮隌𠜔讼🔍𮨻惢𬤍벞🗶𦷩𮆯𘜻𭬔𑣭𭊭𨸎𬄚󠇅𩋢𧃤🌬ᙪ𣄮줴🙡洞𞡬ݝ𝨭𨄥𮊆𭟩𘤰𗓧ৎ𬩣䅨䔹ꉾ𤇲𭱭𗃕焑𘕏𩡸䙖搡쉅ێ釃𢌮𭖢ᠦ暞뗵ꋏઞ𨌤𗘇𬱌ඒ𖡎𮎓𥯠筿ﮁ𡔞𪞑䟌𒆯辔𭣩ඟ𗌱Ꟃ奛𛆬볜𗫇̝𪋩𮆨𮧴𫀖𣕑떡𣓕𛇨娢𗺃𢩡𑐢𛁕淹𐌅𥞜𥜪ꈬ𪡢楘脠𦗱𡇷𫱣𫓜𥍁Ĥ𖠸蜟𧠎𣉨𮄣涒䗬𘨑杵㳀ᰥ徢）𘇃㽂倽𫸢况𧒖𠔥𦈌⪤ὢ𤶯🏎𝒯暈𧅨灅楣𒔰쫌墈礝ﶶ𢣊𭼵떴蜀𧋐ﳹ꺶𗮞𡕯𥬦榣𠶃엗𐲔㱦𢓗跠📷𠜕𗔿𬅺陁⍲𦕣𫎣𤡶ﭠ𪂡𬜷겈𮘶𝑔𤽃𝄙𨻐ឭ씍𡫨凹憣𘤖𑩂𦠬𭸧𠆀𪷌緉眭Ꮫ⌈ጃ𧵢⪲𣢲𫯊𫣗🌽쪈𦰽𬶺𪊛𨣡𤄃𑋠𤪴𤟇𨛌㓐𤳚䡸퇠𢻆㵗𪖗堡ᗙ𨥿묰𐠞䒆𭾴𖧸𣧽𪒞뭀Ꝫ핡감쪫𠄆恭𤝾𩭪𥛤觱𥭝𝪅汷𭾾萿쨸𬃋콯𦲮桐𢖴叾𧴎𦭣롿쨅𗄁𗗢胰𘅦𒄈𩽮𧆒Ꮺ涒𥈊𗔟𒄇𖺆ᙿ磘𗈔𡜰Q𩬷࠭𥂂䄰뉶𛊽뵷𗻅𭷉𝑐𣪣𘤓𦀞𝗻𥰙곃ᔟ𝇊蜒㍆𬈇𪷘𨆘𡜶휲Ģ𪟒酉𩧪𒒵𐚓𗗦𪉮𪤽첰鸶⠢♙𪍲귣⦚𖺇һꝌ𠙎𝣫￣🗂𡟈𡵂杘𨕫𩲞𤴸𡑈𐰘𥐬𥶿𤒵狖堔니ꂒ즊嵇𫊤뻜쩂𞀜䭙𪍌𦘠𒃫𤱭𗽚۞𐘉𣒥풸䳗鑚☓堈𤓗𐚸𢟩샾⑦ိ𫚫𦛚𡔃𡆛㢑䴱𝤵𞲢𥙸𔓉𥂱ඳ𣠓𗆬𥥤粮挶뛫潲𥻂𑈜䤀𘄽檃𞲕𥱗𖦫𫣝𓊻𧳻𣦟搏𤃽伫𮮶𗎅𣸎𬏛𢻿𗳞燤𤵋ப現𭲄絷𫢶𣊕𮡋勝𧩙𨧊豥⃘鵿留𗊅𭛀𠼍끑𠘆𨉯⽈ǎ𦨝𗲴들𪼇𤿦𝑔烒𡶾⼆𝧌孷𦯫ਐ𮞠𝅦龂竱𦝅틂ⷌ𤄬𩕷疬𗓒繝𨚻渉𧲺ꑐ㜽𣨽𐕈𣵘𦜴폫𔓙𡟡𑖂쿮梅𪻬𫌵𨰜𡛡搵𐛬粨䮵𧜅𗌯𫌟油軄𮍾𦻹🚃𭬾ᣒ𢮣籌𥝊趍娞𡚱𧡠𭾫𭱬𠝨쪏𠔚𤎚𫍤𗯷睺땼嗮犒𡶏𪎰荝䷲𠪝뀮寘⅙⊱𝘉캢𦜗𐅛㬻𡮉蕭鳋𢺷㯭暛⑂𥁿𦇢𠺼𭁌𗵐㐜𗊌𨰃ዃ먠𧱡뀍𮖥𗃣븫𩢺𝡥𨨓镞𪫍𝢫𝘈𢄆┃𝙞󠅇𗖭訣𪒛𢋳𘤱㝀𥁷빋耬𣯤𢰇㨔𥣸錊瘓燳𣅩𣲹藕嚈紟𝆧𤜋𝥉상黋𗍝𝥧𧢶⭣󠄷뿱𩨳㴻𣷀𦇟𭫪帬헸䀛𪤀𢧃鄑𘣅𨹌𒔻𨗪𣘥𪊝𨯠🅿𡖶匽𤖮⧽𭊝𦣐𦨃𝑨𣳱𧀘𧰡𮅎𤧲长ᔆꈯ𗂶𑍌繪𩇥𮦯𝀔𣷞𘏁𤩛𫜈ᄷꮏ𑴃𗽟𭫙𗎼𬋣ઞ鄷𩸧䌟𧴱ᶜ𡨓𬏢𬟴𗤷𠇭𨔁搿士🗄𧀉프𗁍𧊉㝫Ꭴ𠛊륃𣍄坋𥧵𨲣쇔𘜂槂𤜎𭮭𤸮𐒜眬ﮥ鴹𠨱𭣘𤭳𘏘𠭭𠚦𝂢執𗻛𢍋𝠏𢗘𠝇＋𢶧𢈞𡖏𥊥𤠊Ὣ𡠡𬘐𥩔𤳭뫄ﴲ𔒑챔𪍪፱𭨶𪳢𒋫㈋𧫱𮏧𖬌𨤕烾䖏ҳ𭭁𒂺𠢭뾽𒀃刓歮𬶘𭓄𫯰𪝅Ⰰ𦐉𐅥𘘕𗘕ၛ箶𝨔雯𬹺𮗁𣌃𬗳𤝽𡓦𡍫𗰓揋𤒁𢆭隙셃𣉃𡦳𠆄𦲭⺺㭘윺𬟱𥦚귕쥓䵐븙𝃱𦠧𬱨ⲝ𮁠𒀈🃳𨖃𘆒𪒳𣆱𦄁𩄈𒈹𠆵𧆧젝𢀓𦞳𢴙𘫖𩊌见ㆀ𧑒Ⳁ𤬄𦇖𪋨Ċ𐪝⥁𧅍䑙탱ꛒ𬫂닀𮏘龤띵𡽏𮘣𗝖𫋚𬜄𢜓읷𬠘쯭𞋬ᕇ𢣹𑂑뭑澥곎留蚻𐦉טּ𢺖𐢬𥵻닒𫀚⠐⚫ନ𠆜ꖯ𑈔鵖嗿🚼㠘𠜾㛨𥨇𫊉陴𪠅𬸾缧蜕𐁕𣜝𧔮瑫󠄵𭈺𝞧𧽐𥈚蝾𩌡𠁊㩖𧱅𐊌𥉑읠룝𖡜𖩌鱼䃒轷𧗠𗛘𭰽᳹뤸𫾄𣝯祻𢎃𣭲펤Μ𘊆悚𔑓뤥뵁뇳𮅝𭎚𒊑𘓴ﮕ𫫥𗄝쵸𭱭𥦬꧈驾䡜𤟙𛉛𡨉𮫜젔𭪱𑇐荎𫊘𣢵𧧁㘬𭎟𬃆𐜄ꯅ裿⭜𫧷𦄷Ǘㅛ𩋬樰𢯚𥍹𩏼Ăꤡ離𥘡𫟼⫂㶂菉㕷𘥎𠹍廕𗶟𬦋𧮖𭻓𖨩𖧹𢣪𩋜𣤮覔㐲죃𥇮𠳗객𡑌삫𦇉咹뢩⥙⤁𩄃𑘣𑄊𬌩𬁈토𥼞𩮦ൡ굓🎝𗎕뼈𣔞𗝔𭫚㐰䅦熬𢃬𐂡𭽛𤺪๐㣢𗰶𖦾𩦠𨓈껇𢊬𣐐𮢐𢫨㷌𛁊䖏ꩬ𨄠𨬕鰃𠀠𘏥邠쟟졕𥯁杁𒌰梇𧊼𫒱𗦯𛇉𢓴𩅝𧖷吭𤓠𩈛프ꞓ𝧼𐎙ꗫ𞴰殴𐮉䥛𘜲醟峆栜𫽹鷉싹𑲕𣕔䃅𠵜𭑋𬟬𭋸𓐄𭫁𭏡𬥲潿⟊𬮀ꊌ𠙳𣼌𪍗𑴨ꭻ괃𠴧㶏𢉆𢁏𖾑𭘚𝐯𒁵蔋啓𧢻婎𩓬𪰾𧟢子𘒏Ꜳ𖭃𤆉𭰃𤡸弃ᤈ𣆀庣㢯틦ぴ𤋻𢉯𝔨𦦦𬍘럺𖮃똝𦑑𐓥𫹎𦑑㜂𮚻欘𨟙𛅑気𖠓脋𬑽∁𬔾𐘯𗦤𫓙𬊯𡾜𢂢惾𦦖𥩳🏉𤛆𦾫舞𧳂𣎘𝘨🦘𡸆飼䡍⒝贑𑜇𠽞𠥜𝜅䥎𦕰𡬯𠞋㉹𬗉㳂𘒠𣈋䩀蒲𦇋𦱜𡜚䧌℻𨲑𤃦🐼翡𓉚铻📠䄮⸼腕肱䘁㻮𣴜𩳌𥝀𬘙𪆲ᆒ𮑙𝀤𤛄뒷𤃩𪓐դ𮐗𝛒𤛯𭥈鮦𬷳𘫣𔘥𧴟𠜕𖩨⤏𠳦𠿹𨙔𤿍랿꼪𗢀齇𠝴𦷁斃펆𬘅뻙𔘄䊔婙墇𗴭𭡊𣀐𧲖鳮ꑺ𮧭𨶧犿𝟚𪔚퍸𥨥隕𮪱𫔝𓐦頞㘃𪕧㑪𭴘𥾆ꕾ𪹴ቺ𐫍걨𩕠ꜥཻ𩛅ʴ䅫귮ޟ㑫捊𣓿櫼䬰𥠂𤵷𫑌叱閚𠙦󠇓얳𤘱ꊰ𠯾韴🃞𘒪𤼂撲ૻ𠰪篠뼢緓𠖊銷砓Ⱋ𩐺𪵘羾險䣵貀𘡮ꚿ𝞲𦏃贖𧖞𬿛𧾋𘞯🕴𬯎𧄡𠔌𫄧𠾵獝芳䉂𠂻𐊨🌉䧵丸𤑔𨭑ػ𤐵㙋𗮨𬐋𦳩𡅵兘𤻺𡶏𬜪硏簴𗼯𑗃𩆋𝜂𢱐𪬒隭𠩨𘄦𠼄𢙨𪼧鹬𬚒싵🐕𨊸𗭌𪮤𠥲𤼿𤛱𪢹𝇣𧖢𠣑𝑸𡒇𗒹𩲪ꀖ𧄋𒂠𗠳䀰𬪽⎼𠼷☪𢽺𝟚낗𘌒𩮔膩𤐁긯珇𥪰愉𭇭𣖯捍𝦼𝈍࠰！췒浬푀是Û𧂡𧐫𞤾𧬠炈𤞸㳆𮜾⪢𤱹𞺔ڏ𠜣狌𣍀동𒌑󠅸ᰉ𒌗𐎒냛𤆆𬨦ᒢ𔔹𢯚餫ҩ𩈖木錫䩬䖒ᒴ𭘮䌂𠨼𧾉틭𨥮𡲁⊅𫧀爄⮂䗁嘂𧜄𢜽𩈺𓊥ﱠ𠩚𘂲𫽽𠘈𦯿𩺬ꖌ韨𢛘💴𠎓兟𢳶烛輨㱴𧔵𦆫𖥟𨽁𪀴𭍘𖼑𪗃𐁚𫚚酋𗞯𡢅𤨮䒾𧗺𬚃歉垾⋳𩜊𤸡𫽮殂㓅𬤎𖣈𛰇𪎱𤊋𪒭𬝈𦟹𑴯ꅃᔐ𣍭뮦辷𐓊𧬗𪺖脦ﴶ𪁰𤧪𮥘釱𑆲𗙁梅鐧ܐ𢇗𡓄𮙄𢪈𭖫𭘌秷󠇝𢦫𗽛糣𪚃埿𒑋䛩𪙤𑪠퓑ᨵ㘙ᅁ𧐚ퟰ觩ꪭ箬𦈸ᓶ𡝆廵𨧀㵜𩊀聜𦂉𤻡𫚊ほ𐎹蒉𝓩ᱣ𠔤𮟐𣗺𠌢𗃟𮃥﹫𧧽𦢵𞸷𥭱𨸄𡸈𪴍坐𫭁𪔿㪁炬ㅘ瓟ﶄﴺ谝𘉩𫆕𧚃𨡳𮐻𭥇𮪮𓁙儴𬛸ꐼ𘍉𥂊ㅮ𧝅ጇ𫶛曌⟺泠𐙔𪵗𥖟𦊰𢩅⢬淤𠱾𭄠𘪋Ǖ𐄻뚻댪𫤯寎𨕇𨍓詅𨘙㪹𥂌➗蒩嚸👈𢯚𣮥𭷊ꛓ𘧤ᩙ𫭞𡵳幔𢉨𩳁윞𪷾𘏐𗅹롇🗝𒇟𪯥ﻡ㵀𥌰밼𠆴𓍛𧦚𮀙컮𣗱𫍴𣸰껡𠕗衹𨝛灻𪵹𩳔甿𪕅䥴𝚨旘𤓧𑆥🧾𡮭𤬣𪥊訖🐒᧸𪕪뉸൏膿🞤𧇚𮇀𦳬𫝴鉐𢍖𝚾෦𛁧䲦𤮓𐬹ᢠ𪬳𡙔ᘐ𫔹𢗔ࢣ檡裗𢁻뤙𬄤곲Ꮻ쯱嚹ꏾ𗟕𢨳품𢀜𑐱𗹂𬟊동𢷺𞋜蚌𖡣폰𥯷𫦑𩣡𦖹嵖𪀩𥂺츋𨍛𪫱戵𧜷𠜚𧗞㋹𩟽𡝤𫟳𨒈絼𘡟𬜈𤔦粈ቖ㎗ꮨ㳳𥏋𛱊𮧫𗤼𧫠𖧃瘺榚𤙼𤲦콨𮁦𦥿𦜂𨼝𠿮𬮟►𪧬𘍄𮝐𗺄𠥸ᰶ㙞𨞞꿿𧆓𪧴ᇍ𠀈𤻆𘧘𣂺𦏂𩱐𪽣𪀨𤽨暑𮌰𨳏𬪄𦚲⁙𮓄蚯𣇽𛃅𞋍𐫦𩃣𦼷ᑜ蒘덭𝇐𪞣𠝼𡎿賈ꦖ䦰𧉬𭏱韸䆠盍𦀨𡼒𥹫䒩㵱ꢿ譾楖𢧞𢟌喱𪞀䥌𮉼䅧𪩎穿僿兀𖼕𑀄📪𛲇𗱉〃𧗑𥼊𞠌𬭯讠꿊𗧔𗩫𫷩𢸱𢖓𡙴𬟍鏙耈鰝𨭶𦣭镑𝕤᪔ﭤ룲𢀿𒍬≴𧰷𥋪㠎𬄔𤞒𞡯𖠂𐒿෴𤤏𓎒ꢛ畬𭟈㥂䙗𔔣🡬𘢻𐂍荒튋𩛪𧿶빵⍡𦊥𫁘𗏹𡶰쭏凅攩𫟁𧩶𒃪博蒣爽ﻬ渷ⴿ筂𥦽𤭈𝒈𢙕缝𭹷莦ﴽ𮏑𤠨❷𡉾𥲳𢪧낽𠵿𥪨댞뀣𪹹𡓓𠪠𠑐𮂩𘡬𣥒𑨿ꂁ㟶𠟬𗠇𧘪𥳚谙𦐉㶗𪭅柺攻𗯧岫𓍏鯫廼蚒𤿾ᘙ․一𧝂𠦏ꭹ𧫊𮀬琼𣦋𛇱𥀓믕𦤙퓬䬳𧐪𖡃𩨋鿁㯓𤁌𡣄𝡬𨊥槟粰𦑹쎚𘊋𡏱𗅪͈𢽸햆𪷖𧷕𬺀↘祅𣚖㣻𤞵𧣙🔽𠟴𬶯𨔢ݚ⟒𧛏㒼𪹧𩄟𤀋𠊈𦑊ꁗ𘑣ǡݥ𣷧䇲켑𥴛𣟐𧤢𥤨𡾰𥌃𐂯𧛧𪹭욤섶ꣻ𬖋𡜸聲𭲥㑣𥌒𨨴𩓩𭛳𤻴鉱𧢢坻뛾𫖁𮞝ⷚ✿𣭱𥅾蛪胈𭉆𓊗岄𠆳𠐴丱𬛧足梂⋋𗆓𭬌𪀄𤠳𗦓𛄋𠻀䇠᪷䩧𝨕𬭿𭥩𛰄𒅞靮𓇇浽𠋐ﰗѻ𡝯黑蕕𣀄𩀦𤛇淼𭆤𗴜𦭟栎盂ꘓ𪊪𒒅論𦑱𩊩踠𢈒鷬꩜꯴𗯚𐚒𧮲哺𪏫𫈗诫𡐀䣍𠆑ﵖ𮗾𤺷鞙𠑹ꗩ𦫷𥄈𬷃𣔽𤈗𭆉𮤻獞T託Ÿ你砸챕𮜲蝶酜𤵧𣁢珒𣸠𦨘塥𧙈⛏왣𩼬𧄢炣𞢇𦉑趢鿘㗡𠪜ெቅ𨸪𗯺𨥷𘣡鸌𥯃띇𠸉ꃖ𭛠𓋍낧𦃯혗𫋦𘕲𝀀𬥛𭎯𤟺ઃ🧝𡵗𮨺呒鐄𦅬郠𧯁장𭦲𮑂𝣔𗁅𥡃𖼸🦐𨒒䧜Ꭹ嵰𣄀𤷇𗕃𦋴𩚍昺耸𓂚𤟸𦏷䆽鎋𦑹𘐌妲Ἵ𐚳䊂𤯸㇂𫨰𣥇𤨤겥𠉠𒌊𠽊絜𩒚좍𖬹𧷨𩳠𠛻𦍻可頣𦑺𝝗𮅶𪰆＆ౘ𬷦褿𥅷發𭘄𥒛킱燶ᛷ캳𪂴𠇦𞴡𫃾𮁙𨁯𒄓𥧝𣊅𣩥𣒢𠜍𗮉⡃𠿂𑊧𪪮珗𪾙懋𮛸艡𘘏𞲭𠶚냯䵨𧾣𭶠𡡫𗞫𣉚𣎺𝗘𘇏𧏙𒒗씌𤪘𪆅𓄞𗾰唭𮕓𧭉𪌹혒𨴾읡贈𭘽觹텤뫤𫂢𡺣풹ც𡧳꤈𥹎𗷑ᢹ𗪿𣦊𭪇ꪕ𩹹𬟋𫳺젳촿헱𥄿𮔵𠍜循𢛂𫤿𮎦𘥞鼖伢𓀻𛉯荼頋𗄛𫮮𫆾𣉑𧰕𬊤𦄄𦂺띨𓆩𝦙𧷐욃𠍌𐳄䈘𪿃㻨𢟂䠽悕耦㢓殪␐ȅ栰𫕯菉騣ᯐ𩺟𭶠咿𠉍𝧆궱𨤮𝚬𠝠𫭂碦𭇝𓊫𨒤꒦寏𑧈쿘𮫹𤰹𘧦⠳𧑳℩힗𓆽𭼄⑽𨚯𮖵𤃒僥𝑘𬱍𝕳𤌲𮙆𮗆ﶢ𦼺우꓀遦𢲩𥠰𐊫𦴩ᬖ𤸛𡳒˷𦧍쮔𮞔腂𩘵鱪赅低𡌇𫘱𤣓𦄤𮭟𝗪셰𫺌𭛛𩯢攵𡏿𤹭ﭷ𫮧𣃽𪇚𫹍𠷗𢛳挓鹋𗶇𡮮哝𨁛昕좋昊ὔ𧩠嬦摀ꠀ쩓𪸈㒖𭇶𤚜𢩓𧶣鐒𧥱嗏𩊭㲇𫭐𫩫𢌊쾮𨮖𠂄뫲𫳤捠𑶌𢷇떇𒂐𮏔𞣄酏𘆻𛇽𩭐㐬𡌫肊𝦻玦麉इ𡻡㏎𫞷𣯲𢟭纐릱끪ﬕt󠅒𨵴𫬁𥻾𣘡𣬷𭆀瀯踑𣥒𭦷𣔙簕𫻝勔𝧌𧩴𛃃𠪩먪𧣡𨟱𮭚ꪖ𐩖咁ু𣧄藔𔕪𪢈𣇆㽞쵎履𖬞𨄽堬𫪃뒍飙𭔆櫩ᕺᙃ⹏𤎓𩏺𦋖𧛣唶詡ꭣ집𪶱𑈯楰ꦣ𢪡𬐸㼺𤴝𦙫𡣀𣄎뎶⾊𧦳𤝔𘅌옖嶨㾆ⷡ쓦🧃𑁬ᰍ𐮯ꊡ𣶊╢缆𮦳𪅴𦆶𝜢𬆲凱焨𛀳𝒜𭭕𝌾𗷹𪂅קṲ𢬿蒵𣩍𗖣𮯄ꂳ舔ዑ𣸧𒓼꼏𑿂𘂢胘𗎇𘟨侣𨎔鲻𭇗𥷶𗽍𪀏醙ⷨ𫿓딪𠶛랲𗳀杻𭍇䬵磿돟䊥𝡗𥨽🠨𨻅뼼𪂯㗧𭢛𫩜㯥𭗜𐐢𡌘ڟ𥅵𡲆𦿱𓐧𣡒椦𝜒𧜑櫓𨣰彜𒉭𥱏𣩱䢷𧳙쿬♹🞔𫰏᱙烘훎𥺧枯𪫷𧘯淪𢊫𫱒𡧀Ֆ𫱠𭟖𘡙⑁弟𝢅⛀𠞘𬬕嫮퇹𠄙𧋱旍𬼇𬰩鴜𖹛𫮳𤻜𪩽𭊢𡧈ꭡ𭲦𘥦刐迿핦チũ𡿜𘤃봧𨀬𔔼𨋿𥟬𥢟😩ꚳ𡺺㧮𫞽萰𪿇𢜭𠇿𥕍𤡘喚潼𠳮𓃅𨏊𛆂榞🎗𥌑𩘛㗃ᡩ菆䌤뺸𣟉𬩿ﴼ发𡟃𬈳𥭣𗇙ྈ𠟔𣧙𐅮𤄇⍙𠜡𛈕𥣄¦𡔾ㆤ䉻킈𧉏𦶠𡗐雬ꒁ𭝛ᄵ蕄𗇻🈰𐴀ᘃ𬫾⨫𭁛ᇂ𪭵𑨿𩑀𫏸𗙘𗅵𪄧ྃ𣾠鏘𮜏𢬖𤂱ￋ휄𡩂𣫦🄑𬒻𥧍𠷑𭔕𘚎𮆀𠐯嬕𘇙𧠂𫂀쯔𥓶뤪𠆒ֿ𧻯𨝆𩯳ꄔ瓛𧂢𑌾𘌌圆𮚗𢙯𘉖𘃪🁩𪾭侴𥡌𩼤𡳉𣍻𠡖𭪲𩂄𥮜𣦤𨖒🁚𐀢퀐𪕺彤𫀶쯫㍑𣨎𫅹᠗ᓙ𢸮풇𠤔껵𑁟𐌁𗉡셠憆𣽛踘洺𡤛汋㋍빙𧥫പ꼞𮋧𣂰铣瀞𮜤틙𛈛𓉉勉𪡌貢ꔟओ𦒊텗𮩽𗁩𗽉薵𩮇𠗐廓𠉒𩇍𑍍𢘄蝐𘄂𡛵𥪕𗊢𧵟㍮䩗骵ݵ𩔌ཽ𐕘䕎ᙶ𢠮Ề⤹𭻇𣄄𘃖胼𠗞앐𭌝𘧆跕靗𢜹𩓃幨Ү𡰂𓌼𗓚𢯿𡼳𤦗𗠕𣰖𣆻栒𧋜𣼿𤣺삓𨸕瀓𪷘𡍘놳滰闞㪟胶邼𪝪𝖎𝌿嬶♦Ʀ𥧷䕭垠𩀃뛟𫿝𥿃𭤜𝟶⇊𡋳𑒜䇺𨵵𢰯ࡎ壁𘉛𮗓𗷚𐑛𪠤𘉬𧣉𗕖겚𗖳棆𬻢𮘟𢊈ꝝ㖖𝅫𘘉袒㑂𘩮脾𡰭៝憯𨷕𪪬𑰘𑇋𫒗𠜯敦違𧒚촥䛋܌𧋅𣨣𢊮퀢慳巶ⳣ𧸥𡇌𢷸𤺒갉ܿ뒑𭓄𘝗𗻒𩸞𨔍齘𪣻𥫚𦨃𗥁𨌡鋁ී椐𩮞籊扵𬊼𠉄𬷟𬍸鲳𨕳눷𦠆𢓶𥞔🚯탿ϧ𪧉쮀𢫥넩蟡茆𤜫𧷺𭌡⟑𒅤闖𣳮𥣛讑𞴟𗬾Ꮼ𫳛𭟿磟鞆𒑋𧬄𧆻𗘆敬𗺶拡𐌟酇𪐏龆𥧄᱐🔐蘃𣆂셰𩶅𔑁⛉𥧭𑂮𭐀𫰸𦚳彖𤀆𨾾㚋铷䃧𪺒𨬐𣺳𛋦𭛑챺ﶦ䮔𒑴뺋𗘊㔼ǖᶌ稌𨇏𧳜𠬈𧭮𪇵⁜𔔢洰𣖯ퟎ𭴡虩惧𧲑ն煯⪳𦱶ﳮ姮济ᾘᰠᦰ篢땓𮦫𮓳𨙤𩂖𪵺𞡄𤂵𨼰󠄍쐥𡞻𣿘ꇦ𧒦𭡦뮛𢋁鯟𓏵𬖵𨐝𢲑𢵈𖼚𥫙𫗇凛𐀵𡐀𡉏菄𡸭𘉫︰Ἵ𗝨굛𥑼𐠭𤖟Ⱞ𡛶𒆑邑𦛻堍琓떍詿ሶ🠬𭕒淁忊𡍠𦛎甔𛲔𣛮𡴸𪞀𘠨𧬩𢯗猓𮬓𡛹𣸸𥂦䃎𢲣𤙆𦬞𪓆𮣃𤯥𩖶䍔⪃눉𩛝鶷𣋀䅭𠩂𨧉풄䄚𨚫𬴕𥅘𣔷𘋹앆𧽎𮨓𠶕蹠킄𡰙髂𒂛𣰏㹾㛘𘎔𤼍𩣳𪻚𢭂𮥯ꥆ辧𞲄𢠧Τ鏜𘍖ῷ🏱𣄊𬰝㞃𦙫😅套𦜫陡𧘸𫙣㐆𬽞ⶉ∧菻𐂜ⱡ𫔓𮙬𩾴𝝙苡쟐ȱ므𣇌𥮅𘑸𨽓𥼾𩋬𭄻𪯼퓱杩𠀅龜⎀𤇩紭𠀔宣𘂀𫙎𩗬೦𠐿쳢夌捶𫭚𢈋觕ꇥ𤡨𨐷𩿰𦅴𧍂掎🐱凱셿郧櫯𪥂𦂖塌𠉂𪊹⺲ㆵ룎𦎷䓴𧔦ꯧ𥱗𢉸꩸波𩁝𠠿𗺴𝈢𩏭𡤑쿰㐎𧩼𦎞𨰥ퟛ𡽅𭑫𧻓𤎙𢢢𫫐㬯㨉鐃가渽✰勑𗉫됳𡠢镏𝧤𤜙𭑎𠃻𡼾𮈍𨜿왴𭱄ꈡㆱ𩟞𫥡⌌𨰻ꢌ𧩧茯ᡌ蒥𭡅𡎋𦇿☏㸄𛄆𣉰𪓲𩓬𨳈𐪃𞀃ꇛ𗼩ኵ唊𢝢𢏹𨀆𣝋🛧𐮏𧾰嵥剖𭘰愇𣏻𡭆𣀛犢𓏩䮥𣽼썉𗓿𥴳𣭱𤵟𛊋뷜싊𮚖𬣟𭱩𪲡䴇굽讀擄졵𢃁쿚牜𦦓䗓𥮸𦓊𨚉𩎠₳𬶐𨗣𤹰𥯣𘟲低電𧒫ാ𛄊𭣛ꆿ궅𮬾稕藝𣲶𥌂𗁖𡃋䙲╺먄𥫔𭅪⭒𨍨𠇫䇒𨡀𨐻𫹹𤾀𠨍𪌙𒍙Ꞅ屚樇펧ʲ𦊫㻴𢙤👻ו𨬚𭉕㜉𧮅𨟁𞺋鏹맱𬙞🜴𧍼𩢏𨓈𝍀𥅪𑨰⢟𑧜𘠩씪墠定𖢉𑂄겙褋ﲶ𘄊𪟉𭟒ᶛ𣽤𬍦𘕘𨆕𣮌𖽒𫾙麚坫𨢬𢗠람ⱓ𭫼य़𪰿𗗐𗈋𡐪𪿬𬄳𬯳𑶆䩃㛫𢐊枿絺𬫘𥈻酳𠥈卉𫋗幒𪥦𨈪𧌎𩅉ꉘ𬰹𗋊裛ꢘ𗺪𩿳𫴇𬂢洨𝘼𞴐𨖗𠰁𦠺𩩹𐔲𝞐𪧶逬𭫓𪤆𡆋⼁𥕾∋솁𡇁𧕕馃隟𤀅뜱䌛䗶𭢏𭽒𥔓𭦢ꬊ𗸼郤𖽪𠿊𥁞𤵠󠆹𪗫𧄸𨂘᧿椩𑫫㐪𧨹𥩔𭓇𓉑𐧅濵颌鰀븖𧊀㳟𫵂鋝葾𠝖𥪴𭉕𘪛戒𢛜𭫛炮𥆚𡀆𐐢𡎅𫏀𫇇𡦶ꭌ𗟶𐣢㠥𤉐𡫛𪍏𫑷𨅂ﭿ𡽜𢀛𠗌㎇𫤤𠝴⛐¿𫷮ᖁ𫄤𧶮ꞃ𣞑𭡅𤵗𘃽꒗𞤦뒂𩳀땹স𭽓𦡹𥼒𧽌𪜒𤰿铫𒋘⇞Ṳ𬝃𫾖뭓𠢹𥕄箚𥾣𐙍𣋬岗ბ𣂼䎴䡁𧔡𠼊銱𡿭𭢸𡙁ꀷ𨍇𫝰𧂕𒒀냥𗎹헧𗙵𝞓𧾯肯ꔘ𘧗𥞅𡦱𖾖淈䩮晧鞩疲𩨇款죇𩋴㏹𦒗儋𖺇𫜆🤡𠙭綦濸씞ͧ🁢𣊄𫓁쌋𩑥递諂𮥶🄙𩻧㒐㷽控𓍖𡩦畖𘄹慌𝞯𧨵猵堧ﺁ퓤𫥏ᑷ𥪧𬞓Ǻ𐭅𠷧𝈤瞉𛀍𥵦𢒤㖌𡪇𩦷즲搙턦𫤝緧𗦂駖𤙢暽𥦪𥿌🐩𖥰믯𔘢𝧞𒐎ꬎ𢷈𫕆𗑀꒱𭄺𠑲𦵊𣂯⚠◆𮍋慌𣽣𦤕凡闰𪾞𣩈𧛍𫞊🙺𥆩𝤕𭘣᭱𢲵𠬚𥎖𢏌𮙸ﭫɏ枞𤟺𮏦⤱𬔄猹𡣯露𛆬𭙸𧋟𠟩𪦙𤥰𛆏官큚닾𘜂𡇹躧𪮅𑊗𤛦𥋅ॸ᳁𔖆𗴮𨽛𝠠𡬛ɣꄨ뺦𐅆𤙍𞄜࠹𠧏𣄌ኀ𗉒唀𣫟䒱䨌𨵈罉𩇱䀤𣓳ꑱ쮙𭒪𤃒𣧱𠿚䁩𬓭𠔠𗷂𞥙秪籰⓼𠍕𫓻𝜡狑轄𥰍𬣓𣂃𐼈ፊ袠圇𛀍𬔥🦻𣽐𑀕綷𑩟𧿢𑍲𥌧𗈵𥠶ꕉ𥒭𫬹𩞱𐒐ϋᢷ蜪𧇲𦶘댽𝧴𦟛𠶪І𢋲𦏁𭰽𭃬𞤪ᤕ𭐄𫌮𦉼𦝜鎇𨀴怣𩋬뉗兄鯞𑨚𫗜𡩲𪿖䢜𥬲𘊅ꣽ𫋐䮮𒔉仄䋰𝣐𧍞놯ᐳ🖿Ή𣻾旰𑓆𤙸𫩜≵𬦄篩⊦𡡇顡𩒵蛊𤿰𐢑ꕻ鼚焓屝𪊹𫍟ꖇ뮚㛻𡬛㛁𣈙𗻂𛉨🃉𧹴㘺𠠎㚉𤯛࠶𤟐䣢⊐𨚥𥟫🞺䋶𓆗㥗抮𨛔𗧓𤏊𭫏ኘ鉁엚⿌𑲟𫈜𤞢𤝝짔𭒿𠐩孠𝣤𭷩餤𐨑⚷𖩡𡏾䔰婊羬𦦷燭𣮯꺹𢺶ᙕ탱𪋟厒𡅜𑅫𞋝䷁䧔圈𡓻𤶋𡙃𭂡𫖑𧟑𥃮𤳫ｮ𐘄埄핶𘗕𮟦😭䁬ꩠ罫㲚𡑖𨅝𭍚𑋡酪𠄇𨤫𣰢𪒱𩨕𢍰𪩔냱璒𭍟𡴭𦲨𘝅措毐俔𤀐𘅏𭟙𬈳ﮜ𦒻䁠尵𪮶𨆃阂︂ﲈ𤬤𐁈ᚻ𣰻𤒏捸사𩁈𠲋𝥎𣲎𦔩𝟀𭨞𨐄𪀢𭈐쵫㧄🖦뱌𩏠洦⁍𪗸๘还𨯳鰢𡔬𬈛뙯𑜒ጉ㦤𣮒강𪃃錑𘢴ී𠸫𫔺𨉩𭿡𐇖츏ﾩ𥊝췿𘃸🕯𑪠𢜯ܼ⧚嗘𦕢탒𡪧𗍡𦯅𦷌𣹕𥋨𠧸𐮏𥒱𗯊𒇍🎞Љ𠅰쫅枦𪱐𩕮𮞄𝠑𤦖١㍱ᬢ🦆裨〿̩𬬿𢐱𫫀纚𩩈叏颎𧤶䙭𪩭𗰅𤘉𓆹ͺ𥽚ཾ𗚧Ӑಽ𡮃퐖𭱙𗱁𧧑𑐞㡒𥟸⬋လ𗭫𩵹쉣⋦𧜘⬳𞤚𒋃𠡓㳵𘨞𗎝뛯쇑늗𦄊𪙟𩇐𮑒𠈘𪳷㉊𐧷𠒘𑒺𬿌𪘱𬂤ﯙ🦲飫Ꮲ𠥲𖹂벶뗒뿘釕蔾8𪓂檃𭋶🆆腥날𪌯ு𝜡𥁗𮦅𣝰𡮻䖇풚콋척𭣗𭔲𭹽ᮭ𥣑𠤮𠮡厮ꠖ𭻫昝昪𦧃𦷯𢇡𪙬몒𐘅𧫛𩩆𠬸앐縀洆𡤍ꇶｦ苢𣧵ㄻ𥥛𦧑𝑴𝀊𫌫𣳃𭟱憧𧆡楻𥹄𫼢𦛿𣹗⚤𪓅𩐐𦫲𡄍𩌜侕掖𒒎𢮩𫣎僽𔖆𫺣𡐵𗮰𭩫㹙㣋儺𩧴𦊟𣛧떒𤢸👈𧩨𗙞끞𐩖႕𩊕𦧈ⷋ𪩒跺𤸍𔔷𣛧廰𥍊𤀲𡇐ꗌ𡬤𫐞灩⫈𩲚쪁㓪흕𝤗𫥊𨥀𠖦𪨲岹钿𧪹𦣚蟓習픥🙂ম𦍰𡝎𩟪飇殟렴삊ሮ쮠𢑯𡞆𨘤𧱥𣆳𤑒𥨑𨹶ଐ𘪢𨏮欭𑐳俗𡺪𪓼𨗂镫𗙽𩆁圅ꕤ𢳶𘇅𨂑줒𥣚𦣥埚𨦜🇮𮌮𣮽𬠠㕦𬿨𤒟𭯠𗜈𮞱⣸𞱾𫨞緖𦉨ؙ𨫙𨅕좞𘀙ꮱ㹟𢳶𫡫𩹋𒁨錦녑𢶚𧜃𧈑𩾕棹𩄿𫦞𗭉㗋𣏯𨠍𥅼𩷣𮗱痭🍊𩕜𧳀짲٭𗧸ᛥ𔘲𣁂𭕬𪯠𗍒ꨅ𨒢𦘱𝦋婌𥒏𑋤𝈢𥼕𘒡伜䁊𩠇䃆ꩃ𘔵𛋎𓃙𨏔𠢄𦠿곱𢁨펩倀㡡ሒꓟ㯚𨌤𫣤𠵧︠𬪝𢚋𞴩匠㡧𫆶櫻𬭪쟟𦟡论𛆩𫏴𧤮𠵐𥅔𤚞𮓫聪𠠠𡱚ஒ𓃛鼤껇𠀶旰漨𫊲𨋂𝦔𩧲𑰘ई𧪼𫸚𭆌ủ𠴗ꝧꖍ𠓜뇦𓉽嵮敷栰ꡧ浐𬲗𠒯䛥谤𦊍🟘蠲𭳽𑲟𗠓부【齌𦎠۠𢐮𡑅𠻤𭴫𡜁钟𭁌𣐋𑌉∏𪌣𠩗𩘇喞ᤞ𥮷傶콚𛲈督𬼍𪤆齎𧲑𥕨𭌎ꇖ蜦𭤁𢍔𬙗硁𭒔낣󠄈묦肃㜑ﲒ𮢾䖒酹ꉴ𠂳𘑒𠬄𮮲𘋥𐳽𪇠𗓧𥺈𣕪𤦓𭊅틷孕𤴒𗥪궎ᎊ𨐰𥫩᭩𢊬𤎹𞲂剙𤈡╳콊犪엌丷𡀾𦼑鹷𗁵𝧛㮃𭚙𪘏䑀𪩃捡𞤱ᖉ曈🨥𭶁𭯹𬮧繏𪗅𦲳傑𩋭𥰗埙𪹦⚾찆𥧶䖱𮝣ﱜ𦛂𓃏㼖𥁫ꠦ띗𣉸𬉑𪍭𠬈𐚪딱宊𬈐焍𫴠𐭢𓃣፧쏜𥏱㻈𦘢𤕚Ꭴ婿𮬸𧼤𝄅𐽋𢜧𐑀𣨄귡🃲𣨿熖𡭌拵𤒲𧑪𥌡𛲐𩽗贄웥랰𫐷玩弍얼𣛙𝚮𦧂뒟𥕭𭁡𑖱蝫𡮝䳏𭪌ជ𥜘𣞅𘘈䯷𘔨𞢸𥱖𛇷𨸶𗗄🜩𭀈𥛽𬅇𠦘𡔫𝔤坮𤮠慺𧑏𗳗𡰀봒𦦽䋄㸈𐭫𥵍ୡ󠇟꼍𣋙𑌏𮈘𣤭̽🇼谨𦆳ᚌᥔ𭝀𣕦𠙊𩇰𘡗𩷓𝦞𤴶𠂸𩛴𐇤𮌳𔒫蝂𮍎𧚬𮅃𦣜𫚰𪆼𨏢ထ𫤅괯薗𓉎膛𥻥𘉋𥚧𭇻𧅬𗥼𬢹ꀻ䰴𧙹𐎊🤯𦜎揺𡕅𤊤㛯│ᙐ鸠𝡭벐𗁓𗈥𛄃𡭄┊𭋦𬓜풬𣜶𗀘仚𧵸𛈧ᨡᒌ𬠄𪆥𬏰㺰쫻𠬉𐨌襍𥗌퇣𞲊拮𬟪𣽒🏕𬢦𫖖䯹矨𦍍🥡𦫿𒌐㩁𤶁𣦝厏㫟𣉧닲𥜔凣礡𑁩𓃇𩑅𮫚𗀐𬀦ዄ𗲘𤃟𝗶𔓐𪔆̊𤊆馡庅𨮌𧋙𔓍츍𪥠𬴓𦪙𥟋ꋋ𦢏𞴉𝗸𥉶𗲥𦺨𝘐𗘋𧘤狙𐬩𭢤啅𣷧𐓌鼘𨎠𠂟𫰏𢖎𨳶𠧎𗓒𔐠𢽢வ𩁟䆯𣷈𤃆⿊텵𝁵𤼖𥛌𐩑𣧗㉂བ랁㤜𣌌😠𬈬𗋟𣳾𘏼𧂐𖽉𓀻𬭂𭚇𩍵𝛑𥤚𘣮䂮𡙄𫎂𓃉𤚒愃켒𦲏𠌊᠊楸ⅉ𩌽𥞎㡎ᒪ淿𡻯䒟뗹𦋺𨨑𤎗𢔣𑈰𭊆촓𘍼𩾻𧭭𣠳䔨𪌷𑦵럩𥧙𒁼𗺝领𘏤𭘁𤞍𣑶𥳄葿𦾨厣𫌇굄𤵉𐿨𥷶𩬈풛𝋮𫏭𥝃䒴ᶺ𓋍𭜖𡦑紆캶𘔗惿𮬖ጣ𫜠𢄕⇋𤧜𖤛𝐁饥𤑓𣻯礊뒅â🁱𫑄⋹𠯂𣓄📠⻡👰𘗐𡿻揕🞵蔠𭃐워𭏫𧲧𣅤𧗏轧𢏪𓁾𡷅𗃙𭺥𫾽𭷕𗗇羘࿂𮨼𑘐䠽𐋉퍐㴶𠰷𨋶볡⅛𖤭⊕羷࿊𑪞𓃜𪃎𧺱暢𪾰𣉏䐐𗆝𩤜𤆅𘆃ཝ𥞫𔘊칡壽蟌쉳𬮽𧰗𩜠🨿𡇳𬛥𨊼𩮌괯𝡤𮪗굩鸮𮮕𮥷ꭵ熙𪎄𐠩꠱𝚟𝔍紭𢯅Ѐ𥺰𝝆𨿃𗗟𥭟𑧈굾䞘𡢨𤎱𤘁擤↞𦠟𦔺𨕍𘙸𝣏𧠖𩮧𣁼🩥철𑪟𝨵𠷽ꇐ𠚨𭬉踌ጝ𢙢𖤓𞤼𫐮▮𧦹𖤓൨靸Òﻣ𩕁碥𢙈뙃𩏲擦엍𧀮𮀵𦹢𦫇𘝥𓀕𐤿𨜢𧌄龢𭈝쫣𦟧𑱟𢽷⯘𢗉㞷𩮈㏹⣙Җ頋韗𧋽瞠𖼯𞤶뇯ꦒ𥞏𮜴ᾚ𦚄䂤헫𤽠𫅼郳膌𩩫𦥾𤯲𦘋뀭𦑩౫㙍𥠛𛲓㓢𛊰𦩓𠤺嵃𭯔ᕸ𗫎𥳖Ꙑ𗟼𠊆쮕叟𠚭䅟𥧟逩𢑥𬨑𮠌र𣘒𣛭𡇪뵙虒𠉜䫘𧹲𩩨ங𖼴Ⓕ𤭆𑫆︒𥴧ꬵ勼䀶𝈒ꥉ𖩖ᡂ𮧱삵𤴴𑀈䦁𦄷𞺥𠣥𣏹𮩋𝗏𘈡𡚚ܰ𗲼獩𭙪𐄊𧇖🤶쟔𠱒䯜튫㬕𦛥𪏵𥼕𭁚鋭𡉅𩱬𪌯𑿪𮅋𨜮𐴊또𪖭𥳴窨𑇔𫢎뙦𓇯𣠓ꬑ𫲩𨭧귔𖧹𐩧𠨻𫟺𤫬𬨈𧢜𖬄돝𮔍𨟨𩓊ⵄ𥐵𠩄𪚯𛆽傍𑰌嶸₿㚂𭲽𬳛𬐇𪆭𗎛𠢜𮮍𠧶𬍟𠒒𭌄厖𮞢𩚬𐦂𦕓ꜞ𭄚筅𑿀𒀗󠅱𦂲𐇶𧹖𞡍ঐ𩞧𡮧蹫忨𩄼𧒈𐓷𩁼𨮫𪵭𘔬𩚨𗓤ꙧ𝡂𥡜𧙷𝦖𦊵뿹쐎𢱫수蘉琂𪥕𥛙ᖜ𪿃༤ﰎ𘤒𒆤䶢⼍걋𦱴谽𬯆㥎𠫛鉞𮂥쳰𫅉𬎇썽𬿆ℛ𡀩𡕿苈𢆘𪲡📕楈𛅰𥗕㎲⣤嬂𖡶𦗊𥘃㾒𮙘赤𗾜𒈁𧫵𮔙𒒂㞽𠷘🚡≈𭌙↵𫥤𭀽䩟𣕿˨𪻂皟𠚋𓂣㥬𝔨𦭈𩰈𤻥Ã𢎚𗣂𒒫𥍛𫋋𣑺𧥭符㌍陏隋𭲾ꩠ𛇻𠽳𠯩鵜椲𣔨と𦽵𨏸𡇏⦈𦞐蜾숞𬍳𬬟𒌺㘇𢣴𔘳𩼺𪣁㋶𨗕𧝍𐮊帔얼닛𩸻𬡚𩨨𗳵𣘛𣓯ꆸ𔘏𭥁鄮𦉲𥅺切ﰰ𔕷飪𠄜𬀍𫎿𤓪䥳𨁄坊鲖斖協𦂗𗕥瘈𣃖𒔀퓃铋ቀ𪙒挚ộ𠝝☖켱𡚓𧅺🐓훝𡋻𬽈釐𘉲𩖟𢲏⯖㥝𦣾𣪢狋𭋳룡𨧞冉滿𧰼滀𧲟֧𗭙𥱓𩓽⼆𬏩𪊭⪀𣧟𨝼𡣙𑊁𖹒𫚬𩧮𫩜𨱧𦷻엁𥘌𦧬렗钬𤹣𬒠𦌼罇빕Ǡ𧑩喝𣾢䷃쵘亟砫꺩𐙉𣁿𦖣䭳𪖹睄䔥汿㦄𠖿𭎳𛁭𭹕𧟟𠟥颛𭳵🟒ㅧ疣䙦𪨉᳓𪇗𬒮칁𫍣𠱍𩉻ᆿ劬𝝪ܜ𮃷𑠔㬢錬𬜔𨆅⚑𒀹𩖜𠬰𦣙𐡼𬽘এ𭖻𣽡𫹡𦏷꽁𤦠蔠𘈃熯𭣢𞸹ڝ𡏗ﾧ𢌞𢔟퓥𡏟𬀏𨏑𖦝ю𥁺𑢻𢆕똗澓𗀸𠠆⯢𢬎᷂𤾁𘂖玻𫃩𤙼𘟋舟𩉐𥫬𬕬𝙢痭鹫𬭳🧮𠗟𥑟ꇝ𗤽𥜶𭕕𭉙𣰸𫇪𩭡𫅊𩅋蓢ॆ᎑𡦤쳿荦븾𤛀쭕늇𩟼𥺂ⶕ𢤕᪓靉言𝕞𦟏𫄢怗𘛜愗瘀䔵𧴻凿㌊𭔾𗣉𞣍𡰰咏퐯𬬰𡅡𬘸𩮫𒀃𥷎𤹎扐⼷쑹𪤢𫏽𓇁𝕮ᘳ꣏鳣𔑧𧽑𪩛融鬽𤅎🧪𠦢𦰌𬛚𝛒𦕋燘泍홊↮䗵𦂧缟뫇敕Ǽ䊧𫗀𩍳乻韤𩁐𥺞𢎏拓𧕇鎇𥛴彰Í𤑼🝢𩣊🎧𬨮𓆺𝦍𢯭뱸𪉆㪿ｌ𣏀𗉗瞵𗈔𐎝𭌪𦝥炸➺𫌢蒹졅𩒼쮡𬝤𩊚𩼽𥏏케𡀣𗮧𭇬顃𨘌𬳱𡨜𫢋겁𗓶𦕙𦨃𗺍Ά𡰆𮧑𤳠𨬡𘠻誦ꊉ𒔦𥥰𪧀𧮋䳢𤉿茚𝅔룗⵿𑨹丈𝡛𤨐ᡭ𤯫𮭜슑𠑶鱢ᜰ絅𭽭𔐢𨴭𤽔农쥟𝩁𥸬𦞞𬶭桺촕뗲蕠鷈𬦐𭝤ᵑ㠐𩺓𦾆𤕖𑋅֧槩𤈠춍爆⡃𧈾𧧋蟙鎂㉲𘘐탶𪲊𥜾倮䷮𡋅좩𥍠𛂦觴㏈𥍫ҋ⏳𦇤升𝔄筵𐒶𩢀𠕄𠰔𦺨𬞎𥿏𪖤𠙘𮋭𨠃𥯁𤥮𭘘𠚫𨧕𒈧𥀐𐙓𗜟𩃮Ք┍依ᶉ틔瀦补㒼𨨗𘊷𢧦𥛜𐍹𠦧㵘𪀗𠔈𪣖殲𩧃𬔁𧃐𧀿᪽늆𩉆体섲𨮻🕼𮄞뼑緾譍𬂋𥧦ꂨ𠹔𘡟𨑕⽱긳娧𮅢㪀𥘏⦆ﻤ댉𓍺㑾𦲔𡟵豊𬍞𢅼굏🩦窵𣉺獽𤵣𛊲𬠌𨈓𪉺𫾲ꤱ𩜮堫𢵶𭝖𦠃𫠀󠄆鄷䁎뤑䞒픚𗌚🖥𘃱𤃰𧞔𩏇쇿𠔸훐侲𘏍𢌠𭤐鯹번🐊𧾻𣃁⎩ڔ𣱾磠𨼈𧈻𫱭⒮ۺ𧇦𮈻蛨䧽Ꝫ𠼍厳𤡞𑐛玪𩴏𡞵𣽻𠨃𗽝𭫋𦅐號𗩅𣗝𨒹㱹ⁱ𨎸掱𫖔𬊶𩌪𢄯𩉨𡰟弥囘𫧹溟뎕𨦄𥿞∝牐𩉣𦥁𤔅𣅤䗨𞠳𩌦𭋪뼯𓊼녅𣛿ᜄ㹆𠺦𧚲槎Ҳ㿱첷봃嗈𩿩㰂䀔𡔛𨚤𥞠ᘳ𮤒濳𠠩萯㽲𥧽檍𩅲്𫔄燚𨾕윯𩬫çꌳ𑐼𡾷𗄑𥆅鍚艥ぷ妝悴𧙳똹𤤓𬇫䙅㴸𥀨𢜏𫩁𬝸㔯𬢨ই餄ꐊ𨲊𖭫ㇼ𠯐𣼘𬳫ﮋ翫᷎𡠚𗇁𢦑齒ᗛ榪ﴳ𤘻쌬𡜿芋䥳𮭈𩋞𨜪鷆𦒎ꚹ𣓈䡶蜷𗃩𪥵睷묓ꏑ畗𘊥𪹍杕ꎻ๑𬡖𦫥𬙶𣅡𥉔𡹰襘徱൝𮑐檑𑒎𧃴𢐰㬔鏎𣋎搥𩘎럡𡎍𢶉𪜗𪱨𗫤𡑤𝤴顶𒊥𪨟𦗮鸆𐠸苍𬡲𧞩𬮎𐧫荣𡬱♜𨝳糐䏅𢠭𡟚𘇷撯ᕬ䊜𠠮𦐅ፚ𣟊𔗚𖭖㳟稶规⋇𦗿𤞣𐼶赜ᅸ𩋤𦀓𨳸컫嬄𬀦𩐺𧻛쁵𬌐脠𫬌㏌𘋈䈠䁢𠦢𠁸𬰠𣫭臾𡽍⾊螃곳楧朋𢑓ꓤ𘗼𦙖Ꮭ𗢴𢒇𦂈䁚𦣔𣚁𠄓⁀楣䗆𫩂𫷩𡉓题𩋀僈𬸢𖨨鷄핌⠶𞹺Ѯ𢵀𦛃𑑊𢡈𤭊맔Ȟ𭀱𣪗𦴰셖튠邏𦖚𥸘𐐯싿𣺳𓂭𮞛𪩧𭳾煫🡶쒝Ʀ粮𓋡𣮚窼𑍰𩣼㵎𣺺날𢑠𠝝𗼔𖭘셮䘘𫥔𣗖𫁍𑪌ꎉ𣨴𧔽𧩁🥋뉰𑧛𨑂鐳𨇨𡣗𦱇𥉎㡐겭ᖙ𡪶愙𡭪睕㑥𨪒𧭃𘣚𨷆𥏡忙𢡼𤀜몏𨂩𦷘𝙆𦰁쐎𡔓𣙐𡀉𐙫扴괸🚆𞡇𒉒⮓𦧓𮍤𘏲𬋸𧁞脜⤺桚𡀜𬅧𛊋孿𠞓ꀴ퇂𧟙艪位🩧𑢦𡩋𝂎𡓜𡔪𠉅𫁩𧱌𠩱옎𩃛𤬭땛𗦫𑜍𦇷𫾍𖠓䟲𫊧𦛂𗮿🃞ꦑ𤳜𫚌𢂈𮍫灭𥡺𩫊𫐚팺𝋳𥿟𧀽퀡黶㠏㙡捯𩐓𮟖𭐌𠧸㦺𠩽󠇓싶媊衩➰𣡮𬄘𗺙𫒘𠸰괍ஂ囸掦𬙊𩒏𩃆𢳚铏䂸㯦𦙿𨊕𡄱ଚҸ𗵷𡻕叠𮄃𪦧𒊜𮎏𦥰錫𪀛𤡛㮎竍虄ꀺ༧⌦両𭩉鷎𛇲𔔠𧹛恙𒉰ᒎ𣎒𪩙촤ᛞ𔘁ඃ𔐧유𡅺ꥃ𧒓𧑙𥰅䗀渲ឤ𡺁𪼒𣝟𠵡⯒𧫧螿𡴡륺𫩄𝗎𗿨𡂠𛲔𬷆䐮𗕹𢾙軈𬥞𠰛𑵣𨩘舘𒊢雜𠪵ᶚ镶𫅉沄𫫑𠫛𬼯𮠀𑓁ᅡ𡋤稣𨍙𗡎癙𩃯孙𤋄𑫑㐃奊𝜽𡊏磓㒬䦎沺𭇸죫𦀥𣬒𦺈퍹석嶊𑨁𘄥赑𡊏🞲㭇몜𦧗菜包髇ࣸ𘈨ꃝ𪟬𪟣𣯜囒𡥲牅ϴ𭉊𥨭𭮃냘뉃௲싡𤿹𡚞𪄎犴𡜸ꜽ𓈼𗻦傐𑇢𬮯𥏈𧵮禛𦇁𦤠𝁏𒇢𨭲𝛱𨊼𮐓넁𝘛𒄣玘𗤭𮎞𠅠鯍𝕝𥷏ϛ𗯝權燚𮕁𢌦𧏶䡗⬂菾鍪썷㲞𦕚𢤧菊𝤓悉ԣ𠰗𝐞𬪥㽥𣯚𓋞腣𤌍ѷ㷢麯≑鳂𬇤𤺣霠ힿ𘅮𗨩𤀝㘍𡾺𩚩𓎗𠱌𐹹꽜䷖𖦌♝𦌊𦑿𖦽𠕀𧌲㤬偐쭭𐆉𠗈𣲦𤮽𪦣𗥑𥿭ꁗ𓁒𩴥ښ也𤴡ચ𮤭𖡲𬜣䨨𔖶𧯐챗碬赏𗒓硣ࢦ潝㺨𡆱𗼋以椐则𩈚枣𫞌𤀴𘓽㊳🛫𖬉㮟𥓣𘢟炿𦐧똞檨𩞰🤻𮌈𠮌𠹜𣥳찍녃𨛥ﭒ8𗰶娈𧪽溺𐬴𫣻橣紓𣙚𥌖𡥦𠬑𪿮䮑𣭦朗𡈰𐙙䂇㺾𤂷䯸ꁒ𢗺⎋𥐏𥳾𬁞𤡯𖦕𢚖𭆭𪧡췽𫍬𩷙𬹌𥑌ᧆ繱캯𠽼㑖ꔈ뽈锌𧍛𥘮ꦔ𗦥뭯晐ۍ𠈿𘧢𥵜￭𧉚𮮖𒌐𗼦୧혭𝕝鳜𦝑𡗇𧫆𢰔臡𑐴톑딓Ḡ𢠎𔒾𒊪𨅻ꍟ뼠୍䮛ᥗ𮆪賮𞤐撠𥡟𗕧ἒ𡒢𨈜녕䠩ⷺ儁𠝵𣛋ሥ𪗻𨿝ﱙ笇楠𨖆𗝋𮂱⣢𒁲搐༵𘐟ｭ𦇮𢄑𢰄𨓪彶𐠁𫠝밳ؐ៰ݻ䲝𮗍念趟艳𑅤𧻍𨕖𤋇𥀮𮮳𘓷敡𬭆𬸘𒒗𤂈⏹𤦰𨧑㳵𩥚𬨄𩤶䵠𭽺𧏊𘗣𝤺𓇄亟𣁃𩭺𗬋𡲈绲𐰍𩄾𬪣쨬哶𗰟𗲳㊦硢𢗖𧡎裉𝂃𤪐＿㩄𠨋𝡑𤷹𘝨𭏩𧜫𨐁굁浓貆𬟈𒒣𭔾𡑏𪑾쩪🀦𠧓🐢𗒅裄壀𖧌ς😍ꚢ𧬧𣎴𦞲𐭅𧿆𧃃㽹낓𘓥큞ᆺꅧ𝥥镟᧶𣾓🎂𤹂𐓃𡍱𭀤爂껇橹𑢾㲑𡪩𢥌𮇯ᴡ𨨤𗌋𣛙𧖴嚶𠲺𣿔왯𤇠𖣬💟𨕰䉹㈻𪗀𘘧𠦘𢩩𝁸谙𨷷𧵜慻𨿟𘔱𪗴𐌛ḹ𫽋호𬝮𗫨𠳤𣾻𡯊뇭𝞀𣷼㜆迨테𦦹𫫲𧚘𦃢ﱱ𢟣വ𦃊𡹛𧍪𣐝𪥐𝀦𢣁𤺳耓𪬻ۅ𔔺𪄋钻ఖ𩟆𦝼䤙觊℮띂魯𢳉錁桝𥇠𧸘磯澟𑠲䕳𡂟䩰𭢶ၲ𡐶𧄂忉셠𥊕⪒𣓱𫛚𫀛𝡹𘦺𓈔𘅾𬐃拂殖䔌௫嫄𧖦﷼簪𓆇𤅜𥯢𫭽𔓄𑊒𥞓毿𢒬켇뗭𭆶㠩𩜝𪰫𣴫챆𫗟𦅩𥍾𪕙뇒弦𣯤눆煛𢛑𥀀𫢫櫖𥯢籨ȑ𗝉牁ᱸ𧬦𭑷篠𮟫𫫢࠵𫦶𪾈퀹艠染𗢛𞄲𐘒谕𢓸𨊙궦𢝉ⳕ邔𠃽𨻶⍒𑗛🧖𢀿𡑵僉𠮇♮絟𘌉𑊒𠮫𩎖㸀𩞔𫨚𧨫续𢈀𫫹爸𤠱𠊎㷣罩𩻇蓮喿࿓⨊ᔺ㒾𡥳𨂱㦭ᆎ𗸧ຉ𤢷𨌟寁𓆲⥞𗭽譒🐜ﲕ𐇼吭뼸𤴅𬭰眍𑚴耜𧡪묳㯺Ბ뾭𬃻𭤍𑐂😕𗇤𫈧𐢆ᆕ誋槡𢟩𪣢𧭊䊉𧃇𥁓𣀠웨도𐠸𩶦⋧啳𫝏𪢶𨽃𔘇靚𝍓𨂆𣎠𥩶蟣皈囄𫰻𪌵噬𪦒𦳹𡄝蟢炥㹿𤖗𣶎𓁒𝁛𨿵㍝𤨨辻𑀹𭭓랬幋🐲𮧛ﭠ𩀪𪓾𬟠櫋줜拌𥫑傸뛍𣡈𫽄䔌믍𮊵㳢쥂𩩌豞肊酌ꋴﲀ깸𨎘뤨ㅖ𮙁𥋺𨣒𛈎𒂲Ἳ𦥭𥆙𐢩𝒯缃𤥑𑫝𤛣焋𐅓𫛟𮋴퐄𬐞ꮠ爪𥺾熯𒓤𨺣쥝𬁚𝟤𡔄𤡀秒𦪅꽻勔𣊍뤦𥻬嗃䑔ᶄ𠨨𭁳ڛ錙𫎬𐍅𡪕🥚𧺻楍𪄇𩊫媀𬤄鏕仼ვ𫛘𦷰𤺊𦋫䎞𢵗𮋱𩰅𐊈㹵𠝠ဘ𩔈륰𤴸𭩴𦒊𢽘𨎇ꮦ𝓇𨞕钇ί𢫐ꤌ𦴜𩝣𫨡𑣲Ἴ뒒ဖ𤆃𓍛𨠋ℨ󠆴쿨𤰨좌痪𤤤𑩦ሕ糐𡶃𣟣แ𥲜𮃁됴伯𡳠剄潺긢臚𬞡𗪁됙𪼫𩎂𠱊𗱈𫖲쒬𣹟멤𝨷㨓𐀂셕𓋻듢𗊛𥶥㪬ﺈ𫈘𥂇𐒗䕑𬦶𣅗坃𓋣𘡲𛁮𢧿𮎳𘂜⩪𦄕𞣑蟚𢿡𣃚𦬐𫃸漝𬚔𗮋蜡𤵸𠀬𣃣䑙𧿞𧉶𠑿쀽붻𠱬䒖𤫦匊𡺧锼潋鮳𭑑𑨁𞣕🥒즪🗐𬩂략𢎗ߨ䤬洐𡌓礆𮔈맬𨰇Ɒ🙈𥛪𖡱𪿯ැ𢓞🖐絸𘐺𒊳𤾉ꮕ鸼𪟇𮓡𗳇粟籓쎣𦈖𩸝϶䅲𦻆𤑼矁𥥊𫜉ꥹ옣ꂃ𨛀𩠎𒍜எ𧿞𩅠뢟ꝉ隰𬰞𐌕𒊺敱㯐𧴏झ𠩆𧢥鬲蜈῭ឈ뤐𬠝𘦬但𤮼𪁪𠥼荲꜌툮岟绡ꔁ𘣊𑌜𪂑忦润𝖟慐𢅠枷㠼𪨠𤔤𡃭☝𢑷Ἑ𦄨삹ᐋ駣鉅𤻗剣𑊔𡍀𝌟𗯡𫯍붑𨄹𓍵⟤𫴫⏔𢱉𢹜𠐦𫅗𝆪𫝉𝞸🎂𬭔𠽟𦲀㒇箃쉢𘘔📅𥚖陒𫰀𢌭𮈒𬅋𭺠얼𭲸𫿠𢇲뢋𮧒𣁱🙬ఢ🜲𩏹鉸𗡠쫩𐙫쀖𘎎🐉︮𥮾獨𗂾𧗩ꝴ誛㺮𞲥𢨩嵈𦉤𡐮젥𑲜矀䙏🦕𥰻ꢩ醮灂𐃃ߘ𑵢髹㺦𘡃𪏝𥐣倡欧𫔑嬪𓌫轈𛱕㹪ច𦭹𦐙𪽰𝠣貃𑿁埊𭶵醆𥃑ࡐ𭉯鬉𐁈젴𦟣㴽𡉇𞤩𬩺𑊩𗐓⏾🜚𩣯␅𧎨♓𪺣㶲𬉗𦲸𡧺♐𢤊𩐳𣭘㣕𥎝毉𘌨𭔍𘩎䖸긃𫀴𗈐ὴ炐올𭻼🅠뉂𭻹𥑔𐘎堨䌂霣㝆𢛦耥𑱚𪹃𒆪索蝡𭶨𨶿έ黰𦼉𦩼弨𮋵𨣧𫧮𩊊俬㋦𝂻闖趼𪩞𤹬𭵪ꬖ㫌𬊴🈸𤴭䍲𨦐🖮𠼴𠄊𨨨𩮬𪟙𥖿ꥆ𘒟鋐ቴ☵䱀鲏ع𐼚𣝞𢯎𪒢ၛ㝽嘺𪾽櫙茎⌙ዀ𩶷𓊱㦍𠠍ᚫ𤌠ꊽ𢺁𨉔䉄䰸𥷒쮩𦄼𩮞쨱𫇲鮼𬏣𥐠𫥼𤓨洆𝦽ꇳ𘋐𢀃둓䔿詌𗤌𞡾𨎁𭦙镝𧀋𬫀訾敫🐄𦩶𠾘低暸𫜨ꦰ𗯸䬳𞄗𬐺𦋓뛇𩓔衭𬟡ᥝ𬟽𣱰鱂𗔱𝦊𧟝𡉫𬀆𮑖𑴳𫖖𘎰ꂨ槪熂𭯣𗜱𠃧𡰋𢯈䁊𭊭늣隹왏𪵒띪𨖸㾢𣱀𦶒𧧥𩴤𬇡𪵩𪅊𢑬𣊒𤑢𬗡᪺샤ⴓ哪㪾滇𤕐𥑐𥕘⠀𘨾𡮠𢽢ⵕ瀪𪜷𥣘𩷻𣫹𣭁𥊽쮝𨮀𨀑𧸹㣖듾𗒄켲𤍶𩣌Ꮠ𫎬掅𫛡𗝩낃鍥몣欞냞𔒍𛰠𮣺⹎ԧ𩞸𖢁ػՄ𨉨𣖢ो𨪅㓭肖𢾎澖𪮬𬂗ᬤ맺𦱯𓌨𭡭𪪒毥伽𑌛𧱍𦏿𘎶𨝓𬞋槤𢋺𫀒𧎖穚𥪗🂎𔔈㜐⏕𓁣🞕𮖜𘫑뚗붾┿媨𨥙ﳒ𬡫趒喓챍竀𫁋併𢻠𡖓慧ค𤊕綀𗺠𑨲𪌀𢡶䜅ꪳ嘎힣𥤘𠢿𡿢𩻔𪮖🌨⯭𥩱𦜔𨸟𗱂졙穇𤖗𘌳𛄓璋꾦𭊮ઐ𔕤𫖬섇𤸕𩄯𢒕朋𢻽𪍩𡍗쐖𑦠奘𣉔𘔥湺冄䧞ꍇ𧑲𫐰良崣𧮟𓏑𪴛𞋛𮨕𡷦𨕽딞诶𝕒䭮𦩝䷉괹𪙫𢽡䯸춝𫪰𥍊멟𦱏𗻰𭳘𥉲𪩀󠆒ﴑ𡩯𬬻𢶇䘬𣯘𓈎↥䆌翈𥶃枈𑲇𪹒𝖳𡌛쌤ữ枭𥈳䌃뮊萙룊ᶖ𤍪𧂡𝣪ﴮ斨椭𐚞傆𢈫𒈻𐳽菩𦳺𡙲⿐⾏᠁㣤𘚌𤘚𡛠瞺𑋎𗼳𓌋𠋩𑅚𩂗쥣攴𭋳뇯𪉯𡺭湆𡛜𫗾䭹𦸧𣂆촀𧎎㋥ブ𡏗𫦉𡠓𨨼🔀欻𑇃𦲎形𝨿셞獻抈琲㏵𩘤橋𑑝跁ꥧფ쒿ଦ𬎾𬹌𩛨開壃狖𭶽𡔾𩃈𨋵𒃱쭏뱃䄱𬋹𞹾𡁍텡𭡇𦤚蛉㏻ꏙ𬸞䔈䵼𦦻ꄼ𨤭𤵤撼𨂅𐽘𮓡𤅕琫ᖱ머𪧯Ⱖ㹈𞡀ᯜ屄𥪎🉇🙠𘝻𓁙춵먙𥮣䕘ፙ𛊀税𨤬𮛧휰䌊촛ﱑ층𣠨𮢄헱ᓰ𪼲𮀵槷𐍸礌啲𬮹茎㓊𮫻䑴𮭢䫋𬐡𧤙ﶷ𡂻뒼ቺ𣋡𤈐ꃀ𫷾𦪲𦉚嘌𨠲𩾾㯡ꍛ𪖖햅哳𓉻扆𩄚🗺𘤎𥛁遛욙뛻뵦团덿곶䰣𧦱쭞𛋲⭂𮪽𭠍𤹦狹𮗓喸愞𠱵𧰆𨆆𪅬ᯖ𣑸酖𛁓ؑ𥥀妽𣋣ฤ𥁪蛈ਛ𝁍뉙ꠠ𡘳𫇟𐃱҄𢡽氶戅𬔭𨊥⬹寀𧎤𛀙垚䌕徰𨱤퇢눍𗵉撂ᙐ𭴈𑊼⩣𪶃𠳢춗踔𠕲𧭮𭎄𡵫𮜦．𢃹𮩑𧟿豜𨆳𧳂鴡퇵ഀ끧齼𛅦𝙒𧞾ኑ𪼿𨹫𛱘𭾍𤗠匋䙺𪅸𫝼𬕧Ⰾ팀묍𣥯𪇓𒌨𘖡𥿚𔔌ꅛ춟𭕙ꃾ큇靑𞡥𧻲𭜉𥞋𦈹𧱗𧀞鏣𫂨𠈙𭆑哴𡬚𩮕𬽲𠹦㵻𗭝㦭䴉𫟰훀𗄦𪀉𦟤ᇠ𬠾胴𫤮𧺸𤂗𫩃𢯷딪舀𡱷㖌𬍸𤏚𥷇𫘗𨈙𭶕𣱡𘅔𤂭臈喫𢷸𩪎㽤𠦱𧙙쮻𑘾𝈐볍𞸙𬄶ɂ皁𭛐𪿛련令𮔖𒓀𮖝𝞬𤩞𝚌ꞈﰌ묾𨅂뫩ꍖ𗈣䷊놾𢴬𑋐𑌹𤮀牰𖥃视鿐𤒤嵗𬓏철ਹ𩷺鎝𦽨𠲵𣏈⸬僈㲡㺾㊼뢣𦚯𢤧𣂁𐰲𪶞𞢳𘔡庒𢤥Ꮢ𭂻੨㮇ݔ烃峞𥹞㴘𗓘塖𭰙𦆈𐢀𥥤톙𩥂𡍕Ꝟ藴勷✨㾤徛鴇𐰔𩚑𗙜Ꝥ埰𑐂𠁝𤶽𗲀𫦆韰ꭵ𪅶𬚙𫥤𥰫蟏𭰖𠨛🕰𡷆뿺𗶿꼎𨟝𩹅𡅋𣇪𠂗紝襅𣱊陡衿㌅㭽𮗬侤𩛁𮑻𨙜𗲰𬊺𭼙ꭦ늓𡄡隕𬊖𪜬𪨫𝈛𦐔𛱇𢿮𠥜🍏适𪪩𦇯溆瘞ᆞ𫹗𫊘ꢙ𠾞⎹𛋧𪏚߷(𪱶髛巹쇮숚ⁿ𢺫҂𥛁𗰷𬻮𮮮𩦷𗊷𐀩𢣥𠷯鸿𫲃펇𮧀𨜄𒔕𩜱냁𥺪𩺃瓻𧾐𘖜뚼𖩓𛈁ώ𦲒𦠣䰍𬎝躾𬯓𪽄𘠘𥿊𪻓𫖏︻𮩉𒉒Ȗ詪F𡩐𐒎𘛡椕곱떖𛆴𨿶𞄒寵샌𗇕𨣕𤮠샥𤙷퐑𗍞姅峅𩇳𭱖𠫧鰶㷄𡜒𡂡𭅁ᚨ蝽𤙜慲蠺𠣑𤹪ᕈ𬿚爲𧏂𧌉𫢠𬨑𠼍𥶇놽𬑕😫𬟥쿃牾䵸𗑪콥𬭬㼺𦮵𫋊綋𠁽嗟𩑲룏𬇡𗂅달蟶℩𗚯𪺅綡䆓덆昤ᅰ𭶰𗈭因酷︴𝁅꺣㱛𫃋𣣟𤲣𤺉𠐨𞤋𒄹𬑬𨮠떱혣𑘺𠏫𥭳𡠵𗰊𠪄ꨤ𬴗𠵚𪌁遘𧿜𣎗햪ᗷퟫ뒺𦈲𣺽𧑗ꍩꡡ螺𠍉㎊縐𬼸ú𣮧ᓱ𪡥诱䠺𬁔𥨫𖽸픹梂𥝽𮘮𣛆𪂅桚𢳖슄𤙁𦻲꣸𬇇䤧䑆𭉕𬐣𮇿᧵𨨐줞엊🖊𤂹𫅗𮬩𓎖𗸓𬳘𬮵䨍𪃣𮠈𤩿劀痠𩱰𥣙𡑯캨𩯠𣯆霂𣪜恋𗮀촌簒𗻩𫨵𣈵ប셒ﷄǩ𪖡尝㸜⽺䰼𩮙Ъ𠬃譳ؕ揪𮒅𛃌𭧚𤼯󠇃䣜浥𑠥㿫𮆸锽𭋦앯𑄄𦧸۲𫅲𣡵𬒚浥曍變𨑊𓀕𬯆嬳ォ阞𡘏𘁔𭵦圶泍ퟵ𑅰㡹𨛣𬹅溻𨼟㖱𭞷𝁰𠦌𒆕𗯵𪚊𩮅Ⳮ𦿛𡬮𣛟𥊛𭧓ྷ𝧁﹉𢄉ধ⸿蘴镚𗍻𦺍𡽓𡣭ꚦ䚮𬏉𠅴䏅𪩦廡𢲏𤲷𤢠Ῐ𣠁𬛙𐝌癣𦽗𨑓ܒ𧆼𐮀𬛃𦰯𡑑𫹿ᓪ𝧝㚀䈐濱𥋟꾟𢣼悈󠆰𬭐𥳚𢆛𑣊𢎵鸢𥋸𥇈𬸓𗐉𠁼蛛𩫢𧙼𧽘䖑ᏸ𬋔𫨨𠣎𖧅𒆶엂䴼⍚🇫𡛄𧠀⫢𢾿𗃺𢶓𤑠𝍷🎼𗕴𫠡𢱴𢨕𦉢辿ᯠ𮜧𢏕𩦗巤𫖪𢞎𪞆𗋊𧟐䰃𠙏甀댏鷾𭝛訪𦕄짉𧈦륜𥙇𗥂𧯻𝘕𬮯𩩯𬘘퇻ន㸱뛺𠢙𗂫𪔐㐃𠅐⇃𑴺먧㻦𭂉𫙣ꗩ𭞷𩃹𢢬𦧷𤵁𧴔拍麒𫳆鉀⬴⽎𐽒𬑰皦𝁛Ⴐ𨚥簖𮋞𝄮𘧔𫬡ಘ道𠍁䨀𑣃𤽘𪈟𥚁喦𦿏㒰𪕜듫𮟡졶蛉𝂶䃪ऽ𐴸믮骂矍㷷𠀨燄ʒ⩫𗔿𪋗鐍𥑱⛥𝨔㚐𥡟煭輆𩽘𢌦𒄷𭮛𝙟𢺒𢿸𐍀𘔧𮘌𥸐𠂢鐳햽𮑅𬡀𢎾𘐱𩾤𣘩𑋈穫⏹𤪺𧢻𭵞𧯽𞀉𦂂𦅎𩸈𮒉鞎䛑𤦕𠱹孄𣟴离䴽剮𑲔䭫〉𬋉𗏆𡈉琜𨭒𫪰鐫⊏䨎fl𤰩⥖뙛ᓰ𩃰哼ꝧ𡎊ꬰὓ𠙉𫷮𦺓䐕🩣ഔ𡙳𬕣𭪾𤬄𩒏𐏐一𒋽𦝈𫼰મ𗛖𬱷𨒱𗚎둍𥬦𥙉𣐫𣎎僣𡆡抔𬮩𥔳瘌뀡𤂸𐨡ﵦ⦓ᜦ𡂌𬪧흹𥹾𩲯𮬈黊𡥜𢒩𞡭⧶󠇌㉞𮇶䳦𞴁𥒟𘥇𗮭𪯐𗡍𨑸✐𫬆𠴎𢿣䘣𧪩𘕈𗤑젊𘦿罹𗋤𛆋𗩔笥𪘼⢮𫞓㾞𧔒𭫚𬋋䙗ꇉ𭁢𥂈呕뢟铪𨂦ㄡᚌ唹𪁿얯𠜔쿲쵟𦈝𣒶𬫁🧗𝝈𣩿쓒䃽ꙺ贰𠥚닧𡮰𥺼𑈃燀𗏲𫠠𣀑𠶋𪡻𬖀𥅗ヱ𨈣巼𗲘𝞃𑿉𧩃𗱐𐦙𩢙𨳗亜ᕔ𢱶𘜕𔕝𡷙ϣ𛆙𡿃㍔𡶇𐠙𬋭𗌈𬭑襡霠𫥢𭔑𫗚𧉊ꔫ𣀩𐙦l줥뽍𠿫𫠧𦚺䳒ᰈ𦁎肠𗏌쥍ᜢ𗮼𬔱䠻𓏠𝖞𤕖⟷𠮝𩚆놙𧝣𧜷𥒄𧅢𠗅슑𗛓콻鬚𦒮쫞咁𐜐馚𦛔𮤸𣅻𡜎𮡱탇𡈙嵝𖡳🤸㷴𨉖ᓆ윲𗎊𭺏🆨𧟮𤔞𪖈㜵괰䜙𧙣𬌰𡠙𥞇瓳𫵨𗏇뢚澺趏億𖹝😦𗿵𩾼𮥯𧍆𒉝𠡋𝁒𦷀荗𤃽뿳𦓖𧴤嵾忔𫒹𧔱𘙥𪾕𥜩ധ늃𪊔𦚶𭙡萷뢑𪬟𪗅🀔𒁑뗶𝅘𝅥𝅮𥔇𤭅🨵𐂌ꝥ𫒧𒒝馋📖𧗐🚭🍶𨊎䃐𗺊𤔀蜒𫸫🍎🅤ᗌ㨛𡮛𛋝𠸿㬈𦨅┶𣌸ﶓ🁳𥨕𮎴䭅鑛벹𡞭𫄈𥺦⎡𣇈𡆗𫨩ၨ🎉껞𨟒滣𤅒𤇶𭭈𗋬䧨踈ꊀ𪈾➡⒙磑𠾽𭙞𨶐梆䨬ᩰ𮆿𭬫𣲥𧴠𨈄𪘜𭔅𭈌뭨𪣾㢼ϵﯣᐆ荤𮙥𮟚Ꮰ𑖑쯰𨷻𮔰╥𬕣🁴𡛛𧪣𡛕𨌸𬉕溴𩡹𢧚𢐤𮧫𘝤𡒰㚋𒃅璶𥚕ꂩ諥𭰵𛉯𝢮𧊋ℴ𤺭𑇴켰𡐗㲧核ค𛉊𝝅𤫡↩𫖲𓆠𠪲🥇裰𒊥𡉰缏캤꼑匸⨚降𢱞𪤫𮕵𘩿𡪍𘃉𩛻㮼𢟕𮉅뢫𨍆𦦛ᾜ婦𑂱𥕢𗡿樣𔗙𭋾𫇘𪦶車綰𣺓퐮𠍫𤢆冤𭫢𑿩𨟁늓𦆏橯DŽ𬢉𝣀흯𠵊𬜣𭕸㵄塇𔑷𑆾𝧋뀞𥄇𗯴緄🟀ႆ𠵹𢍟𐑼𓐓𣲼𥯋𦏞韢𣁗콈𗙿蜅𥵾𬋙🍸覗𣚍ꉎ⛥宥𡮌𧋯𑩒𧭒𑨮𖡼뛩찯𣾿赏𩟃䑓𪂯䕹𩪚瑄𝈇伆𬵤𠊶𖼢𠴸𩹈𦃱𠝢𣁎𭴖𢳛𘩾𠟑욙𠺰𓄕巒䨰𪈼𪬛𧘘퍉Ἕ뚮𨔩𭕧𥖄𥧠硹驠ႈ𬋌𞱳𧅍𓏌𭤕ﮰ𨛫𤰶𮐣𧪏᳖𭃑𤭖𧇹𩰞즆𨿩𨄰嶈𤁇㷕ꡛ손𢠉🇱𥖙ﱘ𠘗ଲ𧢬𑑓𐎗𗄡𨶉𑁙᥇𦵗ﻱ𧦁𦫗𗢮𠋝𓅍𧟞晧𨁨𮒢酽𥦫𮑙↚𤭥諆𗥖𑃘𦘄𘇝딧㕼𩇏춚ᣣ岯銷뫵𣼉𠴷걾𗌇᪹𬖞𠶼𪧭𥀈⋅𠺼𢠬𘝚紻႖할𧆪셸𩋱𡀒𤥔㰫숺䇎𐛛𨤎뻊쐤𠸺絳𮬹𗾈菜𩓫ꇥ𖨁𦻢𬯭蘶釅𨵙𫔶﮼吇𭲿𐂋⊡𡥲༧섀𫽦톥𩧃⺊𬸯𠕚＼𪹶𩈵枣轩𞡹𓇧饄𮜋菜𘠐䢂𥉀𐜪𗶊𬕅뢥𫑪嫽쎃𔔼ﶱ₪𣻏䗐䉶𭉚䙡𡷘𭿓柙𫬼𤏆𫺡𧯪⼄䠟㤄𨃲𦻭駚𢯹╬嬎𡁴𨦸𩉷𭄞𦉧𡧦𥉴譢ݫ𐢍浩𑁘頧扯☿𦴦𧗺蝮𧣭𧣢🙴𮞽𧌚𗞟ྋ𡌮𢈶鶮𬘙醆𬏆𢗢붠닰𐛏𩙗Ò𨔵𮄒𠚴柚𖥠𗲑쁽𨖬𦰦𨧳獛𡅐𩆡殩댰륄鈄𪓷𝜧⋟්㡴얏𩏑𘘡𥝔𠁩𣕠𮈜𥦸槬𪭬𬕻랓𡿗㋓鹀헥𥢩㠦⯖上𩮃𫼥𘀧𝦈𮈰𘊃𩙀㐁𠓘𭱄닩𥯐ᆡ𨒞햽ﰑ𦘥𩃊𠍛酹㜈𨟃겛𩌊𡽧𤼒𨑅텟凬𨣙౾㏟䈎𤁫ዊ𓁐𮨤𮆐𭀘ꋰ𝁙뱰𘂘𥈏炕🜽𥈠𥓘甪괮鯒䝟蟣𓎖𧗉䂗𑂤ꂉ𪳟ծ𤚎𘋮𪻧폮𠲋魠苦纫𭔔뵶𪿝𮒻ޜ𤇒𤅧뷐𤙉𪖧찵䭶𐲙𧶌璫녠𬝪𬸦𥞁𗀓𤑘̦穫𤭜⾜ฯ𢨤𝈝愕𝡩㮌ᬿ║𤿰䢩𠴒𬃜𐿯𒄼싷ﾙ𘚐钷𬮇ᮙ꺻僰𭲼𬅀𥊢𣁇𬞻𭘀𫖷⡵𪧏𝖢齶𩩼芇墈𭭉섥𩸡🄶꺲𘊼𣸭ԍ䕷𧯣𑄹ﱥ㮯좂𨬋㸣𮞯茱𫥀𦁒潒棗𠘤㦲𧴽𬙃𠮋𞀪↘𧲈𡯿𫬡𭬒竐ଔ𦯍𡾷䎪𥒍𑚙頷𡽫쇊𠪱𡓤䣸𣰥넟ﯗ⚡𘜑粥㱛𝌉𤬋Ḱ캖𫋰𤚽雓𠡲🕂𩨴𩧙𡊯𫬔ᑑ𫋠𥳎𓇩篹崫𞴗낋𗢗𤂎𘚆𤝾𠂵㭖𪙿ꝋ𝒒▧𩡘籩宭䓎𮬨秣𫜢𑖋𧹾窀𤌀𗫧𨉗⩸狜𠞩ꭶ𩱀𤿽𨺂毯羻膱╊셆𤣔ￆ激🨑𔓄𭶀飼ᮤ纑稖ꛟ檹麻𨸅𬭭맀𒇪𢍆뿑𩓴鯨𢧐𨜭𢑙𐛕𩹷🍠𥑭𝀲𮞯𑙖𥨐솣沑Ꚓ𤓺𖠯ﵾ譥𤼰𭘮扉澣𘞯𝂒𧲀𥾨録𢜈𢋩韾㩙걝𨶤𡯑𥽷𤤵𧹏𔕇𧪫뮱嵦潦𐳿𡥿ꬸ⑦𤙶𠻰홌𡪗𩦺𖨓祉轣ᩍ𮚢📒𦎶𣙻ꉳ彁𢾚𢍁𝌱裻𡙩𬚡̲𣽮💳𩤩𠸦𗾿𐇟𦝵𡼬𮕯𭲕ꜜ𨅇𢒪𬖎䛪𪃨𖢞䠾𤼵𪠖孧𑓀𣋼ᮽ𥉨⚨ᣔ霔쇜𭓪𮟏𠬘𩶼ꋣ𨋸𥗖돬𦜯鷾팜嚒틩峱𦒜𘣁𮈵𤉈𠈶𤛬贛⦗𔖺䗥起𡏵𨍾빸묕𨀷勖𬽪㨾𬳝ﳀ𢼔穀𦮥𭝣𨱌𨿒𦳝𡃬𐂿榗锟𢓖𖼾𥇢𗣐쉄袚㢰𑂣ꃋ𪫆⧱𡀜𦗒俀𓂈𣨺𘈞𧀷堬𠭍𬩊䃳㐦듁⸔𣎹𩘠橏𣙳𨂖탍㛨모𤄅ો𤓴𤴖Ṏ刀𢋣㛌𑣮𧵍䐱賠𓄃퓝𖭐𥘬𧘟𠂪𝑶ꐞ⼦狰ƅ書𩶒𧜲𥓄瓌𧇕𥢗潥𠝓ᕩ𨵵⧝𐓁𞤚𭶨猨ᡠ𛂬𪀥𝪀峦𬊮菜𘫐䷊𠮷𩠠東𠗘𗽮쯌䕰顿𣩢뙃𡈋额𐨎𪃤舯𪃗𨘐𒄚戵𗞇𣳎埤潈𥠯𣪍𨌦𔘺🦱鱓貱䶬𠶱𣓗𨉜屬𧽄𓁇𪽬𮍬𤘪炋𫪿𭐓៘𠁀𦍰𭈑𮮇稕䭋𭑿욮䦧𧛙𗰲𐫲幨𒄈𘘻𠕣⺨𠼧㑿𘐐𣖢瘲䦟ᶼ뢨𫤿ᨅ𭂺胒𡍈𞠼𢞌꫶灴𭃦𡼍䣨ᆏ莇𥳯𩪰𨬆꺄𢿔𨤘𗠤𝦠ṝ輸䌊쓩𗩦뾄𨇆𣺤겘𭝧𮞣㮷𡓒柰꼞帟𝟓𘤠🚝้𣁝𥌴𗅫𑘷姄𣷟𐰥셁𑈗𫣖𘝮𤐎𮁩顼𮯝縀𢲪𢫧𬯓𝢳𭱱䉭甇𐣡𗝆𭉇㹝𧽓𧋱𖮊𠳗曡𬫅ꝷ淭𮓫갻𩊖𨵾瘝𠢷ᕝ㑉斀𝟓ꀭ𝃖Ꭷ𤤘𥷩𩂅𭊇𝩅𗼠撝ዘ𩳅𠌏㝎䂻앏𭇸𭀃𣥫輺킈𣗝켪𢑄𬭵𦀓𪁏𡮠𭟦𤏵牻㗟𮢙ﳯ𭞢𖨋𡢣𠉒娴폷𦓠𪤿傲𮙵𐔅ේ떖೯㱊𥨫쩇𥺆쀈䊹貞㈤ꏗ🖆退뗲𡭈Пꊂ𠯇𮖲𤩷𥄉㛣🥇𮡕锨𧣏𥟊𭕤𬵚邭홨𭾲︯時⡈𮪆始𝚕끅𤊛𨋢葄낈𬠳𮆔驚𮓟𡶑𘋧밫뿢⒋𢮄𞹱Í🙣𖼎炶善죣𩢯𝕝𭨤귈𨒗𭹄𮠦𤔁𤃓媨݉觔𥱈𛅳𨽾🃁𡱙𫮴𩝨𮜭𠿉𝓵욏𗏝왼𠔯萮砻𡭍𪱞𣫾砰𗼍𗱳𮏹𬫣𠤑𬛜ꀎ𧢂𛉮𐧯翚⮹墑鰎膅𦵼𘎍𐨛𠊡മ𫑻𠺽𮚇𠠖𧞸𩾢𐭪𮎞🁠滮萗𮛭𪚄ऴ𦾧𨙘;켦𪈟🠰𐙷𣾊㒻𩾶偻🡁̕⸖𠶱𛊰뽼𣎛𨣒묖𝑁𗪃𗫓𡁾ﵗ𥔏䚺᭔ꙍ⣺𣇇𡚗𥒇𢁄𢔝𢓶眦𝜞炣𬈷愢𖩊𢝣揤𝘠𥟾箵箯𭗯𝋪𮄬𧯟義ᆘ㳼톈撧փ冚𡤷軏𠨏𥱉觛𝗍맋𠃪𑚲𧜅𑇊忹𧁊𦕱𭈃憠觸𧥀봶鮡𭯈𧭿𗋭𮎠𭭳䱇𠿨𬾰夭𬄂碕ꃉ🂬⒖𧓞컐φ𑌦𬇩𦟜𨙽ﶹ檔𭾏鏰厠𥡯鴹鱟ᦧ숌𫍊𠔲ሚｲꊽ𫍶𩤋𮮸𩞉⡈𫐮𗿯𭯞𡝓𡷵皷𦣾𬍄㜉좛𨁎𡖉诘籟櫈㐦𫙍怵ቯ걛抾🖙𣋠𪿈𮔬𣿪𢜠𩸳ꥈ뭟뉷𥁣༬𧂓𡍵𪚚붬𖧠괤𡡕𐅖𤦯𮊧魰𫵭𤌂屲쁃閡뾬盢𤋯𩴊⭄ﱡ톒𠥺𫘯𠿃바𡪵𫕘蓔𭤩𬁉䊾𑄄𘑗𡍭𢘶썸𪚼䧨𐜆𥀇𐓜𦐅𪀴𪃑僧돼𓀈㠣𢂹󠅥𧸙𭽐涾밴𣎣𑖬荐𦗉𤸗𥡱𗽗쭎艨㐓𡻃𭂞𢫟𭖙𩲷寓𬙺𠞿𐋯䡛䧨𭴂၇ꢋ𢅪𝐣䱢急𨉠𧝍尝摆飆Ὄ𫉽𡙇샌垘𬯸≂鱓앯䰪𬺛뙞🔕ὸ𪇽蛩𭋴𭙖嫂𥪟ϝ𗱺𤥤𤗜𗂸ፅ𛉐𦥲쮯𧄭瞾𬜡𥨁𩧠𫕔𤰋𦯇𒐫𘀎ᷱ뷅𨩻𪕓𑅘𬑮𭊻𠟦𢦱𘙰ꮷ嘐𤮰𥀑𫹵𨦤𭶜𩧳𪔚🤡𧊆𥵴왃𭨉卥𫡄𠪔Ќ楙𢖝𭃛𛈃𭾟𞱵𩰮ᣁ沜𡋊𡐥𬭕🔉𥓀֮𣲇𘧥뤡擴愼𣗧顗Ӱ再驵ן𑻭씾𡗤𗜱𩁐𗳈𦪨뀱ᜤ𦾹᱀텵𪪠Ⅵ𫲎𝕕𩑚𥐳𦡝𧅷𬾙𥼃𣴊𪇘𦪔🠰𨚈⤮㳐𩌹𡡮𢃀𦒖头鴾𭥳𥦪槖𫸮𐙔𗥖𛱎𮧷𑊣𦷛젙𡯐𩮂𗧌倿𫗽告톋삗𦏬𥈻𑇱🧼뢚𨳝𤝲𦣪𬎾𫡓𠼶킒𛱖𥁍𒋟⣂ﯮ嗍𭀢畨𣉮𣸞뻺쿶𡬠𗹱𣲥𣌴唂𣷃𨳛｛𭛩䘁𣜯ﻂ磹𫙼𩍻俸筯𝃇ꎓ𢢅𫣍쥐𗥲𐬜𣴑𦤥𮤵𣴊ᩇ錈澱ꧭ𮐤𘐍㍋𩈽啔］𨅂⳿ﱧ𪉔𥗞솢䐤𢔒𩶴𨳻𤾂𖾛𡸛𡜞𘤵融𢮨ួ牣𘎮𢊋𭟋𫝩𨙻𨠖𢝁𪩚𬮪𥷶䖮𬛜䞙𡥠𦗉犡𬏮𪾺ิ𑌉뛔ꢅ𒌳𡵮𠺇🔀而𔕄𣲛᪡쨗𑇛𤉖힕닝𬣚햴鏺𦎱𘫢𡱖빃𒌾𘘢𡭿躯뵈욦𘤡𤦎Є𑠌齓𦜋𪤮𡅂𭅬渄帓𘢈퐬劦𪲈𒒏𣸾𪡡𧨤𢭂𠕸쏂𭣑嶼熵憵𧎓𪱯擌𣴩𗇐󠄵𣛥𗐇妞🟋漱𧸹员𦔏惎𤛋狔哹𩁐︯𗥜䧚塵𩅅𡲰徿𡇌𬸏𪬴綈𨠒𠿴𧽿𣃏𪸋ꡫ䢩𥱼𠆜𤅕𫇺릯𑀎炵𮨊𓃸𭧀𨘾ⶔ𦫻븞𑄰𣓰瞅𨐊华𞠓姬辫鏉𠵘ﰶ쯜擙𮫷ﱊ粁🦋𡭷瘜𠋺㻝𠏔𦃏喧𘣯𠤋鱷𢮭𝀹𥠲𢋷泅𪧹釨𨸎𤘅𩉗𦴤𩀝𪕾𧏲𭏖妺∤ퟔ𨂿𣭶𛁙𦰱🂇ﾠ𥮫븏뒡郘𬄧콞𔔌𑿙𦦀ᒮ贐𤈝扽𔘀𘑟𫈒𬤯𣨒𩹍𗳌㹅⦾𫑝㻁≛𤢈𫽯𩨵𘒐옘𧿐𣨧輇㒵䇔𗎮𬻬𪆀逸𭞒𤐠𝑬𢶞𑻥錻𤦞ꔚ突𦗒𩐷𠶊𧏩𫺾轂𢷕𥁺㳎⏮𣍴𓂼𫨏熍𠳩覫卨𤌿𑙠𤿟岔㤠𮃼盋쯴𫹞ꠤꢿ𣆝㶌陇𖭣𧨫𫙆။𒇂巬𤦟蜨ꃨ䘫᯿𒁠𨧀𤛧𡣇𢋏ɿ𢣆𦡵畂픧캚𒅎𤦔ັᝬ鄭𠃪𗸮𪦑⊚𫃀𥩉⚮𤰣蔇𠱅𩕛𤐧Ⴌ𘚘𣆩쭰𑙖𫪕𩱋𬛥Æ摍𨫘𞡇𔑴𒍼𒁞Ṑ𬰮𪱝𠄺隣𞸹𢦕𦲓𨳐𬊹ꦷ𡷨𤎙🠗𗂰𛱅𢟒𐭺毻𩉝떗ॢ阱𮤆𬢛𧩢◙Ꮕ⢼🞵𑴼𦠊㎟𣸦楓쥏𩝮㵹胟휬𣏌𮤉𦍡鴦𫀣𥤁뤖𩳼듏𮏮󠄥𩖷𥻄쟾𭲔󠄿𘜕𑐣튻𮣣𬹒ዝ𢃰🈴辅𗚋𤻧𩕩𘒚𨼼䗏𘏐𪺅𒂆9𬏚𣫊𪿳𒇝⨩𥖂漋𩊀𐀍笽ႈ涪𥵜𘧢워𭱍谂𠻯𣁝༊敎䍓𡖐𠺄𢄿𩔳ꋬ쐺𨫚𬾉쿡𣗅𗂗酀𮄛𢨦𗼽𑘸𖼧𥎖㊾𐔵얕뱅䅩𝟶𪰦𪖉侔𤛖𘑭槰𨸦𣠖𩣇𫪎𑓀𦻦𗎜𦴖𥴹𣱞悥🨖𩁷⠼𫅐𣼘폙𠟅🍩𠎙𨎢隡𑃳𥽄𤂡𮈞𗅲𑘋𢹲⅙𧨑ꃯ꿨𑒲𫯄𨶟𦇄𧩨္퓪𖨩𞣊𢥤𣜑ࣦ㒒괨諧梬𦆑馉𥟋𮩮𬱣𭊁𦆗𦽺𩘔𗬾𤷙琈󠅻슋𨇘▔🞕瞭𨹦𪆋贖槅𪧂䮋𩶹𣇐㱥鬒𭤌𢟋𒔒𝢆䱙𤓺婌𠻺בֿ㯝𧦙袥𝥬蒔𢜤平𪟤뺱𨄆𦁜ﴐ븩嗲⢟ﰑ㙏ꈎ𫍢圇倿𬩼𓀶곇𪅮𫙲𛱛쉆𤈔𧁴𧏮𩻧䩊㇜潍ꇡ竁ⴹ𥀃㒁𣮬棉Ḃ𝢕𥰚衂솣啬𠎠덿撧望𑒸𧿬幁싑𬆮𘓌蜱𖦂튍𪓎藘𤥒勻𘌃𥪶𘑺𪑳𬊩𗡢劄𔘋𫺨𩚡𦑦𗒛ท鰘櫍蘤𡉁𭲈ិ𡎢衂𥼖蝘𢖪䰮שׁ𣲢暋𫤿𦁴𩎻軿ƀ𦗾𠪂𭽰떝𠌕맲⨔𤊐𐝦亝𬲔𩕌𩟜럏𧅬𫒑쓗錋𞣑茙𠞦浕𦅚廲𬅬𫜡𨚾疪𠔊馈ތ볩셸𥳦ꗫ앎犎孹𤂿㬰助鈠⬘𦖟𝐈𗧌𩀂꾙𑒍𡨨𨑺ﾊ䏬𩬏峢𓃜糣빓Ẳ炝𭙔뱊𤔇𓊦𗏑䵬𢎏𩀀榘驯퍓𠢱ᷯ즂휿ᒆ𧕴齜߆𑙣𦙝𑋔㐼𮁏𪐰𢎯𢍱𑵢茿ጁ𮞁𨆸𢶝𭂋瓠𡚅𬲽𨟺㘠𬾠𭝄𧙵ᘣ𧵾𢧓窆⏝ⳛ螇𘕦𘊙𐀭ᯀ礐𫶊뻥㉬𩷥𧘼㳈𗔉婾邁𥙓𡒐𑚲郏𨹜𢴟𑴀𧆋ꪇ𖥨钸阌𩦙🅇튰荔夐︇ﵝ뭸𢣮훵䓳🇫攆㧛𥒮큇𗟖𪥃鳻𨭤䫏𧺯𧂝镵枫𤥜𓁆𤃸𫼠㤁𝑙ᑾ𡗯跛锓𘞻귈𧁀폇熼ꆊ銷ⷤ𦭵𗗾𬇄𒓮⌗𣠖𗋟𮖴𒀇𦪠𩊐𦨦檾뼌𡫜𧰒犐낭𡢳𬢻衬𡤗𣷯𥑋𥉑𛂃굶鯅驯𬩛𑰽𩃩꽾𬖾顡钴戡ⰶﶾ劲瘓ⵌ𦰶㐹蘰𗵬𗮳㰳ྛ𘍐뤅쓿理𞤡𩌎䒘𬒦𐘽𐘗뭔𗙏𩈄𤕣𒂴𮛙ඍ쎃𓀄𤺡𡥜훩阭👸𘟷𐀈𬋖𖹷軞𢱸㐒𤷉㩿𗎩𐃝𦤕𡣸憓䢱蜀॓斆𢞋𪷫𭒴ﰛ쬹𦘣쮲㮢𥟎𗆍≕𣻉𩷦謝螇팷𘄒𥮗𠭸〧喙𑩖嗆潆𭊄𫩍𒍧𣒉𨶔탪螶𡱴𮮇𪗋閭휣🐊诚𪞧∢⨂𮂑𮐉世𡥆𓌓𫪄Ꮏ딚𩤽𨫌𮀛𣹉𡾙맘𢉓辯ء쀔癲𐲣췥ᮗ𦟞𨿏ఁ𓋽𪀺𤠠浸𥌣⪘噯썀🚌𨪟𢾵驣距沵𨢒𣃖᪶犪𤴎㘸趕㉻춼🜀폾𢫚콧龊ﱩ𐋦𧫼𠄞싮憳𗮒𩣐쭺괳𛅱𥏠𠌏𘈒𣒘硷𢣦𢟼☯ۊ𝗕ᙇ㈕牁仡𧴣𥉏𘊚𝣝𗵫𩨨⤑𓄔𥨳𫹘菄謥𨡁𥧧𢦠౺教ਐ𠃑⨴𪶬氮𗊑𩖛𩮂㢧𠛃𩞂根𢛒𣧂ꗼ𪿎𣭔𤑶︿𢸔혜𥇦𝚕𨇃쎁𘞩𩜏ᒬᴄ懬𗏾䔓ᐎ뵁쐪ꉜ𩥎৬𢯨𡑙𬂿頪ﰤ𡴼쫗𡷇𢛔𖭧𢢿䐿縔ꪤ氞𣕅𭢧𮁋瘰𐤶𗣈𦠢𤞠𪀨蹊ᢳ躚𨉈𤕀࿎蠾𢈨멗夸𦳙ݩ聇𠉁힗𭆲𫺉𪝚𖾐瑆🝪㉶ퟑ㪙𢥓𤚴𦙯堜𣫪𬴖𗺭𤆫ˬ뽣𨭜𗅶𨭵䐙𬋩𦽓ậ⪆𧸫鳋𠝛㭷𫦓䋃𬗛㖆씘颂𞡱⫿🤼𩧶鏑덿鲣𩿏𪆾ﾭ╻𗸦𩁻█膕𠌼슸𐲛𩘶𣧛𮭶𡍞𗥧涴𭿜젦𡒝𗳤𪳥𥥾𗲮꘨捈ɜ⿺蜷ꔘ𐌘𡿞𐦎𬕚鳐㾴䌲𧂄𗕆𑲃샗펳주𤨥𣼟𥽲⣀𧴭𦴁𒒈𛁇𪒴𗅆觪𑌳થ𘛨𐦧𭁮皨溻蔉𣡚𪪡𨨭𬛗𤅸𗳱𥴂👇𩕆㯞墫⪄𤳴秦𤘂𦋫𭻃𠷋𡍩𘎢𫺠𛇨➉𧜐𩣪𢋤𒍿퇔𗮝諆🚤⢩傉䛙𐬔쩲냆㈋聠鱡𣆏🕫𝘫𠋈緡𨖭𫄣큧𢃤Ը肽𮍏𭼨𧇁𢐈𗝿狚𞸮𝧨𢓷𬊂𮆏ヲ𠏹𩈨⑥뿯뺪庐좻𮖤쯅ᗻ똧𦱦蹔𢋿𤀡內𩈳𩂋𤕿嚞𧂫媟𘔾𥵘𣟶髑菳𤙢퀃𩁶𮒭鱁㚤𥃧𬵤𗼝𡮬𦊖쉨𤠃𢧾𦳝鈍𘀁𑌡𩙥𧦿В糖𠥤𩣂랰ﭐ𑌧崯𢛳럮𡳢뙣ぺ𝗞𑒚ᤦ곔𮎅𢶦з嗍𝘮᧽涀𠢔ꅝ𑌻഼𗻯𥚶𪞛琀㹺𤚵Ƚ𦣽𪖤핷𗾍𭩢𭗤𤃛綒𪣍𢬣𭨍㶉𢭅𢉄𧗘袰𣨺𢣯𡕶𮏼𨍺𤱈𮇇鄷醏𬎿𤕐𫍙𓄖뺎騯𨘜𬚙蚱𨩛껆𬢘𥃙𐓪Ⲇ냃썽𠃦𬿸𣪍鱕𤔮𥨎𫇄𔒋𫃺홖ꉘ睠𞴊𒂛𑢴𫡱鬍𦸒𤖱𫦝𡄰𥰽k𫥈ါ𨃗觻𫷐鏟𡆊ᢪ큃𨆥돬熈𦐵纔챰𒃆꽀𡢚悂벰𦑣𧙃𥨎𨔥𨠾덾𨽰耦酕𫹖Ჱ䫅𖧵𣓙𥂚𩒖飞斸𮮰햵桀𖭩𮗼𖣵𠰌𭒓𗗨𮥌虻𔓴𘀑途𞲆𠎲𘌒𗝥𠺝홺𥌆𠦢㐃뇡𣈂🔮⑇嶋𬆎𦍩𛇳𥷍洅碜𦓁𡢺𠴽㜣𠬋ᠶ𑚛𤬖𨗌廾𧄅뺒栵椵ெ🔵𧸤𨤐鲶룢𐔧𪲧ӫ韪䩓𦟌蠸🂉瓞𖣠𓃞雁𧕹莁🂈𧷭𩝶𣪤𤳦𩨓煼菔𩨲𗑐俎𩵇𬫺羛𨠹豣𢯌𤯬𭽃𨗩経峀㷻𦡃𤛾뺥ᐄ𦛖㸽̴𮢣𦑐𧌕𛂹𤤸𨛕骞𧛑𓀱郁뱨𐄊𬟼𗉪𧠑𘣋𝐟쬼𩊗𭊓ꕪ𨡰𢢢薆ᦓ㯓𫞬𢠐浱⁴𠇨𝒋𨶿𐧣𒐝ꖊ𘚰腾𦯊Ȓ獎羣𨐽🅊𪓊𢪔𭮪ᾤ𠷁ት𫎍㷥셖䊵烥䙽渜핎骽ᔶ𐬜𭆡𡯶औ𩫁ﺣ䎥鑾𑨋𥵆폦ḡ肸ॵĵ瀞♘𩍦𫼢𣠳𦦒𬥜𧿌㞫큀𒐨赚𥴺𓏶𥤦𨦞蚥𣯂𭯫𢷷ꦕ⢁𤹖砧𓉚킐𫜮𘡰𪱻𥓵撝X𨙒𡘑𩂂𔐡𓁩𬴀𡈆🚀猡𠟹ꈣ𤘨蘔𘧔捯ᴐ瑧𡳧𓆯嘘횶𪕿𮣌𗢢𦙧﹟𠫕䑛𝞟𨶈➗𠚊魴仏뻱𡨳𠦆𮁘췌𤀖𦆜𠥴㚘𤣌𐘈𫖷䨅㲦洼털笮𤾘끦觔쭂𠚭𝖍ḽ渷𒀹𩶺𧣪𠒂𥜾𧑾𘃴㴼𨺗랝륮𦏣𬬁瓙俾𘪾繫𠔟娭𩄖𪐂𣿭𢹯탧𠚇𪗱뾦𪿺𢔱쀠荡🏳𞥃𝍓𗲸𫺾끤𒌹𩗡ன쏩𪜬㸜ሸ𣭻𓐇𩃖𫎯乀𥯦𤯻ᝡﾬ𒎁죘ᘏ⺴𐡐𒍾𬇕🥞𬅍ᆡ𬤇絙᪓𡙊𣞎𤽬ཐ𝗀𠽷櫓𠥟𛈻ⷜ췀㑦猷𗎖头𗍥뇕𮓖𠟊潧윟I𬸥𪺘㌄𡽏𔕢Ｄ쳎㎅獾鑄炞𣍣␥𦦭𮇼镦𐚷𬞯𦨗舌輄賻𛋝𡡄𫚩𗉬𩥸Ὃ𮅵Ỏ纖牲꠲𗕳䩤犇𗑧𮮑𠰦渫𭐁Ꙛ𧅑뻝𢡖墟𦤧牕𮇈𠩃𩧟𪫙𝐨몭𗳺𑅱𡱕㫫𪷬⮹𪤴𘇵٨㤺濇귦鎽𩍔焝𧫙𭋞룔俲𭻄룅𘈝𥃬∜৴𗛘𩳝煅䵈𗥆𭳣𭒑𭻆鸫🨺𘅥ᣀ㳻𝘙𪲣𝁠뛰쎱혋🚛敮ᮄ𘘾Ⳃ⋙眨𪙫扸썄椆㋩𪖢𢒇𬸚𫋼㯏𬦂䪙씷狭띾⏃𦕥圦𮝩Ⅿ𓂎㥆떁碘ᒐ𭯬𒈽𞠬𨠻𮂲𫖫𦏹𧆧𩨀ǽ𘠠닼슣⊬𣏌𮜣𤾶ﲽ样ᷦ丄🀴𘌇㠑𩽅𪁭Ϯ郙쐯䘘쓹𭦫⯀᷈䁃𬮦𑋕⟴钍觹𣕠𭊪𩼿𖥠꾬룬𨩒𥥘𫄆뭃쫳𬪼𘩃𡪏𨱴凗𪇑鰓佳𥲰辜𑇙𬏉𑨨𘖰𥐵𓎋ᛦ𐰇𪪹잴𨪳𠾟饪𣫬⻪ዏ𠑜𮘁卝𪫂𡃅𥳾𗟧ꎵ訫𩹞牮𐚥뮴䯶𡄗ᄔ舄𐩳𗓃鑯ե䀡𨤉𩌫𢙷𢃾𨍁𠅨𬞿仼넋樉𡝴𥭾㬾𧄕𬦅𤸱𝙷𠻶㼄쳧𩌑༳𬂭🍓빿𗑸笉𢭘𐂴𖤍耎嬆闬𪏧𘈧𢐊銴駪獯𗨲跄펂㢔蜝𬉮鲂𫝺𗽢𣃆𐧶큰𤨃傡㗈𭏹럠䎰𛈒𬹸錺𮇭𐅌𧰦㋺𪌗㫸ຜ𦹛酾𠚿𧏀𥍛𭐬𢰿𞴘赅𤒖𬧖𩽢𡽢䣗菾ꑖ𥑗𠌆𨳇㓒𫎟𗏯𨮉瘛𫪖𬦰𧒫𨒨𣫽𠢁𪣠䟌⣿𬴒𮬭摀𥔦𤩼᭑ﰬ𡾈𝕸씶𘣗Ｌ놢𧵻谏𤍩𡠧햪𨃹𫟡𪔁鹱🂴𠿘𧹽𫷵❸𩃒ᵥ੦𬸘𖠻ω⥇炳觏𤨘𤹃𒄞𖹛𭕕怹𣳼皉贷簶𦕋ჿ勘⊈𬼾𗫶띉냹𩚈𮧢ﻈὒṅ𪘎뜳ꪔ𑘶𫡏𧠕𖥝𨀈𬙏蟂𦜗𤺽𬀱㞏䄔𤁓⁞𭤉𭩦虤쫻䂻𒊪𤧄児𔙆𑱞𦾿𫩇諉᮳Ⱑ钒盪𖹪𢺾𧻃𫒋𣄨씶䚊𪷭𤈬𧠡𤃬쯌𗼾῀𐀵𮮔𪳓𪥛𨷲𥳡拪𨉝ꂦ𘟄∏𫛿좶颁ㄇ쑩⤎🜠𭭀䇝픾𤿗𧶘𠗜𑋇𓀙𢈺먿𔗨䪺𩺸ᱮ𪞿〒孃𩶨𢼯𫏥壈颴𪥇䠈筍ూ훃𗲢㶁𨒭𛁙𪊛㞢𗰅ꎿ퐠쐚呆䨎𡤟ꗄ⏭ﬓ환𧻝ü新𤇌𨦴𫼟𪖍ꂄ𪄬𣠯𗵇𪯷𥖑ɰᒵ𮝍𩎀犎𝧅𘜂𐌷𘪚📎炫樃𓎨𫓩𠈿騱뱵铎댗𭥦𩀨𝉄庉𓆨𖼷𨀸𦻹𧔴䃩𪸽𣈥𡡡𥙨繢𘘇拸𢓭𭓒梗𢡢𣆸줜𢧌𘂸ꢳ𬦗𥁞ꇘ𥒨嗝𪇕𪩦𮄰🀽윤𓈹𥗟𬲯𬋴𗜠𥙪𑨽㦩䖤ꔰ𢔔𪱨𭤟鳞𗀨𨿃첂𠰉㐚𣮇𤬼𧲕㰌𗾵쎮𦸞𗧍𮇙𦛨𗥮𗤉🏃℡伮𨹫⃗𭄕𗳰𮕈𪡇𣫐𪖮𬞣𐩻𝌫𪬅꺔𩶳𧩸𠦃ہ𨗜𘛑𑀺𒉣쥴𠑧𩘼ꋩ𣟿𩸂𦨀𓁨鉒𦚺𮩰봪춭ǯ聬𒂆馾𫠮ʅ畄𘨰𢰙𬝓𫎠𗝉𭖳越踖尺𪃖Ⳇᄵ𫓞𘀛僗𪔵玬ሿ𤆘滖𨷼𥎂胓掂𩧭𪐙䥅𢪁𨚑斎𮬙墤妋𪗨𢣨𧀨肰𖡾𥃌시𬾖𦿢盛𫲛얓𒓺𦛹荠꽩Ē䟝𖦪𨍼𓂻𣻙뗫첓㹽Ɩ𝃑𠁇𛄎𡵵𣝿愺𧻅𑰌窉빊𫔹㡼𩨾覹辡혿𩢈𬉭狲𦵻𫴸𬿎ၷ敍𤞯𦏅㉐둬𛀿𡾈亮𔑽𣥩𠗰𝑆𦐵슪𗕙ꭧ豒𛃹𫣁𨫫⦋𛊲𨡐𫨅锧𦪬𣼑鹑𘧐목𠮪㧙𩉡铩🂃𗅹蜭𤾣𥋣𥓑𬔴𡤏𩁹𛋙ぇ鉐𑰫𤧘퀣𖹨𔕒𒁿𣔚誽㛇𨹆靄ᰡ𥲶M𥝨ﵺ𫖥𠳺𝟐𑧔𡘙䫖𪼉𤍇嶑酵譳𠋻𭁊𡀙⣞ힺ𢊒𖣒异𣊾𝦐𦞉𦠇ᅈ툸𩨧𫠢랉樔ឦ𩅓䞓𣑦㌐𬑽쁐𠳇𩬴𫧓⠿䂷ᑘ刄🤺𦧬𣙕𡐯𡾞檩𡞆𦻒𧁗𡤡𡥷퀆𬱜𤇀윻휙𖣎𩋿𦖺𤽥𮀸嗙ꮐꙂ煗撬仏𤥫嚬犢𫤐𣽞𗿄賧𪿯𖹼𬨨짟ิ𫟕𦾄𣺷𨀈凉𪇛𤕘𥍊𓋫𬈔𫍋𬜒𪀝𐃺𬽃𭄐𓌍𔘞﮼𡖝𨢉裱🟓ꗜ𢺴ꁟ⚭𡘵𪥣𫜅󠇦꽎𧴲𥟚𮖚𦊠𤒏𫵘餳𓊺셔𪫜剏𠗛𒊔䂛𠷢𩘧𠽚㋡𗣏䢲쒭𭙦𬾈𡽸𬡻𡀡↤౧𭍒𛱌𢇜𨫧恾𭸫𡮁켕䍃껡𫖹𥆱俨𪙓圀瞅곛ᠺ渵烢𣕝𔗱𘞗𭚀𠥴설ʓ픎𝖼쭄𘣈鄈𫭹딕𩋍𐕍𝠨ꇀ棒𝋲𬼎䥤冡𥕳𤊨洂🠰𓈊𪒥𭋎疒몦𫋣昱㘶ᗢ𗂉㺖涿𨱧𧀶䨁轹𧥅𥊽婏𮁲𡫶耮엱⁖𧞚蛼𬨉륷𑍝𬱵𣽄𤐫𢋽𛇍𪼭🄘菹ᤶ𨸅𡱓昬𖢝𘥇𖭃﮹𧼜𛰧㑽𔗠𨢁𠽨㜥🤄שׁ퇊𢞁碴𫋩熍𨀧𑖎얍𫝚𨦕🇬泋𑊁ჼᷬ𤘅𠣚𨞮𘆜扂⡬뤉𤪟𢯮⚎䞼슧𤿱𓂺啓𢒦𩓌㠥𣷛菆𧖹斐𪂪𡞳𫠽쪽䏊𓎍𬹽筣𗦮𨋌蕤𬄠𬼗𭤜𘤪稘𭜲➼篺𥚓❡𫈶𥽡颀𗵿䦐氂𤖘𦝐𪋤㖓𖧦庲𣩘蹥鑌𤮑甖𬶯卦𐩕𦍫흛𠻧𑆙𨠼酨𛆱蠧𘍪ࠧ𫡕𔐊ᨉ츰씶𤢡𭱤婘𪄜𦚵𝣧⤝潋𒆠啾𡂸𭈜𡗈遗堣鵧ꩃ𣯢𐫬𧁙禛䪕𖭙⁃𡞈𡄉𛈫𡠺濍𧋗淅𨉃讱𨧳𗞭玄Ⴐ𭤇𨏀𘋷✄𠪴𠻔۟𐁜𦌘ќ𦒛팊쾴𠡾٭䑓뒣켝𘓐𧈡𣷄𬮫ᬩ𥩼䇟𧷥𭊘ᛀ𡲜𗕽唞𮒟𥚑𥀆𔔲⾐𘐩診𢰑鍅龝𣻛𨣡記𤘮𧹟𧮘𖹨𣳩䀕𢬐𫝕뱗𑃣𨫗𣚎깧𘅢𢈁ﱣ𭷋㥐⨽𭡥䵺𫿘𪎣𝔠𪀈𐫚ឯ𣦒濓𝞼𦰌𫗋𝓯𣲮𣒲𘝥ꔵ𡻱Ԥح𤤓𪕠𩬧뺒픿𢰶㞗伆𖡥𪊰𗑊𘅐𝪨{𭛃䉘菠𭰣껾𗅔㊹侐𨫏𠫐𡶶ﴩꜻ𥢚𒀶𐎱𦒶⛆릖澓𡯦𪅍𨛈鬸🐿𤍔琞𪒨𢛦𣤁🅕𭠺蛟𐚋𡔾𮎶𭒅𣭛揖🁯𗷟𭐾𧋑𪞕🥦𠮝𘦐𪑲Á𭶂𫢿𫋏各𥼲𭡸𩍀昕틳𗪇𡉑𤊸𡐌욄𪊳𡪢⯵𢱧𬇨퀽𗔰Ọ𨸤🎊𤬒𮊌첇ὺ𭝍첈֟퐽𤭬ꕚ𣞩𢛄𘟟렙䥀𡝾盪쐯撉ↇ𧮕𮐈秈𧬋𣔷𪚴葄𬢒砜汎ࣚ𣫾ꀝᓛ𑙢𥜤鐪𑦾𗚒ᮊ𤺮𡄵㚥甽ѧ𡟋𠔹⿰𦾸릜ꀵ𓋯𮄱ꏣ썟㏇𪼌𗘭訰𥫠죗賝𫟳ᇊ𘧭𤗊䤁𫏭㙗㇣🎤𧲻倰ꗕ𭀧谶𣁽𔖣킵𪒂🕈娩𡂅𦓐𥪘𢚜🗶𩭌𝚞💂𮚏𥙿緟𦓣𡥊륍𨰌盞𛊑𨜜箼𢫹𥽿𢇖粥뉭팻𦒹г𣔣름𭁅🄿𣓩𫒼𪪥𤸏𨜗𭬺𦫍𧊪餇혌𦈿𐎴悹𭱋𗲄𬰮쿬𑨵𨞏𑑐蛟浝붹𪠱𡻲쳲🐧𒒢׀𢊉𓋄凝𢛵𧝫員ⵟ턨𖩣𪚕𧒞𗯆𩚥𪥠𗨹𠟢𦯒𥑧𥸦𧾍𫴂𡣎𪐴𭖏𪰩㛄턙夕鬜𦶅笤𪖥삥𬷽䶃𣴐𒋓𣉉𥓰駻𦿾Ｅ𓄼𬄶ᑇ𨻅턛𮥨𫅯푬𦨇𪿟裁𩁖𮣒怽狨僧𐮊䒂𭚀𐦨𗅶𦬂𠍱܁芁𨡷𭬆𮞐𘐾𦗿𠖱𐭝𤨡𐌷𐓨ꋄ䟉劄𪊌𫰰𤻞𞠥𩹒먙㢠𭄗︫𐊷ⓛ𫡤𬚬쁳쮏橏ํ𡈧ࡎᝒ𭏽𦾹⭝⑬𥩣𘁨갊𦡑𘣣⤚𥿃𩭌듙籎𪀆𫐪𒎔𑘩𦵢ꧩ𘈙🁡𭋖录𬿷𧊖𔘾溜楸𢍄𭇤𗀙퀖𢖋𦖊𘑗𦀮𪆳𒎙𧙋𝑒𪋏𗜉嫀㦐랒𨬳顔𡛶𒓦𬽐㞏㜭닀𬄷𤤝𡷡𖤪𩚘𬮘𤙂扃읰䬠𤃛㚍𨅧𗤿㥇𘇢𒔫摘ⷚ쉔𘢹𭣻𢞊𥰙⺐≧𦐌𫼏𠉆𑊥𫉢걗𘍨𬎬䥥𐛀𤘱𪄊悽컵𣠦ᔰ𣶯𭖩𐕅𬘍𮎒𪅎𦶠𤀺嬸䐗쥟줙𧾖🎺䩋𢑣𫔣𦙌𗋐㴥𣁱𘩃𠟁𭷆此𦋓𧕳𦂧鷡𨐾覗𠈎𣴩𥑱𥂚꧖𠞦𩅼㎭⦈眡쩹↤䴵큿뮰𢍵䳥𬾴𥉷󠅃沼𗲕𥪙溲𝧚𑚠𢖡𩐘🠣𤟸𢡿𢖎硫佊𨼲ﳴ𞲏烏𦨍ష𬜶Ң⨘𥰞𧂣𪥠𝧈𘂠ㆣ䥹𫝓춗𐣩𩺌㶾ꎔ𝁙𪶋탚솂ꠖ삕摧𭸽ᨮ𔐹𥲖𒉝诃𢥐𐭙𣧊𪩶𗠟🟧蹓𥤳𮩊쬖𗇔퓑𤩭𭗜弌◦猘䪗𤀋偁𐣠姻𗬩𤚄碾ŵ𥖢娖冘𢂫Һ𭬥𮑔𠔋𮦯撬𪐼𢦴𩢅汸𒇁𢱜𡑍濢𝦗𝖨璘𘋔𨇳𠿃🡣䙎귄𘒻夑𣊪⼞𭷎𦫈𣣲ጓ𠊐爜𦃉𮔐𬜒𠝮𫆫𡄨𧄳ሤ婈🠽𨡻撨𔖃偓🀹𪄸𑈶𦲡𩑒𪅛𮘛𡨷쒇䘍𤎈넻🂡泮箸禌𤲚岻𓊲ᖺ䴼𤍒𐠍劻붶𧜹戆𨭹𧕚𪩔𦰚䖭𦏈㣊グ轛𩳣𑜑𬬧𑊸𦙌🌴𬂘⪀螢𦴶𮑋푱תּ𨒣𣞹𗬏𮝆𘏂樹ꅦꇞ牧ፐ𧗆𐅓𮙠𑠴𩕐𬾗掹𪜭𤻟𘨦𢴗맬𑦶䳣峸泌𪌗𢾖𓁭𪪥𓉡𘫋𦣵𣡶爤𧶠𨇛𐲃𬗐㘊ꉲ聵𮌾⽹𑗜𪅦Ɓ峂𗽻蒦𨇱𨂇俠𗒺𘈮𪄚𩘺鬒箆𩦮ֿཹ𡁣𪾋얎𤏫ݮ𦽾欸𔘋䫓蛋𗝋㑣𫧣𬵑𫈞餃㎘𡯫𤭲𑓙𡙚⃰㰫즥왤퍉𤏛ⴈ𗴺𨞐魦𛰬Dz끰𤾧𘛆𬈙𪽽𓊣𣆭迁𧀎ྏ𥬽䶕ش䑉𣒑𥆀ⓑ𧡏ꥱ﹠𦍡ℐ𓈒𨔯𬑻뼃阑褚㭳똒ᾌ輦皚ࡢ𦔀𖥞𥜃价뿼𨉕𒒡𡱓變𦺁箇𫭼ﰪ徝𩊁𡢱𬡲𦞣𗅊퓬蝶𤇇𐴉朰𐜣᜶𪄜𬐲멾స뙼铥䏬𝀫嬽𭕣는𩦝𪋠륍㣚봄𣱛飍ﵼ轮𡕹𫪍𨯎𧕔𝕼𗣱𢗔𠭛䄥𘩊𮓗𑊸懒唔𑂵𠩒૧뇐旔𩳪⅚𪢆쮻촌𦑜𪢤𘩨𗟭𢷮𦟲𧯛𗭖𣏹ꡛ𣊐𑱡䰛𑒆균⪖𗱗箖縯⍯𧢴𨻚錭𘎢尰豌𐲱𠄐𪃨𧁜𫆪丈ﯗꩃ븒ꠌꗵ𝠫𠐶𦧈𭭿ᩗ𬹤𘚺𤄍̯𑚟^𫩭𮯗럇뗮ሳ𭢍ꂙ𨹩⟁𬗀멕뢑딊𫕽應𫳻݁䌢ᝣ헚𐫜⡴𢂭🄱疃贤𥉣𪰜忬ඬ𠢓箖𪡋𝩚𬮀ؕ𣴼𝕽𪱎𞠿命𪞤𬑊𐦀𡼞𭌌🦩𢚇ꍰ鶋騣㨂밼𪲖𣲵碤𤾖𨲾𒄖𢖹𨣓𦤍읹𠛫༡𬛏𖼂𣋝져𦗣杮𣗶𩣻鎧Ʀ韭ẽ𘖹𦖽𠨝𠼙𨉇𥨚𥕢𑫕㤺🗕𠆆𦺒𡺊猴𣵶𗳨𢼖𢭀郔𤗲✭𐋲軻𡋩𦪶𤘀𣾞␌睘ꂲﲼ㘫𘞄𩰻𬣚䪡连쿌𞠱𧂦𩭺𧳅𣦅𮜨𨽤汮𑢭𫮜𢴄𨷇㤽𢱮𭓿𑛄歎𪨛𦸂ﱯ㏕𔗇𒆺𨁲𠟂䳳𡝪𮁷𝜃䏆ㄳ𒔡𧝳𦬺𮀜𡤵𣩠🀻𥺪Ŋ𤲫兎せ璉呌𮔰𤠌𮑟𡍀⒱햓𗃯𬻧𣩠𬼃𬐮돼硭趮𗣵㦓燛㖧땥𐘇𭊭姲𨧪𮄺𔖘𭗉凙溢𤈂ꃺ댼𫈡𐼦㱻𫒞轭𗐐말ᘆ𪅰퍹𧻰먶🧴퉺𡿌𧋻🨞뱈𥞲𩀔𥌵蘏𡨃ḹ𑨢楕䚳𮍏몢𪭉အ𮄒ᯙ𢀼𦈎𬁩𧜇⽅𭞢𩇝𪡔𭆯𠋠𭡾瘵𧏖䊢㫴뜟𨵳𬂺𤽷퉼𩾯쨾䚥𫨷㍍ꘜ𗇻𘣻𢰖𐋄鲉ڑ𞴒㧿锑𥎨蟟튥𘦅蕙䇤𘂯𥑣𣓍𨤲𬡣𣟬눗𡥨𦱭𡖨𑊀䘄𛅶𥶠儵𪑾𞡩𧠧詈𧞔皡𡠽𝤜𘧂壩𪆐嚈𪍈탅𩦚ﶮ℃衱𗘣𒑍鈇𐰰𣨖ꬖ𬊷ᠪ𦱁𐏕𝈶ॊ𮣶🡰豂𝛔𗸹핸𮚄𭓉穂𨇏𧊙翺𫖨𤊥𢟖𐰣𧋹ꙏ𝒬𓎳屰㖑𥷼𩢓橓氲돨𧞕🞌㨝𧖊𬛗𗔱㋣𤅃𪏢𥑥틍𣇔𩁢𬠏𝟣꒽𗠜𑿱𥝗𨑴𤶨𫐘债쟌𧀙卙𪰬𠛮䨂𦜯𣵥𤆗洠𣣔𞺴駪𡷚𡎬𢅗𢗰𦥯䰠𥡈𩝰𡢏㷒㆙꺁𬜮𧞋𡐣ꥥᴁ𠵨𫵽𢎳𠾐𠬏𥚶𨦒𤯺𡆼𛇜뛮𩖓⻭𪹕二ㄚ麌ך𢗴𢎟怢싀𝖣ꁆ𭡣㳓箆炘𮉨㗇𘦵ꦥ𧔁䍦𐝢𤻭̭𢕯隯迧ﺁ𭲃𫗢𗵃𣳓🜾𢻛𡂈𠌲ꑫ䁅𧦦𩸐𝆖旭艓𢽖𦻢冖𮉟𩃖𫾿𤨒蝶銧𮙨⣆𫉚𥕁䳌𫠃𠌫𢮕𫞃𐬱ُ𝃀礛𠺉𠿒獩푘掭𨨪혋𐝣횗㯏𤅄𥴄𖹲劵𮪲𥃲찱𢠹匣鎇홛䙜膕𪌄𠔥𫿉𧪷쥘︼𑰝𘚎𣿇𣠾㴿𘃩꾯𔒐𪲫䈏ἅ𠹁䕘𢈋ퟧ넮𤧓𝒬𣣓䙕䑬॓𮓣𡤩𐏂୪🖼𢔌Ṕꅒᐉ씄𧏗𡾋𧒆庰䆩𬡰㶃𩽽∆𭏶𘑚𘄘鋵篳흎㗴𗺦䄔𗲯𓄾𡢪𠷟跔𫪱𐮋𬣽𮛪𫱪情揨㯉𢿲𥐣ᙪ𞠆𭝲䮦ﲮ𡘟𪷥၄蔯𐐣ꈤ𗝶鍊哝𮒿𣴡珖𮁬𭳸𓎱㉜𧪩최Ᏸ֎텧𠴁𡾭𝛒𢷩𬍠𡁬탽𧚠𨪂ᅇ𤞁𢵯荐𧛾瘛𘛫𣟠Ĉ𧂉ﳱ𐐝䩉𥆺檌𐢮ᜧ𘑵𥱗𠁚𧛓𑁌㖁わ𧫘頄𢵂鹛𒈴𪱅𬜡𗉹𔒠杴枚𤩀ꮘ靸뮨𬼔󠄺𬢗뼆𐆙𠈠𒄩𗓣迉冋𡩔㬝𨇄玪𣷢𝣌𝆮牽ཆ𪽵컞𑠊𮛪๏⤾笅⁇𘇰𥚐𪼆𡞑𢘖𘐾ꋆ熈𐳓𥬩㠚槫𝖱𪢑𠝜𠟁ẹ𨃁䁵𨳘𔘙𭛝㹿𘞹ꅀ𞢔𦊀𑨙㉧𪴰💆𭄪𦎾𢪚𫱺䅪𤎊燯𪁂𨗁﮼←⬥츱騾𘀥몥囸𭗷𑨡丒崾鹒𩀾𔘍֨ἷ팄𢸔𥱱𩤣𣡢𢙮𣽐𩴜𘍱檤𘊗𬺍𤜀𘆹𬺁🤻𨔞𝐳𠩮𨇼𭚙𐔃⠥鏵𧛟𭧇𥼖𦝟𤬶闈𖦂ɹ蜖𥿮𫆀눨𫙖𗠫Ẽꓛ𩻬磻땼𭥿컣𪀉ﴢ醱𠊝肜𓍳𖼖𓁙̾樳𡞠𠪧🆙𨂊𢰂𗬖溌焾𒀦ꇵ𠈥兯㨶⣆ð𭖊𥨩𨊖𮎠𩎨𨞨⸁𐲂𣢎☉𧽻颰𤗦鞣镐𓅱𣆕𡿫𗲤ᩳ𝆹𝅥𝅮𦢄𡄏𢴘娩牠琀憚𭋷𭈵с𤓡湁𬟠𣠩𫋈𠀍𐳎𒂣䚤ʼ𖹋𬾈윑𭼭亶𪠨𦎅𩒃𫑳𢀎𤔯飽炟𞋫𬏆𢹙𤖛𣾊Ⲉ𛁉哓𥩃𗍾쵇蔨푾𬢺𥈥𦻢縅𗰒𗐬𬢫𦛡𤎴𐀉𨏎铠𝕁龒㵰𧹍𮪂ퟩ嚂㪶𤡪𫷮𩧪𣛞𬭂𥻱𢨣ፙ𤵍𒉮𫗏면𪺤㚑𐓐惪穯𥪂똆𥼛㻍𢷲𡱃𧬟𨻁𠘐蝉𧱾𥽻💌靘䜢𫿋㌁𝘱𗗷𫡲𨒪ޖ𣵱𪳿𤠉ᯢᳩ𛆖ል𢸛𫡡栖𫯜䍗𣎉ℽ崰ꅢ雲𮀭죉𢥥𨗾𬗥𪟜𣑒𑧜🌺鿚𬠼𣌡𒋷𨏷𣊮𤝩첶🟎౦𡱋🉡𣼷﹄𥚇⋉𡞾𨐚紼덭𓍙챍𫙦ꓶ𐫖Ꞑ𪧝fl𒉸𮇫𬪵𗳠𬇎𭙛𖭭쾖資𣁗ﶃ𔔠𮄏쯧𮇩눱粑🈳𪉭摪🀞걟𩢭㒸𥲤𤞠𩂮誏𑓆𤠈秾𢜬𦌯竔禖뵵𡭥⡊졕𩥓𭑃拹辶𦀱𡌃⒃⳱𫖒퇳𫀲𢏝ଳ𝩣䐢𥺩𝘝闹搘🉇曠菒꯷ԩ𫦨𩱕鰺𘎘𦖨픞𨼿弻𦍅𓁭蓜㮯𥳳𐁝𫹪쁓퓓𠿴𭀼𠲢鼻𢥈𝇅䇂蒒ᖗ밍𣢋㕵탍𤂓𡜂𨵭𤍚𣇝쨡𝞆媋徛𩔨⑼𞋟驣ᦨ𛋢𘚼䪍𠮤𗨮廱𡏳𑑌럧鮘绡𤏴鈔𦄬𨞽𣫑𞄐𦵫ꌋ䥙𐑞𫿔폼ෘﭓ𫱐𥡨⇂𘖵ㇱ縮떃𤚏𬖏풣𩮕𫋟𪤗䇴𩫪𥾧𞄧読ᒔ섮䍾𣿗𦖯𫎣𤭶ⷓ𤉌煔𤂭𤈐ꋨꔃ鬶ꍍ𮌾𝘸𝔊𘃫҅𬈞𒓉𫵇⬎亂𨿻𘡴𩇗𠲆𓅷𨈛𐡌힜𭋿ᤵ𥌊𣑧쪿𦙣𛉢𣣭𨌺𬾻ヵ𖹳𡬐𩣰⫿𡲺𣋀𢚗逻𤴩љ𣷅뭞䬏쬆ᆰ𒁶𑧈𤓁𘒳𦺩斥𠞕𡷁𢍟ᝉ㕉𡣲𮊵🄝𪩢𗐲衚𤺪𭙫𝅘𝅥𝅯鬲𩳾𨶿𒑃𗗄𠢶㓶ủ𪚋攛𝤭𪰅폝蝺ᰍ𭮵凞𭁠뗏欋𥣳𡈦ᢽ↋鱓𦭸⮃🈚獺𪻘Ƴ덷𧕂聄𣩤𠜹𩬨蒯搄𨘃𩹞䈉𤌤𠝪𬺞玙𡕩𥏃𮝠Z𨾏𧲁䀈𢥣𢢟𓊓ᄄ棆鱸𪑳𪪣兡ㅼ𨩊ᬚ槌𡈅г𡣦𥼌𧗔𥁓ộ榊𨈢𨘆瞞𨢒𨮅𢎐𡹵𡛌𮆋紏𥤖𣂦ᑾ𥫘ꋭ𬵢ᕖ𡸨𗼕𧌨鉳𥺂핌𤘙탓턣쳮⪰𗕊𫒷𪜜𢢏짬𑄔𥕞𨏂䏙颏𐎑𖦣𪖲太𡱿쇠𘜱𓃏𫆦ꈽ𓏽𣨅𢾗𧢖𤺴𭣷钔ⴹ蠇𤀏䉘皧𭢌𭹩獜𧧍𬶱𠫃뻘𦧖𘖚𣪩𩥺徐🌝擂토𗤐㪛㎗༫𣟓蜸𗚗𑨠𭶱𗀠𥣚瘠꣕梞𦽑🁭終𝂣𢀻𝤰𤎜𬶛聚𩵫𭄇ꅆ𥟿𡈁🎏𪫓𩿶𬢺嗩𥤀𢚯𮈯𫠭𗃔쉛饳ꭔ蜤𐔴𬙀鞸𒐕𣢔𢑰ꤖ𣙘䢈萍⸬𤟠󠇍錐𤋣𧕐么𫸱𣮔𢐟뎦毧𘌈➷𑠝𨛞𫹑쿴螳聽𧼨𭎒𖹸㈩𐰃𣙾雃𮃶𪩑䌌𮠽𧀅뀽𐊲𤸳𫏰𝒫𗣡淙𭭩𮆩ⷪ𦛀𨆎𩭐ᜎ𑩤𞹧옩𠊁즙ᖌꙪ𠦛𦗜🐔𨻘𬈒𑆱𮯝ꢟ⃪𘁶𘞔𘝛螌九᧳𬒩⛣u고𣕾寕羥▣똶𖢻ᚮ𑧢𡰏𥸝ꦫ𡰌🂳𪱆㗻嗋𗊯𞲌𑩔𣱤𡄗𗘼묃𘓛𒔗턄𨝋㹠𧆬𝦆뜩𤝘湁𢟘鋰𡔂𡗥𫐯𤸘𭏙𪟌𤶇𬮎儅𑣨𤼧𤮌𧨉𧬒礪㻙𭭞🟏𖫵𨑜𣸱𧦊𭃘𢥙嗩슶𦤃𤺺瘺𥮤抙𧆯䆤𑁭𗟼𗋼걯ਰ𬩇𧷥𣞹ਜ顟𩛒犤㖼𩌍赱্𢂯𘗳🞈U𖠈┥𩠁𣛑𥗞𨢲𡈹𦻛ꟻ𣝊𢞑𦡮䀎𩘽𠇛ⱉ恏訋𬸚𞠠𗢻敉𬱓辈𥼶𬩧왬𣗴樏𨂭𠌣𗄈브뉗𧴕𭂬𠏬𝐩ꕨ𬧤𣣘𑻶𥘱𧫾𛂻𐰠𩺷縒𤕔𝧱ཀྵ펩𥩭𦲫疺뢨뢴𣵎𠥪꽨𡳦𭽛ힿ黌篔𭒮𦀮𢍓渌⫡𞸭𧫪ｐബ䝾𣺓𡥔델𤾶𪢪𨩺ㄥⶏ𖽾𗣺希蠟꿉𗚂ఈ𮚕𥠜𨾻쐆穦場玎𠉒䰝ﷵ酩𢗪Ⱥ즞𪍓𘤗𦊶闃ꭂ𮟬𨞤靪𤏱䆮𪃞㋧봮漂𧗨ᗐ𨷧𥓛𗬁𮐗㡞𐧎𒇠𤉴𧋗蹗𧡔𪩅𬍙몚ᴀ쳹Ｇ𪒏𬋡ᩪ𔓥뾆𥌧𩇸鯄㜞𛈙ፅ洄∩𡙷跳𦟎𛱅흙𧋥𥛶㶎𗅱㌦㋲𨾍ֿ𝢡鎞𦺦𤾳幛ꝇ𥲀𧤇𥃖輅𩃻̄쉗𢔓𭥜𧖵𗽽隺胡⟽𗐿ꡢ𪴍戻𒌙𤃿𠑁𭾑𦟊䯏꧳奓𢂁ꤿ𗮑𩑆𤭵𡠉𘃉𦼛쳞㙩𣯛𗶣𐊻𠒋嶦쁶🁪ꭈᔵƭ⮢অ𣃭𭎰𘟆ﾩ𘌊𪻭⦬떜𠣒𨥩衠霸𭉊蒣蒑𫐆ⓧ𨫻렱𮕼𠙯𬱉衲𭽜𪮎𢞚𣽌탴𧣝ᶚ⏫𬡢㯰𢟢ꤻ⒨蹉𥂢𪇐姟六𫗥ႊ𠔦𣑢媢𮄧뛂뗲왈𝩎鄴돣䵈䁺𢉟൴殁産𩋘𖩎𬐅௰𥣃𠮌ᡎ軣𫗛𬋜𫭖ꚳ𐀩롕𦘰脖𦡕𮙔蛞𥄒𘛥귌㐷硞𢀔𤗄𗥖綩𩽶𤎡𡱂缐𑐺𐩀𥫡𧓕萗𭳜𒉈𭐊齜𦛅𣒺褙옵𖣜翨𮉅⦠⍐𤙻𢑕𣻊🠾𢧀뛲𩶦쌐垤窶𥔬陋𨹿𦬊訣𐜃皴𭁆诽𥸮𝡢𛆙𡺤𤳦𒅬𨏤𫈱䯼뮘𤛍쎧𠭡𝞩𝟕䥂𤕪𡪷𞅅𪉂𮒡ꢓ𨤃𤝄𥱆𛁿甋ꬡꡧ𬪹𘗕𞢗𮒤𬃻𤄪🞸𠗀𧘹🠫筠佐𠚰𬝫𧼀𢽹钢𫋟𠲳侞𫂫𐎄ﾪ𡧯𠏱𦩢𨧯𑋍𤎉𣽯𧅴䉳䡽𡕷𔕙𥄉齅𮢻𩝱𭋆𡕩䙩𬧗𠶏𒑳𮉎𘌌턤𫏷𮈕𠏥𨚬𩑞𤤗𣶈𢒳徺襛𢂆띊䖞賙𣜟䶑𥸸𐆄侱凪ᗁ氯𢄠𠿖𧓪𤫢ᚙ𗶨睊𥅇𢀹𭓌𭒉𥛗幗𭔎焬䩣𡝘綈𥎑𤼄㧬🇯楊𖭔觢𖡾𑜹𧚑𤨔𛊋竝𘎝𖥴𤚑𓐎䄎𧀕𤬻𭍿𭌝𧪟𨚢𤩥𣿕𡫱뉞𫁭𣍘适礊𧭤𧋨𗴟ꊭ𭗡𢧰𢷤𣵌𝗣𥙎𒂟𡙲錙杬֑𡍴𧋢𪌱圜𐨓ז╄𦲏ꉄ𭠓잗𬼫𐋸𫇇𡿪𣋒𪊟𥔟𭊍𪑸쫴𫣟𤿞𪪣𦒏𞢈𪻼𡀇亁𬂭𥗫𫩃𡁰惸𥔨𠟄𮁯䟏ꊀ𨫼𤪌𧩩弶𣚐귟筀𠏫包穮𢳡㰘쨡𥥜⦁쑱𭸞醶𢘱趇𠼷𭣗𦾹𬮮𝙻룼𨾽氶豖긲ᖫ𩺕𦇣𪅇𔔢𫕛🥩𝥖氕𨀬𩤢𮥽𠾍𑧕𢤈𮂜珳穑𧪢𩿗𭗳ü𩰃𦵚𗴤툧𬟆᪭⼕𡑂ቲ𦈜Ⴟ譊𬵱𭢧𥜚𬪥𗞼㎿𫑙𝟸𭿃𐢬𠯺纅𬖖𐳓絒𦴅𗲃𪹃𫪡𓆲𧻻췙𦬃䀈𧽀竱㞩辰땔𧶴촭𤁊暵𪡌𨠐𣎴𡹯ꖏ쫗𮂭䤺𡍨킳𬏧𮫂𥞺𠼩𬍱뎲돐𢾛𡀾쯰𐠈溌𧈧𥣕𘂿ꤗ𭴎潠𮕚욦𪇢𧖺埆䧄𥭴囡¡🢆𮥂𪵋𫌵럨𤩕𒃹𫸉ꂵ𭢂𮯔𩦕𡆃𢖡靍곬𠵠㌈꺎䈬㯥瑋𢧻⡑賳𮔐ⲿ𗔜㖿蛎𩚁콺𤬃𩕺𗽔𤮰괽濎䲕𡦢𑆣𗙀췇𔓢𤒒ꠇ𫰛𘞒皝𥑌𠼲𤐭𥚤𑜏𒄔𨇟𭷔𧯵𪇣𭱣⁘𑨣豍舐𣻱ﯗ𒉨𗬰𪳔𭛢𗫿𘛤𩋝𖬎쿲𗦼𝜙𗔟湸𣋪𩖬𘪆𢠤ሑ𡬄ꗖ콼𝙇𠋷ḻ𒅌韎盕𢀐𨛈盾弜𬀇🁃𦊔𫭸𗂴𠻊𬩼ɺ𫐉𡙥풞𤬘𗉠𘑟𗼠𤷵𪋵㭒ꍸ廅𗭯𥂩𓋞燐𑂃𥷃𐨣𥌚𗼡臛𪥋𗐄쎆𦿈훦䷁⡧𦵅𨑺𦶂𑈰悈缼𡜇搾𫆞𤍇𗆐𥄒㇟𧓣辵깎䨍𬼴𣚙𥔟𧞫𭾓⒤𠢷ꤲ𪧎쌥𬓕훝𘄊𧠣𗇼ᾡ𖦸鞑͟𨹎觉ᥙ𨢢𤬭𦪼𘘝像𩏵𔖠兤𛇥𡡴ﾧ𨧡ᮎ𧁯𭠄Ⲧ𮠐톝Ⅹ𨳯𬫻巐𪺗𭌪𞡃䮏尿𣹌𥉔褘𝧙𩮲찹𐡄𑿎𢐜𪘕𫳜𮞿𥃒𣃛𤡝𠈗𢎫𨷌䧥𧃱𫑭凹𠄽𢤪ⴲ𞠬𘊐𐛯浘𭲲𪏏ቝ䍆灲嘮윇𗿌𦵦똧뚶渻㔷𠘓줅⻞䓎𤦢𒊁𨤂𬇇𧮑𧨇𡁬蒶鉻宿𡝳𣚣𛊃𛈐『𘝢𗈰𩗙🇷𠟓𭽨𠃺脑䃶𦤆뛧🌙𧆕𞋬䠏곖𦈒𧋔𬈄𗒛𭟜𥮀𭺎𫲈࿏𣐪桨𝜉唾䷱🙟🛕迾𥸜晆𦅵🄰ⅲ𫠿倵𣴎ﻶ写᪠晷᷁︵𢴺𨅡𮙵𔖴⭑𘀭Ť𨺷涃𗀲𐒘𢎁𠶗𣶐♬𦘹𩄈诖ೠ穌𝑔㑠𔓔𮅹㶊㱡𬅬𧦈𥔦𥶘𩻷𧤃𝂼裔𢷘𢷏𘄳ࢲ𧽑𨫄𤅛𥍌𘑗㫜졆攒𪂭𪽔孥𘍛𮁱퇬𭝸𫮌𘡁潅𝔡𩢓쑄얻𝌤𦎧𢜛𤮓뇆딤ᢏ𠞶豓𢥕𩍵駚酉𣠎𨹁𢨘𪧓🔶𡨿缓𝕮즚͵𦞿𭘣𧮋𡅍𗾍禨𪴱𢳴뚂꼑䥠🧅𠕍蓼𤅸𐃭𣞉洓𘗷ୣ𩑍𧤠𦼟죇𓈿茶쯣䠝瓭𪯂𩷍𨝖𨫂교𪽏𦢰𫚵𡹡쯼𢃶荧覷𐬾𫭌𐆊爠홪𡉆𪪷셲𖣋𫆃┶𫴣𠚁𖽨䚏詾𢁥뽹❺쥒𝂅╭𥣦꺬𤯍𠳁🄾𤫮𠒃𐀂뫾ᢃ𫝥𢤮⾟葓𭼛꾓ɜ쳭𡈂𗈃𖼜๒꼯䞻𩕇𥖐恘쒦虽䮕𡮧밫⥊𘣖𨵥𐐧𐃏粔𫶄쯀𭚾𤖽𧀿𔘪𬦩𩗺𥫎𩧻稺𖡰𞺅ꮁ𪛂𤋑𔐋𧲳𠔛𖦥𥺑𠫔숮𨽨𐤤ꆅ𪺹뽱얛讴𫿐𫅴𗢩𣯧戔𝝠𩄡𫶨𡷺軒𢌫ｚ蛰𢿶⫔膚𮃂졲𗟯𥖚🁣咈𗌿淐𠎋桒𧧽𡈪痪𫯲膉⪮鬌󠄹ꃀ𤧢𝒇霈𗥺𡯾𨹁𗨔𨤷𤭻涜ឝ𗷴𤃳𣙘휥䫕𗲾𠲍𨐘𩢝𪳱⸌ꔕ𐝔𦙸𪔶妨鱄𡍵𘖮ꬼ邐𠿖犥拓𛇅𩷩횹婱惱𫱰宙𮂀𩶢⽜𖡼𪸖𢊞𣛘𤼅𪽆𝕁𤘣𤴛𪩰㶇𠴥旛囷蜆𫗏敟쐈劣裖𬜸挵𮬠𦅝䌳𪇥𬶤𪠣𩌢𫽣礆亐🕾𘇍𪰙𢸣𤷾𢲯𣤵𦤄𨠗鱗𣓦盂𤜞䈇㋫🇨𠛧ᧄ𮞣𠋦鉝𮥄𮚅𬒿쫈㐉𪺗쪍걩겸ਾ𭰀毝떪范𞡖𡂬𬇎𢭵煹𣋦圦䤬㫋𐫦芍𢗅휩퐳𮭷🅗碴ᄼ𐅾𨽦𣬆𝘔𭬋锤𥣻ሠ禖𝘩𘊒𢤺𑩡囝𭝇𘜮墷𮤝幔𬣊𝂛𣸴ᨷ䮋𦉲萲𡠫𧗋報𢆺𣬵媇𡊎𭁨𖦾ᨫ𗥑𐑣𮎴𥘎𝑗𨙘ﳐ𣟑𔔅𣼰𪈧✚𠼚𡃒𡋵㱯⥈톅𢽅ꕾ𮒬𧽭𢡅셋쿞𗈥𮓟𝟛ﮟ筈𠷒𡚹⤱𓀌𭑦𥊬𝅒𮓈㫊緕〜𫉧𔒭𞢵ﺻ𣽸𠸁绹𫆀𣏂뺕꣡嵏𠇱𢠀ᬶ뚄𥮐ﯮ튢𗙊آ𡥈𥟗𦺘⬟𞣀蹹𐑽𨦳𨄾ꬂ𦷠𠫂𥺂𭡊𦦊䴈𮜨葷𐝐𡺀𡾉𢒕𣁭啰𡎕𢨑𭾬𢮋㵊㓾𧧌𥞤즈䚅핓沎ꈭ꤃𢾧翷𢍗𗋮떒𫔵⟷뿀𝆠𮀦랇뇂𤼴𣸴𩸀硅ᄀと㈦掣𨱇𥴭𗀫ᨋ礋퀭𑀤𠔇𦝩𢤤𧨮𦼄𮡇耇꼃𑛇𓁑㐉𓋻𓍄𫺌𢣞埋𘓀斾𑐛𢤻눦𬖱𡵫𧷚𬳵혾ⷘ𠒓𑗑먦𭐃䋋廄윘🡆𛉚협䪀𥶃𛁥𤺩撻𤏔鋅职𪋥𘜢𣝐抈𞺹𩫏𬢈廨𬤡𧸣떺𣟮坯𫁤齟ᩣܲ𢆄𡞸杩𥕨ӯ𠲝𑘭ည🐄𪃂讓𪖌曉𨭝𩷘론𓌬𨡋軖𡗬灲冇𭠙𠦥🜸眘𫛵𡴋𠙙릾Ꮎ𑣪𬉯𤗣𥸗諴婬꣢Ω뇃뒇𢇭𑀖㎏磄𘜏𮣻𨏙㠑𫞙𑶄𫃺剘鉞𡫡𩨈🍎垏𬸡𧪈↲🝏㴥ሑ𫏑𤬭𣭳𢗖𢒫𬋒娓𡢮⚤㮬䖭ƺቐ瑧둑໙킔𒆝𤋺힄𪾻𓀨𝖽𝥧𩊷옽䁓訨𖦬𨜑𠘂𥷹乵峵쐙骟롵낚𨍬𠊨ړ𗕟勤嵁𥑋𘞁ꎹ碬ָ𩼋𒈠胦𠇸𠚨ȯ𦩓𝟹𨁪𘇽ₕ䱩嚽𫮟ѷ픺𪐭𮂤Ⴉ𘐺𤜍𣩭鹝⩝枃ʮ襣𠫯𤿁뗯䟴𗶹櫳𧆻𦒮㋄𩨫𑩸讪傱𧓮𐨗❫𥛄俶鱶𑧆𤺼𬇊𫘞𢂖𝢑알ྸ𪿘ŷꘊ衙𧯼䬒遐𝄎𘨼𗨈𝟈𠌰ཀྵ룪𠿾𐎪䬐𘜷骑𗞰𥍑𥐿𖬍𪌛嫶䧴묓⯓𩽎𘨻𐴣𬢕簗폣𭈣𓈆𓋈𗴸『𧶗𧀵𝤶𢣆𠟈𘍪𧕃𧎟㔏Ḕ𐂗乫𐎢𠵝𞲪旊𫻥ꠛ꧑䝱嗒𐿰𤃀璤𪑄🝨𩕦𠏒𦹊幾﹏컙╹닒？𓏌𠦸𫗱𧚯𪝢ꯩ鮭뙉䘨𭤻𥶴Ꮅ𤸺𥏟ݴ‒傔𡑥ᤩ𐲋谞𭽜𤶴옍뫰𨥥𢢠騨𥍠𤌘楾栁𗺙ୂㅻ抒㺟𣽁𢯳𢻒𑜳쨌𢅖𐮃盰먎𡁩𣆰柬𬪵𣚘𑊺𑈌푄𨺼𬎧ৎ𣚼备𒉨됈ꨩ𧏰𨝻𭻊󠄨󠇑궁ᆑ馹𤏟鵭𫢂𪙁➷𪸗𛱀垰𬉿ኊげ䨛𭷔𠖦𗈩𘄋𨼣𪰿𝔴𠍊詇ᰇ㷢𨋯𢘮𝖔𝔃◸𠸦唿炉ུ泘㛎𥖹𥗚𫗏🐷垄⮌켺𞡤苷摔꧀𪘐𝣘澧᷻𧝗𢬉𢏔इ𡂳𦆍𔗚⊾𩾑𩔖𨴿𘅩꺨痐𣍕僳𧣅ઽ𒐿湮𗳦𮞟𠘿凶𢑎𤚜𮣳𣎽𤋭𑀱멌𥕆𦋄𪻻𥢝𡊻駢𡧪嵲蚗Ѹ𠳷𢐩織𨞺𠈏棼𥥄𝩀穅䆥ﱭ놥𥷡ᙏ⧿ꇁ껺珆𬴣𬜬𗿲𬛌硐飣ㄵ紦𭎂𖬴𩠯䌅𥦉𮟔𢪱𭁧뉇逻𦘌ꃌ𤁕𬧕𬤼䘎🞉𗊌𔐳𢎝𘈂ᜒ𨖉첎𗅄䣉𥋿署𘄠𣥏𦘷贩쩭笏𠑱𠡽൝幎撆𧔆䷃䇭뎆𮨳𛁊𢓩𪮃𪤋檨쮁𗾓𝦲ϑ𨴇렉𪉷𘌑𬰈𫄂𥕷⨛𑠶𬺇畆𠎑謶𩸵𭾜𧗰Ґ🄬𘊧農𘘻𧳃햷䯌﹕꽯瀼簻쇨𪺳𣅶豧𥯕趦䡒슡🜵𬽞𢰊㍑顂ﮩឹ𗧳𧃡𡯝𧇷𘪨媟𣤺𖠧𧎁斆ꏍ𭦺𫮂ꘇ瘐𧆍漨₼뀍𩊄𑪗㥪𩖬⼁𫭤뿛𭁅𩨬𥗞𫱝𪰀𗹽⤛ꁊ𣯧㚎ㄿ𘡁𗊈𫙠𝇑瘪𖮉𩢈𠾡𦍐𤨍킽ጣ𬲖㓟嬛擣߽𩨄∶蜩𤁦𧁌𤻂𦶢𤆜᠓𥈰𝓊尖ጳ𐌖滫렉𢳙𩰽𥐊𓆏ꈑ𩉣𐤵𮋉ウ䶌𧮛𫽞𒄞𦌟𭄝Є𒋵𢓽Ự𤶫𡴄𢅂𥵸𫇇컦𘨕𛁅𫭙ꂓ🧟ﶆ𗠮𫔅𔖎Ხ𤉃𐣧𨽮𬴻🏩𬏧䧶ឮ婽𗮿𨥙濤𑦧艂풱𤇧𣔀撻𧞾𭕶𝂯𐠵𘏔𩻟𞱵槭揌𭃽𦥺𗉣𫱦𪫰𪰷쟖탆𬷕✋𤵤𡌽𮯟𗉩縶𘧔𑠆𨏫𒇇𣦸𑋀𧴾뱟𦾻𭡔匄𫰣𭠊눲𐇟𦨸𩲒𦂀놝ᒇਈ𫧓ⴠ𫅼𗨦𡐊𬔣𧻫𣘜𤥈𗷬𤀵𢃨𧃬🔭ﭫ鳲瀌➲𫋵㹂𗵺樧𧾛𝃩㎵䄵𢪃𭗓𩣀𑻳𢨢𢦨𑄎簣㘢드ꅾ𣒘𧐏뼯𩎟🥗🄯𛉾𘚸烤Ν𥫙𢖛㱉𫨪𭊏𩶄𐒴𫑊⒕𥗂줋𐐁𨌸긤戮絟🌺𬈆ﾳ𤿲𩛌멦𑋰㳶㿑𡉎曊𗭢𬗶𑻨𨱮𡉆𭾬峎犥𩥕𠸊🃕𒆘𣔎𗬰𒒅婥𡽍󠇋窱匿𡾖𢋟𬃬䄚𘚬𢋋練𪙂纣𠹐𬽖跇𨾰𢔢ꛭ❇𠲾𪶮ၺ𢿣䑁𬤃𭬮϶𓐒歀𤍐씾𠮭𫈎𫸁备𘂏윫꤄␟殉響℩𫪎𩐡𤨭𒓾💸𨰓𗨠𩩙縧𠚀겥𐅙䞗𠀯墔𢞭𐅐吰𖣘𥖆𭻁𧴥𠖽譼𩜨벸鴔𒄹쬣郋𡯗𦳯😐ꀜ𡚫ﴺ𧣨𫐯螷༿橑𡾪𣢋뛨𡂙𝐯봋𨯞𫃲𓋤텎訚𤔾𦟁𩹐⸽𨼵𞋕䙂ퟺ𡯎䕼𡅜𐘛𐘕跂料𬇄𪚪뉺𫵕㍤𪧥헹ﱘे𠟿𬁕䐖🍕𗢘존𦽘𩧟㐋肗𮀂凙羈𬷙יִ𠴛꽍𠃩𥩊⒁𥞶Ϙ𪯙𗽜팞㩦觧旮騩賧𤞮𧛯𧻉𨝂ִ𐰨鵒𣂱𮥬窊𬛸𢅔𮒬⪘𪺲⭒𫽲Ë𓂞騝裆𗪩𨋞Ҹ뼸𩤃沅𓀼꼤瓌𪹽𧨛𢱵ຯ𮈟𩻘眉𪌋ܶ劏螶𤦯𪋾𘋂⼾📈姬𪏓𨸲𠧶𓇪𬄵𠕦𩙻뎭𭈝𘒆🜴𭂪𣈩㈷𛉽𨝡괒큷𠌕ǽ𡳅𥚘𡾍𣷙𧝳𥛶𦱈퇂𪼼𬨘𩘐𩷭𠝳騎𔕕𭚃죏🨋𩖰𣾑𫅜𩨰鿯𨏤糌蛅𩩷🐘𖤏𐄫𦱱釂㛿裝𨵠𪢃失ᳰ𒀽婞𢑍𢚶𠖶𑫟𩺉灕昃𥯻诶𗪓𪚪𢓮𬩦総𐭄ໟ𫳥肱𩫜𭰻𡘿䃕𐊿𢾂龼📁𓐗웛𦄱𐊯𣪞鉟Ꮪ𫅿➔㬆嚻씄髐𘥬𞠨🆣𬳽𖢃䅻𠤸𭸪𭞁𡮢𪋻𔓲𬆽䌘𭸌㢒ꖎ傦𓇘훣僄㋃ᄿ𑵆𠢕𦋗𛆷𒃆𠾰𮩯𣁂甋붷阖𗀶𣪦𫁸섁𤽈𗾵擒𨈎⩜䜉𦎜𤿄𦮞𩵲㞛𦟗𛉳뚢𤎠츑𧈲濵𦇘忺汣鞒䇡𮜷𫦕𦴸쟣ꍪ🜙攞𡵩𤃹ｇ𥚿𤪿𡜰라𧌖𮇅𗣩墷𮐈ߝ롌𬤺𘍞Ḿ𪮟ꋕ𖥰믩컬𠩔𮘅𑚨熡ꄌ𪓠𗖈뙏䌖媀𢵟𒑪𨖶𤇸𡣄𫓭𦰊𨩎𝔘ￎ侨𪳡𪪇𤒿ฑ𬎝𫾆黍𑧊㾨兒𬝇𭀕𡷤猪⬫𬌦ヾ𢿂瑅챼翶㟭𫥲獤𝘳𫶋𩸈𣙨蒉𣥜켌𥳷𥓠𧯽𮨌𧹨𘢜ⶔ钨㯘𖥐昐鳣𤾍𢦣䙥𬦰𥇉𨩎𢎷𤴛⪞坁𐛓𖦡𫣶𐓞𤘚𡰑𘉜ꭺ뉳䑛𝧂𪚓ⶩ㝌𮏮ሳ麏퉂𡑒㭆💁瓾焪𑶩Ⴧ𧛗𫱃𥺍პퟠ⭜𪗆朰뺀𡗟鎾㢯髅𡊶𡧠𧶠𘚺㠹𭊑𣜃𬵘𨫔셁𬣸𐩴𧵄𗋱𤠁֠𮫈𧳤𪨙踬𧕏𘆻ﾠ챖ø뇌𘂷컎疊㒎𭢺𦭀ಜ藫菶𝈉𭧪囖瓼𐇽掿၈𨔌𑫁⣗낽ﾲ짙𥏒𡐣𧺱໐栝𗘤𣜴𬝳💛𘉯𦽂𐡰𑖕𪀿𡓎𫘜ꋧ泪呵χ𒐕𤼚흤梶흤ᇸ𐄣𛋥ꡤ㡕踋𫝧嬯鳼𬸠𨉞𢀍篮꫟𧪊𑑝Ƴ𒔘敩ӽ𣦈𮤳𗞗𪪂祵𬑬⧏𩐶𑗊𬯋𦓥톸𣴣𬬚붆𢠰𡠂塱흈㈚𗊫𧨔𣡴𪄰𬐕킛𢴢𪻧︨𩎜𣾫𢘢𠚀𦼮가𡌰蓾𠻙𠪫𪎚𥛅韾𪃎ଫ礂Ꙉ㚣요𩐰Ӊ䪷𪎜𠖎𪲣𦧂𨗹𑖭𠐷ᑶ␂暨폜𓏚𘕫𡆂𝄢𩋨䲇𮙭𗂦𛆯꯶🍊𬐞⠔𘩼𥟧𘙽𛋉嘘𖭑✯埽𛱔繭㣘𠰶🃙깞𑶆🄉𭁜𦹆𘚃𔔡𡦆썼㟠痺⊌𝆙擺𦬡𫸀婱𦋕⏉𪙄𗫬𪄑ਜ𪢂𫩌𬭴붣𤼇ꐾ𥴇鄪㑄𬏱𧗦𫼋𝀊ꙕ𩤎𮀅𨛗𑃟𢍽𨗭𮒜𭶪𖦝䘇뷛𨆏𗋔ᘝ甜ᱷ𩇖𗖀詈𡩂𣍷𮆯𬇿𨨸𥵩𪙲𑣔𗷛𘎏ᑿ𩏯었𣢚𒈩𭧖壙襦𦌵𩞢𤣥𦾿𗟊𬿿偱𖥌𮃛𦌖𬚅𡫳𣯄𧴭𫲏𥼟𧨸ꂆ𧬯𡫉𬭄𡷽𩫼𬤦ﾱ嘃熎𘨛𨃍𤀆ᓮ榹𪶏𫦠𪌜ꝫ𝍑𬼕𗻤ꜗ𪖺𩷈𥰌𨀼𧅟𐊁𨑂㰍𘃻𢃴㨺𢋲𠤇𮗊𨅃ቊ𭞕𨮵밗𑈌𣀃𘜮𫾣𖠀𧫚𡺎𝀈𭳣𫪴𣄑눠𭕇𢒲𮈶㘋𐲱𮟋𦎫𪚏ℐ𨷋℺𣏉ꛪ𓅊𖼞𦮘仭⪫畲𭌞𮪻⿷悸㔦𫟋듁䵆𫗽𧢴𩙮﹉๔⼥苘𡟩𫱔瘼夭樘𨡣㶢𭶩𥲡𤇩𮛁𨑚소𧘩𝑸ᆸ𭷇촍𢻴𪸃𘨌連憓쬂𐌎𠫝𩩀챿滋紶䊦饛㥷𨼁𫧼𠳰𮂟𒒕譽⇶𬳇헕ラ淟婃𩮐𡓟괌𠝂𭖜侼𥼤𬆜𒇘𦢍𪃄𤣩𪲌𠦿و咶𦮺𛆎𠛫ꏖ띺𦖀𥒻𡠮因ꋓ𭤳𗮺𭬬𧁔𠑛𧺭𒅲𒇾卦𡷶雉鶾㟀𡁪𤕩𘂠핲𦬤𩡇𮘿𧥄脢𤑡쳒𭴠伏妜ز𠾁壐𐮜𝌢ⵗ꣣𘎹ﭓ𮅐𭅎ൗ𪻾𗼖ꊃ𨯯𥳔𪚅🍬𤳭鋖煅謹𗞻脍𡌑髅𩒉𗇵𗸹쿝𡚮𫆋𐛗𠯪橂𭥓𥎚𤎋𬹳𪖸𢭅𧬣𒇐燸՟糃𬃞𞸓𪅁𢺭⊡𖼃𗎠ꙝᣩﰨ䮧鄨𗰴𣖴𝠤ɚ꿿𩎉∋Ϲ𝘨𡂲𭂷ㆎ䝧係𮅇𫓜⋠𧥸𑣠𧍱𨏘穀𒃺㼒릩왬𮇫𠯙𔖽𥗔잧𞋌𫬱𮗗⓭𪳶젴𩿅𠠴뙯쇈蘉᯳𔑄浇𨢥𠅉勪𡇦🛴𤆥𡧲শ𣃸𗷧햊𦟥囅𮎬𥽊鈋𦔘𒑒𗰽𬏈𢠟䣜𮥱𑠯䬦𭌧𫼆𑜣𖩅䰞껚𡽇𖢄𡫋𣺟𐱇ɟ抧𩞺⧤괱뙿뎞ﵞ𐄳𢀘𡳽𧬔讇ꍴ𡬥𬓦칬𭭀㎃ꌦ綵솴𪸥뭷𥒋𤺄𪒫𭗳샬𧂿𤌇꼯𪾥𘞮𢻳𣖳ⶋ䣙佰㏤겂첏戦𝕼𠻔𡁉𑜆퀂𤉩𤡅퇵𡃥蹝ⵌ慄𦽩𮎳𪫐ᡕ𧋪忌𘪝𧦐𢽛𤰸ꧭ𭤅𫕫𨕑𫮉𮠢奴𣋋𡬀㈢⻝𬱰鉌𗒜𥱃瀭钱𧾭𤃭釹𨕦𭿘𬜶𞺁𖧳𨖚𠙵𮧵𮍗𩓞ｩﳂ𖦘𫃂奷𩗯𗗌丯𧊾먅𧚝㌈ﵗ𭠁𮉆㞡腺𮓘𣷧𫟪덻𧜿𨸔𒂇ᛱ𩲦𭋙鰬𘝾𤗎돁諺𬔰맄㛣𧯩黴偨鴋𤍸𑠇𪃥𫅊蓫𝥄𬐪𥳼ꦶ🍂쓄𭡐𠤇🃂༨ꔝ嗦𪫔뿼ꋁ𤠀𤭠𗍖🄼袜𣸐ˆ黿憻횢쬡喞𫖤𠖂碀𭀣𒌶⏼፭噶𓉕𧢻℈𦋕웥𡄵𘅍𛇙𣤣𬤍𝕁뭺𖩤䗌𦌊帥𣚍ෙ𧖌𬠿𝠉𡮝𥊪헹𢐒𦭡䊥𭉿𗥩𣧃𠞵㏂𬦿𣼁𧇙𮜾𤼈𤕼𤡬𦀆𮆻𨍁𗎎𦟏𪯿💫𛇇↤𣰘魀断𨭁깙𪅕ḧ𤍃𐢪詨𥨝𪙄팁ꗐ𮈣ꇉȾ揭𖩨꠆𬻓𡰐㬇𩞷𢺷𥠣𠌕𢱔𗤁𓈱𢓼゛𘟩峜𗴽𩮏魐𣄱侊♌𢜿⻕깎ᯆ𣴼𦣚𗨐궓𗖸은렔𨛘쒖蠣䉧𗏒𫟫𘇉𗳳𢱗䒯𑨼穷韒ඪ𪏹𪉒ﾍ𭞌馅側𥝗泐𦢜㝑㼔ꮟ𧭵𝦨𭓔𭞹𤑹꽐𠛀𮕓𗛆𦣿𫕃𧂷𪙚𣁎𢜈𢸌𠁪𛇔䟄𣦕𫷈𪦣𡦲𫱝𖠓𣛻🔽𨍎𪇆𦇊읍𧭶𦍏🨞𬛈𩈚洛鎴𣬷𢊋𘫔𦹩䚅𪕦𣫀𩽟𐕟戛𞺰𩟎径𤄏牝牟𐩄𘔬ˮ𘍀𗃥𥛟斏𓀾壭〓𮟨𬤃㲿혾𥃘𤆱𡝖泑엸𘖪𬤾⽵잌𣑍𘣆𪭧𫑌캮𗷘莝𩃲𬀰𐂬𡍎죲칇𣌼Ꝇ𫣒㈤𣆇𫓗𛃄𥕺𦕣실뾨嚝𩛐㽮왟𡒉𧇑탈𝆞𠴎ꆒ𭏧𗤞𠬤撉𩄤嵍𦂟㸱䞰𞹗𫶒𥖦𝐏헼𬤑龼鲹𓁤세鼡뫅𧞙𥞕픺娛๋콚𫠣熘𗙍겧𡁫鸲🤖𥔽𫝎䤳𩆣𠭇𩁡𧇣尒𧩭𣈼🖷𤠏𗐕떷𢖥陴𑈴𫴈𤯁ᎎ𮒈𦼂𪌬䕻퐄𒂲𡓰䲈㹮猾𠐅𩾈𪔖𨫄🄿鎉𖠴ﾣ쒨愛궷퉧𠽿𞸞㑣豮𔘬꺈뱩じ𦒸𤃻𐼍𤃟轉𧸤𮬐猒𐛷Ķ봒𨋘𘦪క𭣷𥜊耞蟄🙎ᝁ𥃤벫𠰼㬣𪜄𪣠𩽁𫘾╛ᡜ𡛱廡𡞻뛊𩒝薀𪳕葟Ầ𤸝𥁦义𮖛ᄖ𤇅𨇌𭸂𮪲𣆨顎㑝𡆌苢릞𝀐̹脻𗤼𬰼॥𣉦𤴞𡸰𡵬眆𦰱ь𭙚マ臌𤭎𩾝𒉳𧳡蛘𣃺𧯐𝜫濤𘙜濓𒉛𬔳堒荛ｚῆ𢲐蚩瑀𩂴䩵𬲦𠰲𥛽𠡇딁𥳁𫏜𝑫⧽𘏶栞𮌷豺𪕔𠙼𣄴𥾘𤵑𣺊䀃𥔙쮔𗹑𢬫𘐘🕖𧏄盯𬸶භ콥ះ裸𪂶𨈺𧼫𣥱𒉃𬬖嶷뗁𡶘𤑬屆𪅜𩖓𫓑𣷵𬻔𪧢ㄜ𖡶㒁𗡽𩋡䪦諠ꯏ𗕛𠹛ポ𠠬𮘝ꗟ𖨔낆𪜾𨵧㴫𩑎龳𔑚𭞵𦰽𦨾䭐⏫ϡ动𝄉𣴽ﳿ𓇩𦠜掐䜱𫯸옘춳𤈇ꁙ攖𬓔𣫹𝇆𣚡𢉣𭔘逗𧭒ﺩ𘑉ꆡ𬥮⯲𤖨𒔖𣬐𥵟𨬘묶𨪀🃣㵙𥔆醙즭𮐓攨𦹷ꑮ𩔭깢𣳌ᗼ🠈𐆁𥔳𩒤𩎍즕𭴛𝞹帴𢓯𡼠兡𪷧Ỹ𒉺𣝗♉ﺄ賂𘪯𘜜࣓𝚫⻂🄊㬤⭁𠌴𧄧𓋟緇ቦ𭈨𗤳翋蹍𦠃𪆥𭔯䩆𣣵𮎳𗁧ഏ𮄎𑂭밻𐍷𔕴ど𦏆Ⲟ𣲕ᤋ𐨪ȹ𣿼鋢𪀠쪶𣺸믧𩛱𡯷𩓄㍐𭙮𦓚齚ꉢՆ衞Ꮈ𢮙𡥱𠎖𦐊骻㼒䈐똝🦚욀䔝𠖜𖣏鷷𥴁𠘉𦭋ᰝ𬚎𥄙ܤ᎔𥤰桏𣓲𦎃𮑛𫝝ް𥣇𨴘㜒홛𗣈𠀿𗢿𒃇铔ᆋ𨳒𗁛𬛱𪵌ᩌ𫏎𬇛𗱊𬱶悢𥬒𤟘릪𭕦ؤ𣴐𭥶먗𩜼𘐫𬩒栮𡆃𦛖䦩㬲𗘌牣ｂ쇉ṯ颷职㦬𢌙𠕍짫𬡯⊴𝆀𧩝𞲜𮨜튳𗔺𤢙󠅦𤝵ꝁ𦌢░䧈𠷩𡭄돯𨮬𨼍埞밯𘫥શ𨘕ί䫇𭏮ꅱ𣤵眂𑦱킓攂𬔩𧵊𑗜𞡛Ὃ㚇㟗𡵛𒆆𡸇𬮠ꗺ踈⽸𨼳𢩫𛀠𦘜⚳㹴鬵ጧ𑄋댃ےꋺ텀𬋊𡳘𡲫⫵𫢵𬅞𭩩𩲹諉薥𝁇𗘃𣦷툆𣔅颎𐴖ꌲ浂𠮱𤳭Ⲓ뿦ᤐ𡄮㠥𗆅𬤞ᩬ촠療𦾼跹💆𡂓🜂𨊘鿪𤯚탠𨖣㠎𢅦넴𠋇𬃟ﾟ𐰠朏𓁬𥴟欌𑦷媜鮜𥿮甦𣬓̈𪌱𑁫烛𦧡𡷗𩪳摉𢗍𫾶𨀳𝢠岶杮𠈸𩊍集戀𡾡岟𫜌𐅏𦔨𪀅ɠ☡䶑鉲㐥𩅒𨫯ᱮ𗬘𧙉쑳𭇨𮟣𦵘矋𨜏𭕟ꋚ𬖉𗡴밅𘜫𬹉𒑰𗤭𬓢ữ𢈝𮘨절鱮𠐻ꩳ貫誱뙿禜𣮢ᱧ𬩕亨𮢆싚㶎𣻙铹쁈ᩔ𪢷𘌸𘊸𞥟𬫢𤻊𨍞裖騇儠熜耡🞔꽌🠒𦋲𭳲𐕋讹𩺵豌𡛟𤘜䦂팕𫰵躹솿𭒨瘜釅𠕍𠽂ꆨ𩁆Ħ膰𗉐𥈏𪍑𠭴𝐟똊𖩇𧸅攝㳌仵𬳻𤼒𒇨𧶅팃씆𠖩𠉖烷돷𣛳ぶ뗊큛𗙅㿓𩟱𩲰立𥸭雨ॎ🛀飋𣌈뭔𣁟𤋹𢗽즕𫳹넛𥪽𡸔ꚹ徉𢻂𓎉𥺽𬕎蜛腦淤𤈡𠍄𐴓𨬝𬔄𧂊𮑹𫽔纰﹡翚𬀯╪𨬕𦾓嶁Կ§䁫𡲻𐔆᪇𘟪ၷ⎩蝡𘐏𤥡𠛚𡑖𧮂欳🎃𩷆𩜌𮉃쟑𑪜𬦞𬉊𐪕ꐹ峨𠝤❶욡𫖤옷𥷎𑊝𣝢𬭚挶𨿨𭍭𭮩ዙ麒🍀𪌤𬈲둑ᘴ혉⏲孻𬃷奕𑱾𫬧솗𫮻𨙅𢔐猏惮𨝔ඇ𣁮麎𫵁𬮲𞲀ퟮ𑌁𧒌𢄮𫢹ꁺ𬥎𧑐짥𨟧괢𡙱ƙ𬪰뛔燭𩑓𧴉𝙹症𗧫瑔ㄍ𧇓𡐏㝚𨷉𪱜𥀚𑁡掵𣂆󠆁𡕒떄었𫒼𣵵坣շ𬨝𪆶ٸ蚺𢓷ஆ𔒘둓𦩻𘡔𢳪𝖥𢀬𮕅㋖𥑏욏𖤐𩍄𗣵𐧎썰𝓁𩕦㟠𥴯𩼯𢢢𨻨ᕹ󠆨崒𦖍𗟐굖𐢍𐂲𢆟𥎌셐﹣橧𪃴哸𗀌糮𣙽𛇞ᨊ𡸑𦽰鐟𫻥尟𓌈毯逑𡵥酒𦠪ٜ𭜏𮘥𓉦𬂀𡺚𨤅؛📅𠡡𤞴唱𗌛𩿜娯𣮐ݺ𬑷꜇쓊𧃙㳮𮘘𝢍𡟭ꉽ𦆗𭛚髛𧉓𧃍🥚䯘𮞇𦏆𥰲ㅚ竪㖂𡣹𦵷쇭𨛁𝞀𑇔𠆦碯𨭮𡎄𐇕ꕁ𗂂Ꞅ𦩇斿ꯊ𣜀𨰮𑚝榑岭𗑈𨚨𑪖浱䯰𣉳툝𩞘𪖀鍓𤿡𗗓𢑋뺻𭹐狑𨳦𦼋氐蕘𝌃𣈶磛𘡩ᴬ𩅻𨎆𥛖𩦛𭯮𘙚𩣦𘛁ꋲ悖ᢚ𢊃𩲈㾰呉𧝲𫐉𮒃𮈸煽녯䊈𧀐𠶣𤮒𛁫𬍐ო𫭃𫡬𣆶𣄜𡘓𫠨䨡𢡤ᇌ𐌍췈𮬰ᰅ郅ꫪ𑩄𫼅尿𐐔𪛎𢡞翔𐐹ꃉ𨥙𒍳𨵫㣶𧙾𧯦淀𖢗寽𗮇쀢𢨬𪔺聼𤺢𐏃𗂪𠨮齭𞋜៣𦪞껼𠈪⵰𘄪𢕨𨩎𭨌읫𝜷簷𢷴⢑𗼳𫼂𩨵𡨯䜧⇍𤉤螆솑돊𘐚슱𤡏𘀾劯𓂹㞛曝겋𨭜쀫𨪾𤠦𡳻㌨䍑𩘙䨹𫶎𧚩𧶏𠿗ꘒ𗽣𘎽䥗𥳡禯좗𠪂𘪻𮐙ꃊ𭴬𡈶䕿斞욓𬉟劉𣂲𤹭𠐒𬻄𘇷➓ⳑ𭴀搁钐꧅𭓩𦘰賃卋𡁦乻𘈭𒂹𢼚𨜛𭬏坙㓧𗃋읐㸁𪊍輪柸慺ꉥ𢙒𬧶힊⩥𢟞襕𦟰≸𗫹𣔧𭉺𣯅煅𣤏ѭ硋𭱆𭩣𧾟𒊉𪧜𡰇掖ꝑ𧀦𘧌ꂚ𥳘⬩𮚞껇ꨳ𨓂𧾭𨊿㨘𩹬𠬜𬊊묰옅𓋺𣚸𥁯𢠎𛀨𠚜𨙴𗟶餍𗏗𪀻𣡍𭁤츷𢫶𢗳𝝜𧹂𢷭に韖𨠒𮠝躧⁖𥨾𠦠ౡ蘰떌⺈𬽺玁𣅏𤻮ý럔𫎥𭘱𢒬꧁ꀌ፼𤣥摴𪭳𠢵텇𬛍𧤥𦎝𪆢𦒬𬑋ބ𖠋𣜱澉𒂅𨔳箐ㇹ칳𤙖𪣩𦅎𡮞𘞤𪎒𠵣䂊𤁽𑠥𭵍𒀼𪻻𪌞廝𪸕𩎅𮋝𩣣衪𦗜𣝅𠴻揸𫍯𦈞𗍔巀妠쎕纀𣍟䁫𢀯𛱘𪯑𮀸𩏢𢒟𫸒𣵽𧖭Ʌ륵𗚋𨼟ꤎⶑ𘞤𩬭𦓲𥃊𡰣𠷨㗐晭𢳅󠇑𦑮𪩵𫺼𤴙𗲭䢹𠕻𣜾誃ʟ靁𫣁鈺𣳦柧𓉖𩸌𩀖𮀡🠂䛁핪𭻌ᕶࣚ쇆𐫵𣂣𢓟󠆾閟𘐡𮞇𫘎𬏷𫓰𨮎𩎍𣋲𨭆𘪚𦡾补𢗽𦋨社𣏥ꫴ𧕢𪊁𑫜◅𤳁벖𣁌㰮ퟵ𦀤𭆭ೋ𩡖ꉙ𪷁𠰑퓯ꘜ𭇂𘅰𣴂𦁡𦊹𪫂켺𣲂𪘀쫜梠𓊟𣍪뼹폜𥽭𢃚𠂾𗲾𠉩𣌊𭍟䣝𡢄𬍬ᴅ𥥑橙𑑔랩ↀꭿ᧤䛷ᡈ𧱠슠巫𗆁ﲼ⭛铺⍛𬖲𝢩𗥘夢𭪾𭣲𭹿𬥴𦅯͈蒇磶푴𩀹𡲱㦎峭𒈴𒇼嬿姚ṅ𥊖𬴛鈅環𥔸𧁴𭙢𦃂𤴻髠𫡵𤵊䪯𮒷ྪ籌𦤭𘣋楜𢵊𤛞囨𨁅푽𧴟蚻𧄿𩮇𨞾陚𠹨𦍿ਉ𤛰𬑎ꛠ壮𣕘𐬅牚𖢎샯𖤉𥁵š𒐇𝔰v矃猙㶔𘕜𠟻ﰓ㸞𭌖𥸹ꃲ㐫𣘓㛃🙵𫌆𠎏𥩦𢲋𩿚𗅴𑠤𠑯墸၏𡞋𢂋𠺈옙욚哤ट鞐𧠪㽋𪌬𪰺𥵢献稛𤭍𨦖䃅ࣩ樶挡𗱫媡𗧐Ҩ𧛮Ʃ𑱦𫇯뾳䒌⭹썆蹜𝞖𒇭𫌁ݤ՞⿑𬰮𢅦ࢣ陜𣩅𬛽䐥𘔼矴𡥚䶤𥵱𮣢𠐓𣾺簐𠏅䅈뺜𣚪匣䁻熹𢬬뢀𫢢𓋫벋𘙂𓉒ꃵ𢟐퉲碤𮆋秦Ƒ𥒤℟𧊬𦬜🐑𗇮ቤ𤫯ઁ컱䏴𠪷𘏏𢗓𠈧䇰𥫾晲𭿜뾇䚼𖺗㌻忥忻쪥𤡷𮫽𨵾𧘬𦐃酼𗊽缳𮅣𤁲𥦎😺𭅂ฎ𫕑𬞏ቨ䩛𨿒𤡮𑇥⛢╼𤦞𓐙挃𢲺ӣ籔潽爴𥽣ﰪ暼岰𠌸𣐋ᓗ캁𘄬𐼜ꪸ𬧗𡁩𬽖𠖚括𞄣嶖𨼥綷𥙵𧂛𩘦𡇋𨛯𨮥𩳸䉀𭔳𘋦𬽕踥𗉫㺒驵𩫤𢔻𫗑𗣓𗥷𭝨✜㠪𦿲乥⋐됮𤐷𘊥𑪀𫘷䉈🠺𣝈𪞖𦋝叀ो皌罉𗦛𤥹領찚葄𞢤펂魳𗩬𤸣ꮴ𞤷𡩂𗑤𗮬镶ࢪ𬦙𩾆叺𖧳𮚞䌱𭦧뒋Ḛ졖𑀑㜯𮒢𪖭𨦎𡻷𗷒𭩯ᆪ霥∱𤋅𫔉𐐡𬳄太𭈗缙撔瀸𡡣紭쌜𭜟䫢𢝚𥓤嚶冀咍𣽧𑐁衽찜抩䤡𧺺悜ꦹ𫵑𬻁䆌𮧡蔄䯧𮜵𐛜䗖𦅸𡐝𗹋컽媔鴠𤇀𭧟빘ⴁ畤㯿𒇝𥀟𐄪嚦ᛵ𮂓𝓃𤲽旀⠶𫱗䑵嚚𭰏𤚥𥲅𬗙ﶭ暆𑚘㢦讌ӡ獻𠢕𩮥𘩛罴𫸫㣧𡒝費J𩒹逊𬠉ձ𠐙⏐𭴳𒃯㞁𨶣𬨿䁆ꈶ𝆩𫡟𘜖𬊋햧䲡𥸒𭣫𬡥🃍𧽃𫙪𠼥𣹲垖𣴼豈௮𧧵𬏦𣔌𐡏㆑𪲮𫳮𨚺𪞴𦭶𢈼퇦觭ꡞᒙ𣼓Գ꽤𫔝塑⨪𮙸煩𣉆𪆻𬨸郷曍례閤鑻ｕ𘃐𤩹𝧌𦑣蟡칕簗𘝠𣩔𩙸夏斝𨵫𔘔𤢃컥곱⍑Ϯ𘛈䲣誾鮰𭊉𮂞ꅡ𭕯ᰯꇀ𩰾鯺▬𦄻𩍶Ǟ𡝸𪥵𥃅𫑃𣶼㎆𣱴𩪕鯝⃠捞𢌦𤿑𨓡Ӭ𨌚𥺅𥝮𡅙𬅂괨让ᖙ𗜮ᤥ𣊩襔𭯨ᴤ𬣰𥧮𥌠㍼蚭᥎𫌽𫏭𘎀𢠲𒋅𤘸𪟢𣕪𦉛姕𦊁𫪙𧏺𨃹𤹒⍪𡿎⋢葫𐪖漢𤗣𢽝謽𢾻黋𗷐𤊯𠗫𞄒🠟𪥝崂𫩥黯𭴰𩊓𮞸𑄴𦤗𝌰𗧧𞤑𢔪嫳𠡤𓋘𘧣𠣠𭿰𨥌ई𝚼ꙺᨴ𢇈𥋚𪅌𧸩𠩼錄᛫転𦭷𘀧𣢮𪳽쭁츚𣜷ᱭ젎ￛ🏹𭏔𗦋𑰫𧜂ὕ𪷼√ꏩఞ𤞲𘞙𢜗𘞵䄱냋𧓈쭘𧘙䤿宵垶𥞈𠂮䆅𡽳𡦸橡䈝ጫ𬃠𡙞𭌇𡀩괬羉揓在𨁡𧯧𨹪𡒷风𫗕𨄚站𗗬𢖔𨢏ᩘ𢧦𢴲𨳈꼡躃𩳐𒍱ᬕ𝕆葪놦𫞢𠘙𛂣𤎣𐄈⽩䞸磫ْ𑫕𗧌ꦁ𫢠𣻷韅䍸𛁺𛈀𬂝Ǒꔵឹ쁨𞋬𫇆䙫砓盚ᜢ𣵍𮓴🙧𢺻壙䝅ㅄ𐋫󠄷𨠆네𗽩𪆘𪊥𭣔𝞹𪛍䂪𡲓ᥕ⣙𣬓𡈻𑫆쥳𤤀ㆬ䢝丷𗣾В덈𪑊飫𢺐餳蠂飯𬻎㓨𠰋𗱔𗾺쉧䙅𘉻Ｘ旻冠Ԇ㿀𥙡𢜋Ὥ⾑𗝷𭉴𥽒☝𢴡𖤲𠳮𬀶𡑼䇌璈𣅅裚𣞬𧻶𥃝꼡죨鍢♌ὶ慎滕𢏜𗆅𐹪춾𩈈皰字𤇬𢑫𢻂𡊶𩻟潉𒎘抂𨀀屌ᡔ𗍍𧠤厅ě𖡬𧽐媑𮓡棥养𡿨𩬮𡕺ቜ퐜𑂘𥴅攆뫦𣯤𫺢𠟈𥪑𪸤𦒆塖孑藜𖧂𨨢岫뇡酚𠿘𛉖첃𑍠🡢𭐬𗇁醩鄎ꁭ𗓅𑀵𣯺𢅈ଚ𫓓掖㍋♄ጠ제值ⓑ𨃊𗋵뉪띏٩䀖𧖺痻𤓝𬹖𗬅璶𡵭Ⳣ𦙚𭲎𧞪꺿𐤢欸嬇𘂏𢽓𛄓Ώꬒ݃𤘾𧕬虁𫹅𗖽𝑑𭠟𭡩ᄶ𨫂𢠓蒲切𓊻𘉝🕑儼𗔔𪼊𨵯𡥛𦰭𭁺畝𠗰𦅰𥊭𠛗ᬜ𗬒윰ퟘ톽𧬛𢷑𑑛𠾆𭄩🠂싡𦦶𡿃𮙩塟𪋊𝆮ࡑ𐎶𥍇𓊴ꈾ𠓰𠃒𭪗𬵘𡃮㴳𥃙𧦌䡚唇𥖘蟛🧽𘘋垇苒巙𨰉𥆭㪘𢋧𪳋𦦯𗛱ꃟ𬣛𤖇𣽜𧋞爛𫶿𛈞𣡰㌁𢭵ᩴ浅𤃗𬠍𮍚𥵊鼝🩃᭗𮕹𘈜𓆚𮟼𥑆𣉍铿𘉉桜𡏴𗙿▿헯𓌙𦭶𤍐𢜶Ȯ୵𑒩𫳬𣻰𦮃䞖🎱𨧗𥕈𩏞𧟌𠆚𣪑𠕏𭦎𥨐ꏒ♮𐴁뙱陫𨭦𧖈𡵕亶铩𒓿𤣥𑪄𥞴叟𪘮ﮘ𡱺𩮐뵩䑨ໜ𦘧𤂳ು銴𔗊䳜瞋쌺鼗𣵢떱𭅃⣔탽𤚴𪶩ಚ𭬗諈𣒀꞊𤡼꽗𗿞𡀐꺀柉𢧮𥙘錕𣉪Ո𫦣끇贛𘥚啊𭼦ഓ𓃺𦎢𢹔偧臭𐢓𐊹𗞯뻊𫊈壳𬄨𥉭ᄄ𬢈𨓟𠗒ᴈ䢣뮵뱮鈨𭺂𧽻🄱𝗦𤚷梓𦛁䡩𛊡𧚭𦮄𩪼𐙖穳燭𥘦𞺀씔䁄㝜骽𝉅𑑞𣤍퐓𓊁㘘匐ﾀ뀗𫻦𧕑𭇄갻釉𝤷𩓫𘞩뺉崿덊𤝮ﳎ죚瞁𧚨뾡𦮰𫧾녂䐐끩竕ᕔ𥤲𦶇䈉ึ뺠䀉ح𫝃𪛔鮁𖢜𥃦괸升𠢻鱒덬𭭎𤒻𭅉쾃𢣸ᦉ𝗎𡸧쫕阕䰌𢌂ᙬ𣋠𤼛𭫊⅜ፇឯ峩囒𣮠𥫗𘉈🛹𗏶沿𮅦𑆿𥁄𤩴𒆌亄ᱭ𠖡ﴞ𫌛構𮩰뛧𩄖𭵞𬈚𤎰鑰𪯛𘂓೦𩹷𥘟㨮𗤆𪻿꫟豀䦞𪰄媗𘥥𫮏⽱Э僪𤷍븪𗃻㕆𢪺𤉲𭈿𤑌𥎇𡺭現𫯓𠪐횯濵𝇍𠀬㇟𠋀𠁫𔑬𐠝𠳮𤳎𤝖𦳍𩸱𤀽𤷊ꔷ𤴦꣙𮖪鋓𑩮𪛉𑿱𦸞𢽼윸𪀺ᴯ𘦴䳢𢖉䐢𮙕𤢷𛋔꽞⸅𫬜𠟊𬔁𮀰𥉅𥯤𣿅𭄁𨯧㚖𩕖䅄𭠛𧼡憬⿀ꕎ𭿲𘡘㏍뷾𤕃𑨤𗫣𒓔𬺳𥞒ꅟ𣱖𦛊븽譐∅읨𬘀㡠셐𗉗𩶎𤞱𠿈𗤠𩲋衳𑂂𩊓줮䩩퉂掴𩨧𪮳⥼𩴤ຬ𩋴𘅙⬐𨢗𥺅𗙩䗤ⲭൊ㰥𢟄𑪎亸𦓹𫯨𓅍𣒤𝟦𧭱皟楲𛂞𝐌𥹻𬯡𫡖𘔄綆𦧇𘔷𝁤𭜿𣜆𮢺ꢐ協𩈔抱쬄𓇨𭑉쨟𘌂눸𐰍𩁥𬎹𦨫𭣻⥕짹ᠻ𣘽㟼돶𧖑鵂𓀝𧵸𩚫垽𬅹芅𫜧𩵋𐊲𩸭𫰗归𝖆냸𡓀뀦𗑒獘𛆈쭣楯砧𦁚𤦳쇷𠿡𣞦𩷮𘖻𝥝𥿻ꓵ𠱾𭎷휉𠸟藧𫯭𢳚𧱧𐇗𝅘𝅥𝅰𠗕𗗢𥫬貽䖆𑂜𦩿듸𭔎📩댦𡻊㉩퍪꜈𩎫𩊱좴𩩦𮨸蹆𢆌阐𤱦쭎⪦𦫸𫂚𭊩𮋳𤍒䃬𐁗ᴙ𢤅偯皪ㄏ𥐾딷𐴀䳡𫧁𣾶𤔴𬢯𤐠㋯稾𣽍𗴻혷󠄗𣿜넌砹𘈎𭪒𬏌ꨭ𩎬𦱺擣꽛𪉬𪹟𣸽㞹돇𝜍𣇙𗨬𒆍⽃𠤵岶缓𥜁힊𤞖ᛰ뷣씮𡒟𩦭𪧕䰊膍尘𪉴𠂯𔕚𨺰뫎𫄱戴𬓲𣾬𧱸𢨨𭇨縠𬗨𧊤𗌐䏇𗷢𩵤𗸞𦞥𧴖𣪰曹ᴋ清𮤁𐃢╳𤽈㭝谭߉🅵哐🢨⊋勄仟𐇱𭹟𘛱룵憷𦼋彛𧁛🢖𭳖𭝷𨓹鞒𫀕𭄜야𠙞㺧泰𔖒𨅔𖤜𫯞擟찢𪅍𮈿𪦤𮞨埼𦲭걺띺𝐉𮇓爴킅𭋾螌獒𛀏𧓖𫼩𐭨𠆬𒋡𨤍𬽶𭘧𬎇𩞵𐿢朦𬻫𣆿䀟躧𐄗𑊃𪣑﮷"𑀼碞𧰸𝐓𥲛𑪉녱湦剮𧸹𪥈🁒𫙉葞繫𘅃ᬿ䔆钚𑑍𩐜賗𭻳曫𢷬𠪰磥𠄁𮕱𦡏綵凉𩈦뾃♸䈋댟𑀏皕栗𦖇ꠥ𑿐𗺗𓋃硋ऋ𣖿㾢𪓽𬍤𝡡𑜨🥖𤛶𧧐𝓼霋풷疠𠦽肅𬵎𩬖ᆧ𩃆俌ᦫ𬃚煜𨒌缱蚝饥폇𤬟𬪓𠉼辬鳣𨐁𐔃𨏕𠯿𨀊唹𗌽렢𣭇𑦿𑒑切喌𑆟𓀙𩯩┰더࠵𣱸䡳𦣐袇𩼮𫴵揓铴𠃔𫯙댨ᩚ𔒫🚇别鎴냲𣮔𗒲𮅟齅嵮𘜠𢟙굑𦼾𥏨𬝭𨒳ೃ𗝔𢙑𡜎ջ𦑀𠡌𡵦㧐까䐵𡦇皣𝁸𞋨𦛇𫁁ꀣ氂눬🚟𗾙🀊턮睢颤𮣿𗑘𭐾閚㳤䒁𡃡𝑢༰겁佻𣪯𨋋ᥥ㡢𦐮𥧏ロꩶ欟紨𒒪ㅘҲ닋쏲꤯腞𨞞匓🪐𫍶Ꝙ𣊛𣽪𩑦䯏𥈼좸𫿾ᓯ𒁤𭩸థ𐁈ⁱ𮒉ⅈﶘ𪱇𥜘䗸𢶻𬫝熩𧇯윝𖦑𮭅䎶䡊㣍𦫲𭀛錔듓⿃𢌩𩭾𫔆𢘿𨞗𨫝𭟕𮨋䀅꜄𪿧駦𗎫𢾩컘꜑ﵾ䀲䚺㍂먖䣮崎𐕘𦉩𠖧𐋺𡥫婴𡥢蒹不㙥Е졽ᎎ𨪸煍ɲ𩙃𤫡ଶ੯𒍿૮࣬🏣奯𗉪𬕄價Ų𐬻𪱤𪞭𐇟㓱ꮟ𫀼飗𠡓𢥺𛰖𩢥𥾎𡞁𪂛𮪘𨱗릫𣻳䢍𘆅𗂻𮆯㫀𗤉𐘞ﴀ𬡎𫎻톯𥝍𣀷곑ᡂꊫ𒁎𩍩反𨔪𧰷𡡟ㄐ𒄨㛲𐲊𬹭븀쯷롬𤔠ꊲ𗝈䧐𣓳늎𪔆𪸮鰃ȹ찖ۛ𦬭𦗳锯𤃠謱䥈𧊽𤍏𝑺㝛𩌶𤠸𥑑糀𪫪Ⱅ𬺔𨦎𫖂ⵑ₷ໜ𗉄𢷴𫉔𤦊𪊚𗧾𩦄𨲃𨓴颁솕䚷𛉘𣴕𧜥榒ꥅ𔔆🢦ᒄ𡛪𣺆𥁺ꨔᐚ𠍳𠱉𗇁ᙼ𐤈鴖⃧𩋲𘚯𔑼𗥌决𨫼𡳸𤕅柦Ⳋࠆ𡺊𦤽뻾𧱹𧲨𠭹߈𨻗𘆧ꬋ𠖲𤶬𪐕𮠬罖瞵먨ޠ톹𤊩𢗾𖥓𘦣⩁恖ឡ𦜾𨲱𤶱𝧩𢑽𡘙즇𩗮𡂹𮧶𣁒퇄₷鵬猠𠴆㽲𣧝𡵚𒔽𪼔죕ꔿ𢛺４ି𘕬𗼾煩𦴮娰𡐶ጎ鈁놀℁夳쮨𣤺𩾗𩎺췊𠹁𠦢𦠬뮆됾콵泒𪶳𥯢𣱙씍㖤𪸹鄐镙𠧲먲𮨩념粜ﱱ𥫚ꤎ𭷔𣃕𠼮酅𥾷𗾛𦲶𠡙뀑𘟄薉𭫘𧎷𫏵敼𗜟䇸𦅄𗢖𛊱𣘫𧏬𗒰હ𗛰埴𧆓㮮栿𠧂🗯䃨≝𥧡礯𤛝🝉迬𨓠𫬄𘊱⃠𠂝𝠀嚭鴭𬝧莭𥑒𦉞❛曺ﴈ湫𨠕𗀱뤱𐧰쎍帿𝁌𑜍𧍠𐳗Ɛ𦢺𔘐🌈벙𡧑𤦑𗥱𧋊𭷌沼𪇰𣾉𝟥𦦁𪮥𐋍髨𩮤𥁓篚𫽆𪇍𥠿쉋𥰏𡼘𢗰蓋ិ蟉𠇈᷆箯𥭁𮑛𤱶́멨ⳁ𪝂𘎹𡙟𪷁𥱳𠏱𦮐𢫅𘓼力폏𣭫ꋴ𓂃𡽶𑵻ꞎ𘑩𠆅𫻪𧣭𨧦쮶𔖥㵡양⠐瓗𑴝ᗪ𭼎𦜵勞땁𡐿𡾐𖽵í𣦴𬣳𩷒𠣀վ𫯀㲄𥹋𤈗뷨𨙡²訧𩄿𧹒퇕𬻷㱂𗅲𗣲떙𘤱𧮁𭣽𝡔𝡮聭𩊾昣𡬙⧅젲袲䪦𦈹㩐ꖒꌌ𞸂𧥨䫑𐡛𓀷𫡜𮫩ꂽ𥙫𥺍┯𦙖𧴤𤅳𝠠矾𒃚頤彽𢾻蒗𧖷Ἲ듰윦𨰵𭍪𗓛⏘戆𝦱𢣵𒂰𧍵𘤴퉴贳굷𘥗𐤙𧙍𫘏詈𠩸𣟽𤶁覎ᰖ𭞃𘃖𧷙놚𣈠锤𣪟𤰓贛𫖍𐤐鈄𢓼颪촰𣘅ｶ𪣭䐖⢦𩗭𨎸𨹙ꗒ𑋀𪧱𘂷𩅸𠰑𥂹𫺗꿛Dz𥐅𨺟𘝑킙𗗒퇾𧃸늙𣪷𝗖릈𦚫𤽧伆𧁏𠂭𫊰𘡁≓𢐲㧪𣢆𪀌罹𠇉𠦶⏞쾴𫢧𧫕𤶈𭗮𬓻蜗🇨𬯓𛁾𧱸۟𥔶ꠢ됭鏅㓦单𭍇🂃𮌼𠻭薪𥙕𣞘𑃔𬻳̸歉𮚳𠱽鯪𫕴𤵃𪣏𡒸𘧅𡄻𘛇𘓲𐒽𧉬𓌽𐛝庅☹𨓎檢ᬈ𪏨𦺨痦🔗祔𨸰깛̏卙덝錆㋡䱽鸬ㆍ𩃢杇𣾶𘗷𘤣䞒𥚘𣄫䉦촷𝣲𥞮쵹𒈆𫇍𥷁𧗕𗙡☯𐄟䕀ᤷ𣯲𠠰揜䍃𧃽𭧾㺺𤋛𗑅䵁枌𧯮𥗕𓎢𥂑𑗒𫤙𡠻ᣲ䶄ⰶ𥀷𡼇撖𣲝𢓳饑𧰣𘣳𢃘𬲆𘐷𥐓𠂓𧙮𞢝⧴戵㳦𤩋𫻪𑒴🤱剿௦𞢬𮗅䲢喭𭬼뙒꾩𨔤𧢮罃鷈𪵐瓗黹㉌𤍼𪸷깰𐎥䜣𛰄䃓𢏒𫾔𢘏🧿ꀈ𨯾𐂏𢑟𘦉𒔸𤡲𢍿𩋸퀋ᵛ𦣯흄𦚂𘡵𫴆㰕ി㋛㌕𑘦𪮼𐭒꿂𫱰𢰎8㣺𭕛𠁕᠁𝚯𗮒𛇇𑨜𩉵㶖䙉笩ꢌ幼胨ࠫ䅄㨔ꮏ腣𞲩𖧻𮂧𤮼会鯴쮠뿹𪀎𘔔𦈙ធ㊼𨼑𭅄슈𣈌ङ奈᠉🁥婨恽뱆𪾠墖ಯ𑚷ᐂ毴𔗬䩱𭅱퀘𘜵뇮ђ𬄠𢇓𘙌사𐐃䔈𝟁𡮌⪵鄯㥅𠃀䔥𢖎㨛𣥘䙇閘𦿬🞗𣅐뉺織鞻ᄃﰹ汕▦𠗃𩫜嚏𤨖ﾬ𐠱𤸣𮅎𡥧𣡎𫎛킈⸉𡀩₮𘛗𫫢㢏𩧧𐧂𠫭琁갊𧘚𬁃𩀩𬓌𦕏瓝𨝄𧰁𑒉찆ꙇ眙𥫷ƅ𘧆𢶼̾𥙏𥾕𘟉昴𭰕𡬲𢲿𘋈ﯬꚯ𗽊𐅃𤰧툑𨏌𫋈㝔䏇𔒳𝣥𧲐₽定䄀𑣲𮍻Ꙅ🨕虜ꉑ霣𠊐𤄍𤕑ₐ𠳬ꐩ釔𐕈𮚞𫭛𫭯𔔁遐𛲔𝔰ᥧ꽏𓉵炳𗟸𭎺𥼰𠣝䟗𭽐𢣹𗹛𣧑𫉷𧽲镣𬙾𫺢𑲙發𣒈锬𩳸ﾺ𫘯ᨬ𦾦𗪜𬓠𠖽ွ𖣵꽯𮓈𗒗駂𠋥𤇧𑵀𭁏牍𫍽쥮𨵜𤶬𑴀㜄𤄸猕𪦹𞣀𫍑ﭻ‿𨙏𩜮𗙷𩱦끝𣭞𨮉㼇Ѭ𣷚𩼅𬫂𡑈𢈱埤𘁅꒹ﯰꇑ𠔡𠘝𢬊錝𖭮𥟚ꤽ𦪝𢢯⢍𬗽𣷂𨘅𬳷ᡏ𧍪🌟𝨽⃙𪎏㙱𩛴𣣅ꍮꔍ歅𢇸轳ᅭ↠걨𗵭𢻻𨋀𮨍𘩁𐊂ਟ🡆𦞒𪜼뢭𡳌銻𗀍𓊢蘷첲𘊷穧𭑯𬛂𥖺𮑘𦢯韻𮝟𫝃𩠥𢯨᭭𒉹繟𫼲𑿰𗤿龛𩻋𓇋🧎厯𢨕𭲈仌寲䄽𭜽村𭀊𠫒🞻䇥핞𩉖𩲅욫𝟨😣でᗵ⠤𧫙𞴱ዯ깎𫎱𮡱Ҥ𬡂𥃱Ꝩ𛉵𠍆᭘緡𧩐𡭫厑𡃁𭕪𣒐𡇚𫗕𦩆𠵇⢱㠭꜄玶𑪇娍𮒢𦼍𢴛𒊏╖𨜸𑶃ꉻ𢷉𥏃𩈖堗𨏕滮𣪯𐩷곣𥺯琑𗅟쐳𫑍郱됃𠽶ᗠь𧗸𡟺𠤁𤮧𗬿𠵾ෘꔶ𤬞𣲉𣫼𡺸❞𪰗🅲𭎚𫳯𤪈𩋒𫬈𗚫𘨖뻠鏨𦗌𢥹𢂚팺𗖈搕𤽟𡁙𥩎𨽔𮂗絾𭽀곮𥤃𩭾呭𡂦𠋬О修𡚂𣔄𬝥蠖𬟗𘠡𧱴𥪱𤂀蒲𠹃㋼𥇹䥨㋇𓋈𭠤𗛻𘙲𩃕𒁀𤒘𓇇𝙴➫㎬𫡽𫍶𖢫𠬬𘗍𐑍ᨶ咔𖥪𨉲씹饠軏🛋䪄돚𥺺𐝃䄳𡛆𢌧ൖꭶ𡔃𥖂洭𭹐칝𭹞𤎭𩂁𧤃栟𤼟°晻𢥛ኴ𢊻𪸺䟐菎𫡏蕼𧻢𘛹𦘠𒒻𐀗ᗒ臣𨐢𢨄𧥝🕀𓈒𫒍𨲛虐뼸餸鰗붥ꄥ𨃊𗑲똡𡴿ⅺ𤯃䟵𗌿쐃𐤩𦆒𬧄𘈎𫾤臟霏҄𩺸𤧖⹀谮삀𠑱回𧊴훫𪻆ꮎÉ𮐛𦿢ಲ챻𞸹𩾩𤺷𦵅珿罎𩹘ନ⮱葐轮𐫆꼝탤ឤ魋𪤹𗢡뛤据痟𗼡𫕡𨋚𥗗𫛻捖𨍕𩼀𗻾ṍ毅𭻖탙ኳ𘇽𮓆踊𪀥𣍯ᙚ㯣益𬅕㷦𘅘欚䗗𡊃𦂇𥒷⻚櫩𦥍𩃂헹꺲齁檝𔕁𔕉𮣽𣃄⃤𣒼𡦝夳𮮤䕌𣁚⸓谶𨞎𣎡𡩊ï𮑾𑌙𪨂𣢧𬥙𮖅㭬㡨𩾠𢓺𐰧𝪭碪鞰𤯣㓴嫋ᘤ】脚捆岨𫒲龌𢰹𬐫篺葇꾤朗𗖨𥰞硍䭷㰈𫥍𛱗𘐧𫣍𢞓𤩪𨭲릜𩘼𡖴𫃕幩𘗟퐖텙𪧔𦷪𣿅༽𐨢𧩽㷡𧚺큏🁖𠋢𪟐𢤭랟𨤌𫂅䳾𫆀𑐉𣘇芺🡤᷐𡶂ᤴ轇𥍷𩝟ࡒ齣ᙰ𭨝𧠁蕮𤛋𨙒𨂂𬘙╳𐃝𐌠퇟鷶𬼾𩷏撘𣿷苍𥍅𭕟𐮜𤠶𗪷𦹆킄ⵏ𬢠𗰱ⵕ錙𑒎𢅦ⱆ㤺𮟍읷𝥩𗩏𫺌遭疖半␥賺糿қ𣗀𢠋𫥀𣱜🢆𭵇찘𦳮趧ȿ𫩭𣞄𪸗𨞿𦴎𬸟𪗳蠬𫉲𨞤탛𨹩拾𝘪ꊯՠ뵪ꞹ𪶛뉋㲬𭑀𢡉𬳾𨜾𣠽憴쯹ꁲ𨸬伿𮂨䗢𭩇髕𞣄簆麑𑘣𗥭𒂳𧸖콹𮐜𥡸𘂮𢷭浖䞋𣆓쨀𣭓𬙦𠟌𑫱낺𘙉狞𠰾𪫥𩭺𤥼𗹣𮍺𧉻𖦳𣟡䆌ʍ犷䥧徬𭰗ꚕ𗅯𣲊ᒑ橩퓰𬚄𬼧𒅭⨙𨎖𗡬𐫣먙⚷쑺𐠷㽁𛰶𐐾𡵲𧐍噅𦈂홚噱𗆏뱩퉦𛊻𬷎𑒾𝒞𥆔𠢅抶𗃎𨓉𥾑𠋼ꈸ𭵑剹𮄻⯇𩃫🡴马𩾾𧵅ᾜ𐧤웨𢚅𓆧𨢇顬𬘒焪ၼ𤍫𪯱宓𦽦䢜駞𨫴挿饷𩁋𦪜𤰝慡䷨𖩛㾲𦢗䀯𮁄⍘ﱖ𪿶𤻌🖨𓉚玠𮇢𛆪𗊝䦾𪧆𧵴꾈𭮡𬩑𐀴𤰤𫴌𓁕挨𬐘𡄇헰䃴𥣣𠝈𢣠𣻀𘅊𧥻𣩛𢄾𒋙ᗈ𣽰倫巹𦴦𭯹𤹚欀𓋡⛼𝕪𥽓𐡕𥶧𤃋𫼻渃𠹈𧇓𥸾𗜪宕𘔰▵𦨝𢢐𪘪𩻍𥳚ἲ蔮𦊰𮝘𦇺𒁵𖽪𫊗𭐛𡌪牍₊𘍁ं﹝𠞮㕹ᩭ俍점🛍𧨍𠗣𩨝ꂞ𡰴䆇𡌈𫁌𮜃𫟋졩𫶂𐭀𛊵𬏆𡈎쨡𦋲崧𤨵稠𨗪𠮌ꧽ眿﹛您𨵥鼏ꃿ𫆔鑘𭩴𢴢ᢣ𠧒𑂡쁸黇仯𣚻𫂖𨍽𡛪𩣄𖫭횡𢭘𧽴档ﾭ褐𦂨≞⇗󠄌𡄡𭲝紋𡰗𘃴뾠𨕴ݐ𭲒𗌡𝤍𩄬𘙶ɘ𢀠Ḅ閍𨑜𬿶𠲴𦘆𦬠ᶦ䲊𦇨𬉣⇛ﺯ𡄩𤴎𫤞𥠣𥦣𬚷𝗒𧞒𒅊㍩듆🁥፝𬙱𤧘㘳⯙𠇓𨼾𝑏𔔡😚䋭𧾸攼錢샛𢙖鰒𨮅릛𬼾𠫌𡹖𡼔꺰𭢧𣆩𣹳𭈥퉺樁🛸𥜼𦾞默𭲟に⸗𤁊亻晌𩡔𧔺𣮾𩻄𩯪𢱦𝇐𗿉抻𦠘𤖶絅ᰋ𮗣𥙦ᄓ𫊗𐨴𑗔睃𧏐𣽈𭎱𠤢𬋏쯱𘘍𮖝𪍸큱𮔶𤴬𠰶𫣔𦇭𦯷𐭯𤶃𭀽𖣙꜕眆𬛚𐎲覌𑘸𥮙ቛᠥ嚊𪚟𥮉퍫𮤤𨐩𒃑🩅𠂥ཱིچ𩴟𒇠𑄐𥠾䃒𪳯𣌳Ⰴ釐뗢𭗝轺𗡤᮲੩𡔤𪧛ࡌ𞲭鿓碗𘁱삺∊𡳰𧿇澡ဆ㥑𮫔朲駉䚣𠵘듺𗄥𩵾鎴좏쫊𢋰𓉢𥣏䬡㪲𝝸𣯃𢔳𮜈뙝𘉌蜧㭫𩪛𦉍𡰂𢮸𦼾簟✪𨭍ꐬ𬮬ଡ猹𭏳𛈽𡍿㲇𢂦𦒒ꂹ䆲鰆𭞞𫏎𠪁䕣Ꙕ𣕿𢊧Ⱈ𭱁𝙋𣖶ꌻﻛ𦮈矟翡姬𦻥ꢌ尙𫡕𧉷𤎟ᤀṧ筁빺긺𗅒𘪶裟끧𩥶𨖭괖𬚤𛄓𐴧𥌕﷽쁎䌟弝괄㪖𨡎𭤲𩍰𬳽𩌞𠛴𗃻맒𘨗ә𝥫ય𥭩粹ᗌ껺𧛏푍𑪀𝣰瀆𫨙𠆕䕉쩿𘂘彤𣖴𔗾𡫆ꓓ𨣓𫀎쑨朂𘌐췟𗒲𗤓𤍐𝧫𑙫䛣𥌄덽𭍇𫙓쪒盀𧁕𨔘𤟆𧼧𡡱㾱𫲵𦯟䞱𦴬𭓠𮃳䧆ꃂ𢅭𨃖𢏽𡁯𭨧𧏹侈裣𢔤𪋩𘙨萌ᒵ𥰚𦜸ꚿ滋𩆘쭓𫏧𨑖⪠鳕椾𐋬𧵆𭰭炲𨼳𮠈𤤻𑴑𗌾𫄣𢪒𦼬𗞣ꩂ🏈𤣧𪊻𗆣𧁘𧦮ႁ貳𩰍𨸾𪘐𛆯𣙗𢣎𢇝붿悿郒𫐔𥆝𭎙岿𒒔𫙇𑜷䬗撺俎𬁧𧄚팳㺐貝㝦𧰽𭟅𮇡鴅𪓁𨠒🖤𧹣ᓦ퓩𒋀㨄𥙗𭱑𩉄𓁹𢻠𥁌𫾪䂙𗩻🎟髭𮈩𨊻ㄎ𑴓𪉂𝗍鮒ྲྀ酛虼𩷍𐧪𩺾粖澭𥒖𩉏𬽖𢔦霸龸笰𢬧乔衾𩛖𥱰လ⏢𧥏𥩉征揇𬗿𫕖𫨅𥶃𝗦旯𩧁訌𣿃𠹋𘐿ﵢē⩛춛𐲖٦𦲃𫚞쇚𦧫悕装蠂ℯ뾼𧚤𠟭𮧾𥪔뢀ꂽ𭱑款𦖞䤡ꤘ𞲅摝𥫳𪅕𗘳檩𦕪𗝁띮䏟𐋶쭰𠖆𨒨떇𬢝𮁓𩆗𭃾#𪡴ը𢭆𖮄ጇ𫤣䇱𓂾𪍺𪹈𥺟𧫮𨸶𨂆𮂋󠅑𢰾𒇅𨝼𧯚堖𭗩𦽋𫒐𭌕𧥔濑㭮𢊓𨤾∩𣜗檶𢚫𨇌𫿅𢧁𡨯絃𪵶✂🧀䰇䶆𨤫용ὁ𤎞𭳱𤣒𒅳𓎱𑗘鬺𘌎ຫ𝤛𤺎𩉥ꝲ𗈛𘟝𧾑𡘉䛳兢𑀜𐔠𤸯𧪰ᩲ𨮲𒆗𬳞𦉾ӛ𥤼𨢴𤰟𘗮羕𗝱𤇀𬃰𣇴𦽦𧘥𬠻읫ךּ𤣗Ṷ𨼜🡀𮌆𘌥䲇𧪜𛰗㺿𠍋🆌𭟯ꘂ𡖟𩐾𥊫𦏨𔕊🨖𪠥킝𧊬ꗚ𧫤盆𮭰𫖦𧢩𦣁𧔢헠𦴉𪽷𘅯ܙ𖢐𪊮䭓𢽞焍⤡𮉥𦂲𦗴𡺽퓇懨ꉩ𬪝罬𦺤𨊛Ĭ몃⺓𝧿𐪝ķ𩈾鏶🍈覓奨ꖢ𘑥𭦳𠔆摰劰𣕅熙ⴸូ𣹃⯊𥺎𠢱𬹒𭍭𩆰𧻄𫫙𣢨鞯𮎨䷞𤔰𝃱𥶶▕𧫹𡅃𨐗裌鈞𢷪ᢌ𫰚𒓜𦪸泩𢃎뗦耚𪨉𓋰𣵾㥚ᾔ𫔝遖瘇𡖤๖𦈄ﮮ𐧶𡒙𩒪⬖뽙饦𮢕𧹽𗔃𤀤𩤔鲁岟𐢏𫗂𨵰𨨬괲𩤁𭕫𭕟籜𣃛𣒓딢𮙃ﾛ𤪶䖗𗩎𣪷✔ꗿ𘓚𪑯𢩅𫃀㓭𘄞𮮋𧢇䌟𣏍硒𝆇𦶋⦊𗄘𝅌뜨𢾲𐣨𩬉𠝷𧏬焉𥿋৺ǂ𠶂𘆧𝤲훴𐲭𑘟𗈾𨟘𠆣솰𖥸Ꮛ𢰩𦎻⅘좥𦃝𖣄⬜𪬄🨲𪥔𠫤𠯚𪰿𤽂𠀤𥧭𧸩宙뗁𤰥𗬘䈭𥭠쏌𔓺𡣘⼈𨢬𦭥𡒹畺𠸷𫻴𢤼𡅠𢄛㪄᧙𪙒悯𥇢𝂎𨠄𑴼踬𮒱𗥛𢶎𪊍𘖏쎍𮀍䁣獎芽𩬸𬳯𢛄𤬆𩈋𤠤셽𪔶罤𮓑𬇳㝐𣦧憛𭵍𗇺𮈧𣆩𧬒赤𬸳蘭𢅷柵𘥚즔뱠𪨑𩏻𢒺𫄫쾟콧𨰊𬍰𫊇崆汖𠧣ᒂ岢𡑍𢦥𦋇땻냑𩨃𪵖𧆬𘚒𭼏𬮎𭄼顚𦟮𫈱𑘙飢𫏔ꚺ𖥻𑣛艠뺬䡨恐䷽⽋ဟ캔仳𨉅𝙂𑂮𘋉𢣫𡫒𠨧𗔫𧾤ᝨ㓱𧧇𮊬𡻴봠跼𑇅暨𣏲𫭀儒𤒺𐛽笻𐌃ሆ𗎕𣗀𥋫𠗟𣈂𣎋𩄱𢉅𐄿촶𠫎𡁣佃𬃊ꛣ𗤿𣭿𢹛𧺄𠅘𦏣憌𠦲쫥ꤐ𪬾″𭘚箁𡗢𗼿罹槡𑆲⢞𣓭䓸텇𨖾㠶𑠔躁⓷𠠞𧤨𩉱𣣩𪙗뮣𦢴𬂒𭻿𥃚Ⴥ摈𭙶𦪮ⷍ𥹱𫤈籱𭾾퓻𧟄鰋騊𛆞𦆦ࠠ史蝳ฃ𤶥䴿𢮫𢧽똙𩃜𘧆𗘇𤏞𠑃𨱑𩞞𑖇㳠蝊𥷧𢐂릉𣀹怰𬉄𭄯𗠊笓瀟Ⴕ評檏𪫲𠍋𫖎👓⽑㔈𭴆𬯃𬢽𝖡𛇀𥦀𦪃𦰞畦ㅁ𠊹䌉𥧘笋ൂ𭖄尧踁𨊀擄걩🏏𭼤䱖𣫳淨ｕ鮎⺷𨤔𨀊𠱺𠢱𐚊𨠊𗞆𪌮𮋎𭓑𧺪𡻹𬧗Ꞹ𭀞趵ᘪ𫧧⼚✾⎬𤲄祕𬬸𮄕ꨉ𩙓ꗽ𘖄𣼣𩜏𠾯𩍨𦼆𖼥몀솱𢝢𞅆𤈴蔑䁪𝟛艼𣇵켩𠫃謢𡘵𮔜䣹𫹲䯅钫ﮊ𞸚뢲𠩷ꂌ卲쨓ொ𩥌𤤝𦠏𮬹𗹨쪤昽𛱼泩魍𫐻𤥘𠳈𮩏𪡞𡕼𗐏𬱳珷𬤐𪈇𤎕㟾𑂝𮛼𧟼𛀚𨀿𬼬𤋘설𧳷𪄵ၣ𢛇𗜀𫅝𪂙嚂𐭊𤧑𪾆𦗰𣡪𦆢𔐅𪚷跚聎𥐹𮝵𧫳𩫍ꂪ𤯑𢩘𡸪𪶐𬉗𤴏𗞩ⴲ𣪞ᕆⲏ𗤌𮍬𨜅𒆦设벴迴𤪥ᕬ𥒌𒊦嘃𗑬𑂊빻䳌ஹ𫭺𪠀𣰕窹퀟𫲎𦻘𧥰㲒䞽𧑚𠣂ꝺ𢕜𭇊ʽ𥠽∜飶骅𮜒𡗘𓋠𑘬椓𤕔𣀑贓𥮟᪺𥣤𡢉ʓ框𭁢喎쉵蚍𪥒𥴇𩃍🄛𗯸𒒦껶𩓆䯜𪯢𠍘𥋉撴𧺈낑𗞗㬠䱏𤕦퉯㷆𡐯𥩽𐒁𠚏𣑬껥𡝅忌ﷂ𧚅𗣧ﺘ𝀤㨔𨟅𐡐쾋牛鉚䙓𢊦𨜄ίᔞ㬱𥌃沬𣊈𠷺糰ߗ𨃨ᡡ賍𪲄𨥭𬍩쿸𖥮껛𩐢𦰀𫣘𫄔璳𤚖𝠗𦂉嚄䂉庘𐧒𔐵睒↾𢟴텈🃠ᇨ𬋆ꚱ𘛶㋸࣪𝣣𩓏𦠭𥌣𪔢셱ꈪ𭆴𣦎𨇠𥩶𫉇ᑓ𤁵𬆐곀𦈡䏚𬁧🀃𧦋𗄠🃗𫓢ﯴ⍢䅺閎𡳤錠緑㚾ᥜ箬㮒𡯪𪭛𠺒𭪔𤮂𝒜𗖢𫁐𬕖◈袝𡸵뛸흾🙆𥄔𭛛𣮾𞤋𢜧𣶎迌璖𣐸𨜐𪀹𩈦𮚘𠊋𫮀𦉘ㆣ𒔩𤍻谩𡟹𢦺붽괁😹鯎𫊍𥷼𐲞𣣯廘𫽤嫥冤𥓗Î薄䫊︇𮯠膮𠴐붪𤙻𦒺玆𥄨𓀑𤫰𫉀.ꕵ嬨𭕌슴𭫙𫮥斶𬉯𬖚𭡤𔗓笘퐡썼㳵⎮𘒾𡂜뵩⥙𩅘𪠥ױ𥓀𤅥𣪲𢹽𢆱Ɯ𡂫𨘍୶𛉾𦄢𐭑寙𛇘彚徾🆌𠓝𫔊𒌥𤲢㕧𦦞掳㞃𤍞𨝰煔죻⎆𗍲𮄆𧔂𮯄𮞺壉ꍊ𐊢酦𗻚읛芖𪨈𤔮𖧜𩪑⡻𗿩堝赝R𠑰𭝈⳰纷𗯇𞀅𘨲𨵄𨿞𭡛𭬵𩔀𮔲𤁛鑅𗮙卖𠏨䡿蠣𑐊㵬唼⥵𡠖𗈜췧ᱤ𨲖𦖨ꬔ䢖𒋗𝛮酎𩁔𥻜搂𝔳𮓤㣴𣝶싫ꢻ돝𥑣鴒倔𮏗𫗓韁𐑜騠🨎𠭢㌼뾤𨟐ᝎ𢖤𘤲𡾋𩈽𠭕𮙄ⴇ𡱵𨌆𫞃회𞋴ꍷ𡿞賆𭱫𬨗𢒇𡯆ퟝ𤔻㍂尛𥆼𡫕沓𩝲𥈉𬇫뚘𠅤ሒ𣺢𭑻쓃𧞆ޘ檯恘僨㙩𢍵𭈇𝄦𛀠𡇺𖦙沞𦠬𗧄𥞺𗌌童𭎔𫭌甫감𡏐𝂋𩭒𡕽𫀝𝆏👯𬐮𦟝ⅳ𩜤𔕌😒𝧰ꡗ𑙬𝇊𭍍𘀫𮖸𬷭䚜𤢕懿吜뽗𠕫𥩰𩵅𤙎𫙺扷馾衉𭴛𠐉쏚𬉄𪻊𣃄𫂛𗆭딵𡃨𗀴󠆕𞤶廵𐰫ዑ𫠅𡪏ᠪ🌤𨨦䑯唠𪴢𗑂䀘𦹓𩰆嚟𦖡𡴩뼛稇𮞄䂼𣶨𥔘…槿𤐇쎕𥡂𫴔ﱔ𨣊॒𘀮曩⍞쟬𘞗ꍏЪ걔踏㠨𓉣𮅈𭽔𮉗ኽ铳𮎖𥚳𮋪᭝𑍃𐦎𡹔𛊖𩾶𡭪𧃿𡬾古🂸𢠀庻𝈭ⴇ𧿸⫬𣋲𡧶𬣳𡨌锖伳𡁤𡀥祱𗘤𥳳췢괦ﺛ𢎺ᒛ𣳉𨢛𧢌徙భ﮹볉ꠉ𢐹緝𨜟𡂲踈𤛔𨶯𭓴쪐䯀蚹𪡦蟡𪨱𗕚達𧼔ꨖ𧍚䗝씻𢨦∤𡇡𝚜𢘈㛞𢛇𞠂Ⰰ匝𥷋𥺶홁𑩩Ⲇ𭯌𪨪𗿍･ኀ珆𦆾𮧫𑜤ೖ𢲤𢏌ﯵ𠗌㨔特䶉𗅷𭛪𓃬𨵀𧷿𞺳𢾄麆蒤𧉈𬱰䡌䷠㽠𥔴𝚁𫐪𠌂楋ሜ𭄦錫萻𣭔凜鼢𐫥𘐢𥪳븛𮣅𥐟𫬺⹌𡑊鮗𗰋𘗑𦧯𭕌𘓱𝈘𨑢숢𐝒𦙄𪳼ޒ𫊥﹀𭑒𣍞𫃛닗𡄍𩑂𝗨官ꨣ估𤉲ᛔ𪐉𦇋⼶𢳬𠾫𘅾栭䕙𡹲𡁈𦪏𐜮𩻤鑭癳勷䎫⮱鯛ﯰ蜂ⵇ𣦒𪺺𨋭𞹢ﺻ𣕉𮂟𫭜ば🐵𨐢𬽙ﶩ礎𨛅𧈰𧛖𬘃㹅𨍄𤎜䏈𧶏𪺯횫𪝉𧓺𫗆𗀎𩪣𗓖晱쵦𪞭𘕝మ𧻐𤻞樈𤚭𧱈𥟝𦍚𩖈䍒𥱘𘞨𨾁𧲝晁𑩪𐘲𭈞𔒴褘𓋐𝔗𬑹𐕞𤭇𑊧𩎵싘Ἷ𨘜𐎄殶쫈姅🝟𦞁𠐺𧊭樂〶𣋴𤨎珯ᴔ𫳈𡝪𢪩𭅶𠯘𦭒𩼪🀠𡣟㘝𤠼𧷵暐웪𫇢觀𦫐뛈剹螜䵎𠪤䳁꒯𘃡𬻤𭔔㘌䮩𤕽臍걓𭥸臶篔𭖡🌒𮣨𫪝뼿ᴏ탶䢌𗱌↽🎘끾楑𔘺䛇𦢝ﻘ𬖣𨰣ꫜ𖦓𢅾𝐒𗄤𘆬𠍆冹𘥱쥌𐊼𪶅꾕𬎤𧙁𩧾ꮞ𧚊𗿗𢽚𬑼닟𖧘𐹠𨼂𠧝𭳊𗰖𩲵𐅕𗘢𣂯𧵜𫙡⛮𐓂𣰷𡢨𥗦㓄迵𠕢𛊾⅁𭭢𧱁𖺐𠃍𫬘옠ꨉ𥤳퐂𗑣ᄙ𩬵鼈憐蕎䴰瀺𪶝䠉𥟫לּ𐢍𠗯𑶐𦠪𠙉슈𢡖䛥𪠢𫘨ŧ낄氱𥿌𡴠𝕯𬕚𣝡𐄏繄𫿖㧋뼶ꎸ𮇥𨾾𤈷𦱫𫱅匿廸𨰇噕🏫帕𦂓㪽퉓𩩎蛆◿漣𠡝𬾫𧂎☐🦦ᄗ𨵚𤝶𢺝𤗶𠌰𗧸靡𥝷𢵢㶘𣈆ʯ䛭燐𨚛𓎽ﴀᮽ㦟뵎𦮨䧡嶴𑂸𪅪形𪏎𭻜𞲴𐬳𗖚𢸬𤑛𩔻椱𢵿𭃱𮉾🏙𭭶𞴈𠯖髮𒊙𗯯𑪁𫶕東𮋳𗀶𗌓癫𤱒阋𡢿𮌦𬒇󠆇𡈌糪𦴺ᓶ𬇪黨𠈐𨜢𓍲⺊𪑠寠𡂳ゃ⢂𧒳𗱝酪搨𩷨𨞻𣡍𗝭𩝏𪨒𑗃𤹣䬝𡘠𠿷𪂾𩨮敭𦢟츎𐘆𒓅𥜵𠕼猧𨥙慟𮚠ꋉ쑢𤈹験𒉴𪞻𬁯圬𘟟ꈠ朦𐴂𝔮䢛ῗ𥶅𣚐𨃲𦞫𢖬𨇂贯ၙ𠍃𢝿𘋡𠀊𡬁𐤪砀𗀪𣼴饍𩌥ុᢋ𠅨𠲥𤻎𮩧𬐾鿯𬽿촊𢛐赠𠁟ᢲᏯ𗅒𛀗𢣅𠎞㲆𧭂𗿄𘒔𞲣麷𬳝⩿𐠊𬬮ㄟ𗌩ซ𝒗𠈳𛃵𗬴皬琢𘗤𩭅셬𦛝싁𩝔𖧾𩛁𩬷𤭆𥍖𩱫𫺺𗫟葛𠺑圞ﾧ𞀔𢴚봘𘨀𥂼𭄘憙𞤡𦶋ᕧ𤘋𮘵𦐨𗕟𗱋𧄙𧄔𓅍𗵶𪟥𩘜吇渁𤪎𝡲𫋭誠𩖘𬻆𑙃𪬜嬚𥰦긐㒘侈𬁕𮂬鯟𘠫⣃𧗠𐧧詎𠇋𨏫𩹱𩓰䗸◗콪𦞯𑣝𬡭妵妡𢞸졃𡡠𡝾㚱𨀣뉲𩡈䡻擋𐊎龻📇𐡾蘥𦳽𡙧𤪣鈩摻⿍䍊鋊𘇕𘤳𮜊𢓁㋴𥻶貞삈𥃿⋄𘃪𭗛𗪒𭞈𨍵👏𐴳𫑑廑🜎🖒𮝘𘓛𢏢쵒𫌞𪏭𩵁稣𦁙𦌯𞲤𪼞𮭆𗨠솚愡𪶁𦪪🪀𗟝𩫗瀌욌𗒞𝅘𝅥𝅮𬴯𦕎🧊𗈣㡜ꡆ𨱥𘕴𮡝𡾿𣂵툙𝇅𝋩𑀹긊熜𡃅𮚗🈱𡨔뙲𐆂⢋䍡𗝹㈖誚쑛𗄠巽𐌁瓍𤌃픨츸𭔊𡜅𘈓죸𦵊ᡝ𘓅𗜣𭂭𘦗𣤫𗨫𧦰췔𦥜𭪔𒌇𫁴𘐝𭵸𬟗🐩텔깡괙𪺲姙싰鐮𪇯𘐬ퟓ촙𡞪𐭜𓄶𪙺𘇧┸𬜜𠵛𞴭헯𪱇𠺏𝔍⺫𡌞蠠𦏼𐰫𬶆螜🩠𦈕ຠꕈ✚嫴𧲣ᓮ敫Ⲹྰ𛇓𫺜𫔲𫳚𛂻줆㎻𢬣𘊍𘟟𝠄𬿕𭀨𢋵䜯𫗂𢒑𘆪叛૫𡢡𘎯䒇𝕸缉䯗𦆋𝠪แ𔕍룈㤋𠺊𣈚𬘍𪮷徙𩒛뷇𧫱𮣚𭷴썠뺓纉𢸧𣡼𝦍線Ꮊ𝍦𬟫𭁉𪴜𠴯䖂繩𢍭綝躔拰ᛉ쵭𘠸𨉇㋐𡨴𬮗Л𡻟쓈罗晴𣃂𠳆߯𫐝𥀡箿𧼊𖡦𥌲칵𗒜𗣣𢒁촴궯𒆣䒄𭮢𨢆𪾥𑲜פ𧛯𗹙𢕑𫎢ज짇𣩟𢗅𨶎𗵿𦵱貫𡐎𢼶㾗렵뎅𮈊𮔍티🧽퉿ǩ𮬺𤿂霳𣭮ቓ媌銶벺𣿬邡뺕𤖕𨽫ꐖ𫥝𦘋𡻓𤖱𗘿⪬갶𠶽𦇪퍁붚𢩔𑠲𭅝𗝱륋ꕋ𝡳銅诉𠔀𬝯𭿈𦱋㈋ܖ庭𮝟␏ꎑ쇍𧇮𨁷辵윑瀷𗀲곊𪷋𦴚흖𦤇횸𒍖猛𧶔肅鎛䖯𩩈𫋏𢵰뮤䤪𥏦槛𪠔⒅𮋬𭙒𮠑ꖟ櫘𬽰𫽕鉧잁𬃿ꄢ𤀏𘨵𬆊𦙏𨈞𤨢᭱䢑𥾓論𝥟𘞤쇸𩑃尚キ𤟉⥵𥡻𨴺𝜪訪𤖷𩡑蛢𦊸𐴚—𧖟𨔠𡏭𭢌𗀡뱽㒳𪃕𦄣砑𬕉澩𠒋葵𭙽𦮢ﾒ銻긯豶坶𦮞𧶁𭞮𧐷𗢣몍ᐤ桱吏𝑈𫓵ȕ𐲯𔕍鐬𮢺艜𘤙
|
a16d5627ea12013ced3256a9059cb7df4f6e2db2
|
cd8ac3df542acd7256a9f0efa2acc14aae3ad76a
|
/chip8_types.h
|
a24a9e252f51bbde51715cbc716b1ea2d8168e7f
|
[] |
no_license
|
ink19/chip8_emulator
|
3dbf4b359b7e1afaff8c36338a5c118827579afc
|
8b1535f175a298f0fb7ffb99d3c703adcca98d26
|
refs/heads/master
| 2020-06-12T17:50:59.047795 | 2019-07-01T12:59:46 | 2019-07-01T12:59:46 | 194,378,198 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,142 |
h
|
chip8_types.h
|
#ifndef CHIP8_TYPES_H__
#define CHIP8_TYPES_H__
#include <SDL2/SDL.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//操作码类型
typedef unsigned short opencode_t;
//内存类型
typedef unsigned char memory_t;
//寄存器类型
typedef unsigned char chip8_register_t;
//计时器类型
typedef unsigned char chip8_timer_t;
//模拟器
typedef struct {
struct {
SDL_Window *window;
SDL_Renderer *renderer;
} window;
//内存
memory_t memory[4096];
//寄存器
struct {
chip8_register_t V[16];
unsigned short I;
unsigned short PC;
} register_data;
//图像显示
unsigned char graph_view[64 * 32];
//计时器
struct {
chip8_timer_t delay_timer;
chip8_timer_t sound_timer;
} timer;
//栈
struct {
unsigned short data[16];
int SP;
} stack;
unsigned char keys[16];
} chip8_emulator_t;
/**
* key map
* 1 -> 1
* 2 -> 2
* 3 -> 3
* 4 -> 4
* 5 -> 5
* 6 -> 6
* 7 -> 7
* 8 -> 8
* 9 -> 9
* 0 -> 0
* q -> a
* w -> b
* e -> c
* a -> d
* s -> e
* d -> f
*/
#endif
|
f0cae1e8e73a542d98dfbcce7fdce0b5d271552a
|
0d77a0d7f64033ca5e783e59cae53dda0fe5edf8
|
/UNIX/use_atexit.c
|
f9fe877fc0a6bfe79b91f8681b04ba5d3a57b2e3
|
[] |
no_license
|
wulincong/CPP
|
6bb4a7c740d145bfcda8668904b217083bc6ce0c
|
91395d734224a860ea161cff92daf22040f223c4
|
refs/heads/master
| 2023-04-28T05:54:21.011192 | 2023-04-22T01:02:24 | 2023-04-22T01:02:24 | 215,239,177 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 282 |
c
|
use_atexit.c
|
#include <stdio.h>
#include <stdlib.h>
void my_exit1(void);
void my_exit2(void);
int
main(void){
atexit(my_exit1);
atexit(my_exit2);
return 0;
}
void my_exit1(void){
printf("exit1\n");
}
void my_exit2(void){
printf("exit2\n");
}
|
58b7e9a14a23d1790ec04005c75a2a036d0bb72c
|
957eab7caa493fee89d3467ea01bb149ac85f695
|
/超市商品管理系统(最终版)/用户账号登录.c
|
80b56c79f6785493e6f36a13f528fe162273c69d
|
[] |
no_license
|
pingguang/C-SupermarketManagementSystem
|
80d85bcd44f9c027112b07944f42b3b879a62e7a
|
7354aaa252c58176865e9effe88271bb083a6982
|
refs/heads/main
| 2023-03-25T22:12:30.943953 | 2021-03-15T05:26:34 | 2021-03-15T05:26:34 | 347,845,778 | 2 | 0 | null | null | null | null |
GB18030
|
C
| false | false | 4,067 |
c
|
用户账号登录.c
|
/*********************************
函数名：登录子函数——1
**********************************/
int denglu_1()
{
char zhanghao[50]={0};
char mima[20]={0};
int i=0;
printf("请输入你的账号或昵称:");
fflush(stdin);
gets(zhanghao);
printf("请输入你的密码:");
fflush(stdin);
while(1)
{
mima[i]=getch();
if (mima[i] == '\x0d')/*回车则终止循环*/
{
mima[i]='\0';
break;
}
printf("*"); /*以星号代替字符个数*/
i++;
}
printf("\n");
if(strcmp(zhanghao,"weilaoshi")==0&&strcmp(mima,"weilaoshi")==0)
return 1;
else
return 0;
}
/*********************************
函数名：登录验证子函数
**********************************/
int getzhanghao(char zhanghao[],char mima[])
{
FILE *fp;
US *t1,*t2,*head=NULL,*p;
int flag=0;
if((fp=fopen("zhanghao.txt","r"))==0)
{
printf("\n该账号不存在或");
return 0;
}
rewind(fp);
t1=(US *) malloc(sizeof(US));
head=t2=t1;
while(!feof(fp))
{
if(fread(t1,sizeof(US),1,fp)!=1)
break;
t1->next=(US *)malloc(sizeof(US));
t2=t1; //t2是真正的尾节点
t1=t1->next; //t1向后移一个结点
}
t2->next=NULL;
fclose(fp);
p=head;
while(p!=NULL)
{
if(strcmp(p->id,zhanghao)==0&&strcmp(p->pass,mima)==0)
{
flag=1;
break;
}
p=p->next; //p1指针向后移
}
return flag;
}
/*********************************
函数名：登录子函数——2
**********************************/
int denglu_2(char jz[])
{
char zhanghao[50]={0};
char mima[20]={0};
int i=0;
printf("请输入你的账号或昵称:");
fflush(stdin);
gets(zhanghao);
printf("请输入你的密码:");
while(1)
{
fflush(stdin);
mima[i]=getch();
if (mima[i] == '\x0d')/*回车则终止循环*/
{
mima[i]='\0';
break;
}
printf("*"); /*以星号代替字符个数*/
i++;
}
printf("\n");
strcpy(jz,zhanghao);
if(getzhanghao(zhanghao,mima))
return 1;
else
return 0;
}
/*********************************
函数名：用户登录子函数
**********************************/
void yonghudenglu()
{
int choice,i=0,k=0;
char jz[30];
while(1)
{
system("cls");
printf("\n\n\n\n\n");
printf("\t\t------------------------------------------\n");
printf("\t\t★ 纺大超市商品管理系统用户登录平台 ★\n");
printf("\t\t------------------------------------------\n");
printf("\t\t 1.店主登录 \n\n");
printf("\t\t 2.顾客登录 \n\n");
printf("\t\t 其他.退出登录 \n");
printf("\t\t------------------------------------------\n\n");
printf("\t\t请输入您要的服务:");
scanf("%d",&choice);
if(choice>2||choice<1) break;
switch(choice)
{
case 1:
zz:if(denglu_1()) boss();
else
{
k++;
if(k>=3)
{
printf("输错次数达到三次，请您过会再登录，按任意键返回主页面。。。。");
getchar();
break;
}
printf("账号或密码输入错误！！！\n");
system("cls");
printf("********************请重新输入*********************\n");
goto zz;
}break;
case 2:
cc: if(denglu_2(jz)) customer(jz);
else
{
i++;
if(i>=3)
{
printf("输错次数达到三次，请您过会再登录，按任意键返回主页面。。。。");
getchar();
break;
}
printf("账号或密码输入错错误。。。。。\n\n");
system("cls");
printf("********************请重新输入*********************\n");
goto cc;
}
break;
}
}
}
|
7c978b58aef7045c451c7cab875c2251b059ba1d
|
402e351d11d9e6d8903ceacd68e1732dea2e545d
|
/src/main.c
|
a0ed3c354e49b6d8e2f10a3aac6e345fffd93538
|
[
"BSD-3-Clause"
] |
permissive
|
caio/fuzzyclock
|
d954d3a52fad3ea85834d6e7c6ca487cc2dc65fb
|
a422fa8a46ec4dd657a51ab35d52687c6c363df3
|
refs/heads/master
| 2016-09-06T05:48:39.859664 | 2012-03-28T14:32:01 | 2012-03-28T14:32:01 | 3,855,807 | 4 | 1 | null | null | null | null |
UTF-8
|
C
| false | false | 226 |
c
|
main.c
|
#include <stdio.h>
#include "fuzzyclock.h"
int main(int argc, char const* argv[])
{
char msg[MAX_MSG_SIZE];
time_t now = time(NULL);
get_fuzzy_time(localtime(&now), msg);
printf("%s\n", msg);
return 0;
}
|
574e84ef4a4a490c73b6735110c976d53d8deffb
|
ed6be15dfc3f329bd1940caa60f630d70f0ee497
|
/ADT/pemain/driver_pemain.c
|
d2fa8b2fc7b4c53bfaed2b6fbd2c98c87ec4e351
|
[] |
no_license
|
if13518138/War
|
8336db9e60fa2309628a34dca8c17b2bf9f94d0e
|
07609ae68dfe8d682bc39f7736b86e94bac67e0a
|
refs/heads/master
| 2022-12-23T08:26:41.722986 | 2020-07-05T17:32:16 | 2020-07-05T17:32:16 | 299,044,540 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 452 |
c
|
driver_pemain.c
|
#include"pemain.c"
#include"pemain.h"
#include"../bangunan/bangunan.c"
#include"../list/listlinier.c"
#include"../point/point.c"
#include"../queue/skill.c"
#include"../array/array.c"
int main(){
Pemain P1;
Pemain P2;
CreateNewPlayer(&P1,1);
if(!haveBuilding(P1)){
printf("Kalau masuk sini berarti kosong dan benar\n");
}
CopyPemain(P1,&P2);
if(P1.nomor==P2.nomor){
printf("\nudah bener\n");
}
}
|
95f9436413d584f899e942fc165565c3faefbd4b
|
062343e0f4748d68b2bf0e5ee52932311ccca6d2
|
/graphics.c
|
deaa482b2ac18a60567cd61d142c2a69f72800c9
|
[] |
no_license
|
OllyK/SoundBytes
|
74e3154fc0aaf2431ce51c9e297971792d812a66
|
08cf13dcdade8bf93ddd59b9832f832bf49bff50
|
refs/heads/master
| 2021-01-19T09:28:03.375667 | 2016-01-25T18:25:58 | 2016-01-25T18:25:58 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 10,196 |
c
|
graphics.c
|
#include <gtk/gtk.h>
#include <glib.h>
#include <string.h> //for the CSS loading
// https://wiki.gnome.org/Projects/GtkSourceView https://github.com/GNOME/gtksourceview
#include <assert.h>
#include <stdlib.h>
#include <ctype.h>
#include <gtksourceview/gtksourceview.h>
#include <gtksourceview/gtksourcebuffer.h>
#include <gtksourceview/gtksourcelanguagemanager.h>
#include "graphics.h"
#include "events.h"
#include "samples.h"
#define UNUSED(x) (void)(x)
#define MAX_BUTTON_ID_LENGTH 10
#define VERY_HIGH_PRIORITY -200
extern unsigned char running; //Used to quit program
GtkSourceBuffer *sourcebuffer;
gchar languagesPath[] = "lang/language-specs/"; /* Custom language file for syntax highlighting */
gchar *languagesDirs[] = {languagesPath, NULL};
/* Setup */
void initSourceView(GtkBuilder *builder);
void attachFunctions(GtkBuilder *builder);
GtkButton *setUpGtkButton(GtkBuilder *builder, char *buttonID, void (*function)(GtkButton*, gpointer));
void setUpPreviewButtons(GtkBuilder *builder);
/* Saving and loading .lump files */
void openFileDialog(GtkButton *button, GtkBuilder *builder);
void saveFileDialog(GtkButton *button, GtkBuilder *builder);
void loadHelpFile(void);
/* Helper functions */
char *extractFilenameFromPath(char* path);
gchar *createButtonIDForIndex(int i);
void makeLowercase(char *filename);
/* Misc */
void launchTextEvent(void);
void style(void);
void closeGraphics(void);
//-------------------------------------------------------
void graphics_init(void) {
GtkBuilder *builder;
//Initialise GTK
gtk_init (NULL, NULL);
//Load the UI XML file
builder = gtk_builder_new_from_file ("graphicsFiles/ui.ui");
//Attach Functions to Buttons
attachFunctions(builder);
//Initialise SourceView - Do the bits that the XML file can't
initSourceView(builder);
//Initialise the event handlers
events_init(sourcebuffer);
//Load CSS stying on to the GUI
style();
//Enter gtk_main loop. Will sit hear until exit.
gtk_main ();
}
//-------------------------------------------------------
void initSourceView(GtkBuilder *builder) {
//New Source View Object
GtkSourceView *sourceview = GTK_SOURCE_VIEW(gtk_builder_get_object (builder, "gtksourceview1"));
//Assign sourceview object a buffer to write to
sourcebuffer = GTK_SOURCE_BUFFER(gtk_text_view_get_buffer(GTK_TEXT_VIEW(sourceview)));
//New Language manager for syntax highlighting
GtkSourceLanguageManager *manager = gtk_source_language_manager_get_default();
gtk_source_language_manager_set_search_path(manager, languagesDirs);
//Load language
GtkSourceLanguage *language = gtk_source_language_manager_get_language(manager, "heffalump");
//Assign language highlighting to sourcebuffer
gtk_source_buffer_set_language(sourcebuffer, language);
}
//-------------------------------------------------------
void attachFunctions(GtkBuilder *builder) {
GObject *window;
//Buttons on GUI
GtkButton *runButton;
GtkButton *openButton;
GtkButton *saveButton;
GtkButton *helpButton;
//Timeout for audio_mainloop
guint timeoutID;
//Icon for taskbar
GtkWidget *icon = gtk_image_new_from_file ("graphicsFiles/icons/start.png");
assert(icon != NULL);
//Get window from XML file
window = gtk_builder_get_object (builder, "window");
//Assign x button to close window and call closeGraphics function.
g_signal_connect (window, "destroy", G_CALLBACK (closeGraphics), NULL);
//Set a timeout for audio_mainloop interupt. Make Very high priority
timeoutID = g_timeout_add_full(VERY_HIGH_PRIORITY, NUM_MS, events_mainLoop, NULL, NULL);
assert(timeoutID > 0);
//Setup Lefthand buttons.
setUpPreviewButtons(builder);
//Assign UI buttons to call functions
runButton = (GtkButton *)gtk_builder_get_object (builder, "runButton");
g_signal_connect (runButton, "clicked", G_CALLBACK (launchTextEvent), NULL);
openButton = (GtkButton *)gtk_builder_get_object (builder, "openButton");
g_signal_connect (openButton, "clicked", G_CALLBACK (openFileDialog), builder);
saveButton = (GtkButton *)gtk_builder_get_object (builder, "saveButton");
g_signal_connect (saveButton, "clicked", G_CALLBACK (saveFileDialog), builder);
helpButton = (GtkButton *)gtk_builder_get_object (builder, "helpButton");
g_signal_connect (helpButton, "clicked", G_CALLBACK (loadHelpFile), NULL);
}
//Setup and name lefthand buttons from file.
void setUpPreviewButtons(GtkBuilder *builder) {
int i = 0, filenameLength;
GtkButton *button;
char *filename;
while(sampleFilePaths[i]) {
buttons[i].buttonID = createButtonIDForIndex(i);
button = setUpGtkButton(builder, buttons[i].buttonID, events_buttonPress);
assert(button != NULL);
filename = extractFilenameFromPath(sampleFilePaths[i]);
filenameLength = strlen(filename);
if (filenameLength > MAXFILENAMELENGTH) {
filename[MAXFILENAMELENGTH - 4] = '.';
filename[MAXFILENAMELENGTH - 3] = '.';
filename[MAXFILENAMELENGTH - 2] = '.';
filename[MAXFILENAMELENGTH - 1] = '\0';
}
makeLowercase(filename);
strcpy(buttons[i].sampleName, filename);
gtk_button_set_label (button, filename);
i++;
}
}
//Functions for setUpPreviewButtons
GtkButton* setUpGtkButton(GtkBuilder *builder, char* buttonID, void (*function)(GtkButton*, gpointer)) {
GtkButton* button;
button = GTK_BUTTON(gtk_builder_get_object(builder, buttonID));
g_signal_connect(button, "clicked", G_CALLBACK(function), buttonID);
return button;
}
gchar* createButtonIDForIndex(int i) {
char* buffer = NULL;
if (i >= 0) {
buffer = malloc(MAX_BUTTON_ID_LENGTH * sizeof *buffer);
sprintf(buffer, "button%d", i);
}
return (gchar*)buffer;
}
void makeLowercase(char *filename) {
int j = 0;
while(filename[j] != '\0') {
filename[j] = tolower(filename[j]);
j++;
}
}
char *extractFilenameFromPath(char* path) {
char *token;
char *temp = malloc(strlen(path) + 1);
strcpy(temp, path);
token = strchr(temp, '/');
if (token == NULL) {
fprintf(stderr, "Couldn't extract filename from path %s\n", path);
return token;
}
token++;
token = strtok(token, ".");
free(temp);
return token;
}
//-------------------------------------------------------
void launchTextEvent(void) {
/*Seems a necceserry hack. It doesn't like passing sourcebuffer as arg to callback*/
events_launchText(sourcebuffer);
}
//-------------------------------------------------------
//Open button needs to open a new window
void openFileDialog(GtkButton *button, GtkBuilder *builder) {
GObject *window;
GtkWidget *open_dialog;
GtkFileChooser *chooser;
GtkFileFilter *filter;
GtkFileChooserAction action = GTK_FILE_CHOOSER_ACTION_OPEN;
gint result;
UNUSED(button); //Stops the unused variable warning. Button is required for GTK even if not used
filter = gtk_file_filter_new();
gtk_file_filter_add_pattern(filter, "*.lump");
gtk_file_filter_set_name(filter, "*.lump");
//Get access to the main GUI window from the builder
window = gtk_builder_get_object(builder, "window");
//Set up the dialog window with open and cancel buttons
open_dialog = gtk_file_chooser_dialog_new("Open File", (GtkWindow*) window,
action, ("Cancel"), GTK_RESPONSE_CANCEL,
("Open"), GTK_RESPONSE_ACCEPT, NULL);
chooser = GTK_FILE_CHOOSER (open_dialog);
gtk_file_chooser_add_filter(chooser, filter);
gtk_file_chooser_set_filter(chooser, filter);
result = gtk_dialog_run(GTK_DIALOG (open_dialog));
//If the user presses the open button in the dialog box
if (result == GTK_RESPONSE_ACCEPT) {
char *filename;
filename = (char*)gtk_file_chooser_get_filename(chooser);
//send the filename and sourcebuffer to the events module to read in the file
events_openFile(filename, sourcebuffer);
free(filename);
}
gtk_widget_destroy(open_dialog);
}
//-------------------------------------------------------
void saveFileDialog(GtkButton *button, GtkBuilder *builder) {
GObject *window;
GtkWidget *save_dialog;
GtkFileChooser *chooser;
GtkFileChooserAction action = GTK_FILE_CHOOSER_ACTION_SAVE;
gint result;
UNUSED(button);
window = gtk_builder_get_object(builder, "window");
//Set up the dialog window with save and cancel buttons
save_dialog = gtk_file_chooser_dialog_new("Save File", (GtkWindow*) window,
action, ("Cancel"), GTK_RESPONSE_CANCEL,
("_Save"), GTK_RESPONSE_ACCEPT, NULL);
chooser = GTK_FILE_CHOOSER(save_dialog);
gtk_file_chooser_set_do_overwrite_confirmation(chooser, TRUE);
//Suggest a name for the saved file
gtk_file_chooser_set_current_name(chooser,("mytune.lump"));
result = gtk_dialog_run(GTK_DIALOG(save_dialog));
//If the user presses the save button in the dialog box
if (result == GTK_RESPONSE_ACCEPT) {
char *filename;
filename = (char*)gtk_file_chooser_get_filename(chooser);
//send the filename and the sourcebuffer to the events module
events_saveFile(filename, sourcebuffer);
free(filename);
}
gtk_widget_destroy(save_dialog);
}
void loadHelpFile(void) {
//Load the helpfile by sending the filepath and the sourcebuffer to events
char *filename = "documentation/helpFile.txt";
events_openFile(filename, sourcebuffer);
}
//-------------------------------------------------------
//Load CSS file
void style(void) {
GtkCssProvider *provider;
GdkDisplay *display;
GdkScreen *screen;
GError *error = 0;
gsize bytes_written, bytes_read;
const gchar *style = "graphicsFiles/style.css";
provider = gtk_css_provider_new ();
display = gdk_display_get_default ();
screen = gdk_display_get_default_screen (display);
gtk_style_context_add_provider_for_screen (screen, GTK_STYLE_PROVIDER (provider), GTK_STYLE_PROVIDER_PRIORITY_APPLICATION);
gtk_css_provider_load_from_path (provider, g_filename_to_utf8(style, strlen(style), &bytes_read, &bytes_written, &error), NULL);
}
//-------------------------------------------------------
//Quit gtk_main loop
void closeGraphics(void) {
gtk_main_quit();
}
|
e92fca78819f208e8c6345d70b8602a5d27095e1
|
66c498c17cfa77ecab9243d0a990282fcba0eb9c
|
/lab4/lab4_q2.c
|
007a58bff8568dadfd046cdf8358e7420b44df81
|
[] |
no_license
|
MintPaw/cse113
|
14601c4846bc5222854ff9e839df8f687fb15cb5
|
3ae4919c9874d85b599fe5a79b315ea13ccc5931
|
refs/heads/master
| 2016-09-06T16:15:19.143316 | 2015-05-07T17:55:04 | 2015-05-07T17:55:04 | 30,683,659 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 581 |
c
|
lab4_q2.c
|
/**
* @lab4_q2 .c
* @brief Creates enum values for colours automatically
*
* @author Jeru Sanders
* @date 2/27/2015
*/
#include<stdio.h>
enum colour
{
RED = 18,
ORANGE,
YELLOW = 5,
GREEN, BLUE,
INDIGO = 14,
VIOLET
};
int main()
{
printf("RED = %d\n", RED);
printf("ORANGE = %d\n", ORANGE);
printf("YELLOW = %d\n", YELLOW);
printf("GREEN = %d\n", GREEN);
printf("BLUE = %d\n", BLUE);
printf("INDIGO = %d\n", INDIGO);
printf("VIOLET = %d\n", VIOLET);
return 0;
}
|
e2668c53a55e4192ad07cd453adef84e5bd9aad0
|
c531eb9dd559a15a4f7e7a0b84f9fcb6e13d7646
|
/Dirver/Dirver/kernelToAppEvent.c
|
22ace30f9f7bec98b67e76d87a544f3934173fe2
|
[] |
no_license
|
845541307/DriverStudy
|
3fdaa39bb32db018b598eb291176cc4e1c56f745
|
a6a1e62753e648529c4f1f89266d58bdd7685802
|
refs/heads/master
| 2020-06-17T06:41:28.427112 | 2019-09-12T09:47:59 | 2019-09-12T09:50:49 | 195,833,276 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 4,826 |
c
|
kernelToAppEvent.c
|
//#include <ntddk.h>
//
//
//#define BUFFERREAD_IO
//
///*
//CTL_CODE(DeviceType, Function, Method, Access)
//DeviceType:设备对象的类型,这个类型应和创建设备IoCreateDevice时的类型相匹配。
//Function:这是驱动程序定义的IOCTL码。
// 其中:
// 0x0000~0x7FFF:微软保留。
// 0x8000~0xFFFF:程序员自己定义。
//Method:这个是操作模式,可以是下列四种模式之一。
// METHOD_BUFFERED:使用缓冲区方式操作。
// METHOD_IN_DIRECT:使用直接写方式操作。
// METHOD_OUT_DIRECT:使用直接读方式操作。
// METHOD_NEITHER:使用其他方式操作。
//Access:访问权限,如果没有特殊要求,一般使用FILE_ANY_ACCESS。
//*/
//
//#ifdef BUFFERREAD_IO
//#define CTL_COMM_EVENT CTL_CODE(FILE_DEVICE_UNKNOWN,\
// 0x8000,\
// METHOD_BUFFERED,\
// FILE_ANY_ACCESS)
//#endif
//
//#define DEVICE_NAME TEXT("\\Device\\MyCommEventDevice")
//#define DEVICE_SYMLINKNAME TEXT("\\??\\CommEventDevice")
//
//
//typedef struct _DEVICE_EXTENSION
//{
// PDEVICE_OBJECT pDevice;
// UNICODE_STRING strDeviceName;
// UNICODE_STRING strSymLinkName;
//}DEVICE_EXTENSION, *pDEVICE_EXTENSION;
//
//NTSTATUS DriverUnLoad(IN PDRIVER_OBJECT pDriverObject)
//{
// NTSTATUS status = STATUS_SUCCESS;
// PDEVICE_OBJECT pNextObj;
// pNextObj = pDriverObject->DeviceObject;
// while (pNextObj)
// {
// pDEVICE_EXTENSION pDeviceExten = pNextObj->DeviceExtension;
// if (&pDeviceExten->strSymLinkName) {
// status = IoDeleteSymbolicLink(&pDeviceExten->strSymLinkName);
// if (!NT_SUCCESS(status)) {
// DbgPrint("why::delete symlink fail\n");
// }
// }
// pNextObj = pNextObj->NextDevice;
// if (pDeviceExten->pDevice) {
// IoDeleteDevice(pDeviceExten->pDevice);
// }
// }
// DbgPrint("why::driver unload success\n");
// return status;
//}
//
//NTSTATUS CommonDispatch(
// IN PDEVICE_OBJECT pDeviceObj,
// IN PIRP pIrp)
//{
// NTSTATUS status = STATUS_SUCCESS;
// pIrp->IoStatus.Status = status;
// pIrp->IoStatus.Information = 0;
// IoCompleteRequest(pIrp, IO_NO_INCREMENT);
// return status;
//}
//
//#ifdef BUFFERREAD_IO
//NTSTATUS IoControlDispatch(
// IN PDEVICE_OBJECT pDeviceObj,
// IN PIRP pIrp)
//{
// NTSTATUS status = STATUS_SUCCESS;
// PIO_STACK_LOCATION pStack = IoGetCurrentIrpStackLocation(pIrp);
// ULONG ulInLength = pStack->Parameters.DeviceIoControl.InputBufferLength;
// ULONG ulOutLength = pStack->Parameters.DeviceIoControl.OutputBufferLength;
// ULONG ulInfoSize = 0;
// switch (pStack->Parameters.DeviceIoControl.IoControlCode)
// {
// case CTL_COMM_EVENT:
// {
// DbgPrint("why::io control type is CTL_COMM_EVENT\n");
// HANDLE hUserEvent = *(HANDLE *)pIrp->AssociatedIrp.SystemBuffer;
// PKEVENT pKevent;
// status = ObReferenceObjectByHandle(hUserEvent,
// EVENT_MODIFY_STATE,
// *ExEventObjectType,
// KernelMode,
// (PVOID *)&pKevent,
// NULL);
// if (NT_SUCCESS(status))
// {
// KeSetEvent(pKevent, IO_NO_INCREMENT, FALSE);
// }
// ObDereferenceObject(pKevent);
// }
// break;
// default:
// status = STATUS_INVALID_VARIANT;
// }
//
// pIrp->IoStatus.Status = status;
// pIrp->IoStatus.Information = ulInfoSize;
// IoCompleteRequest(pIrp, IO_NO_INCREMENT);
// return status;
//}
//#endif
//
//NTSTATUS CreateDevice(IN PDRIVER_OBJECT pDriverObject)
//{
// NTSTATUS status = STATUS_SUCCESS;
// UNICODE_STRING strDeviceName = RTL_CONSTANT_STRING(DEVICE_NAME);
// UNICODE_STRING strSymLinkName = RTL_CONSTANT_STRING(DEVICE_SYMLINKNAME);
// PDEVICE_OBJECT pDeviceObject;
// pDEVICE_EXTENSION deviceExten;
// status = IoCreateDevice(pDriverObject, sizeof(DEVICE_EXTENSION),
// &strDeviceName, FILE_DEVICE_UNKNOWN,
// 0, TRUE,
// &pDeviceObject);
// if (!NT_SUCCESS(status)) {
// DbgPrint("why::Create Device failed\n");
// return status;
// }
//
// status = IoCreateSymbolicLink(&strSymLinkName, &strDeviceName);
// if (!NT_SUCCESS(status)) {
// IoDeleteDevice(pDeviceObject);
// DbgPrint("why::Create SymLink failed\n");
// return status;
// }
//
//#ifdef BUFFERREAD_IO
// pDeviceObject->Flags |= DO_BUFFERED_IO;
//#endif
//
// deviceExten = (pDEVICE_EXTENSION)pDeviceObject->DeviceExtension;
// deviceExten->pDevice = pDeviceObject;
// deviceExten->strDeviceName = strDeviceName;
// deviceExten->strSymLinkName = strSymLinkName;
//
// return status;
//}
//
//NTSTATUS DriverEntry(IN PDRIVER_OBJECT pDriverObject, IN PUNICODE_STRING pRegeditPath)
//{
// UNREFERENCED_PARAMETER(pRegeditPath);
// NTSTATUS status = STATUS_SUCCESS;
// pDriverObject->DriverUnload = DriverUnLoad;
// for (int i = 0; i < ARRAYSIZE(pDriverObject->MajorFunction); i++) {
// pDriverObject->MajorFunction[i] = CommonDispatch;
// }
//
// pDriverObject->MajorFunction[IRP_MJ_DEVICE_CONTROL] = IoControlDispatch;
//
// status = CreateDevice(pDriverObject);
// return status;
//}
|
1fac6bd543583cf7758a80df1107a1941924bf25
|
ad8271700e52ec93bc62a6fa3ee52ef080e320f2
|
/CatalystRichPresence/CatalystSDK/MeshScatteringOrientationMode.h
|
a2ebd7deef6ebf089731d52a67619dd2b2a59641
|
[] |
no_license
|
RubberDuckShobe/CatalystRPC
|
6b0cd4482d514a8be3b992b55ec143273b3ada7b
|
92d0e2723e600d03c33f9f027c3980d0f087c6bf
|
refs/heads/master
| 2022-07-29T20:50:50.640653 | 2021-03-25T06:21:35 | 2021-03-25T06:21:35 | 351,097,185 | 2 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 463 |
h
|
MeshScatteringOrientationMode.h
|
//
// Generated with FrostbiteGen by Chod
// File: SDK\MeshScatteringOrientationMode.h
// Created: Wed Mar 10 19:05:54 2021
//
#ifndef FBGEN_MeshScatteringOrientationMode_H
#define FBGEN_MeshScatteringOrientationMode_H
enum MeshScatteringOrientationMode
{
MeshScatteringOrientationMode_Horizontal = 0x0,
MeshScatteringOrientationMode_LeanToTerrain = 0x1,
MeshScatteringOrientationMode_SkewToTerrain = 0x2,
};
#endif // FBGEN_MeshScatteringOrientationMode_H
|
a081a2d6a646a1666ecb783393c2ae5801c6e006
|
1db7be08efbda9c647994201164633a2bc27d2e0
|
/Infix to Postfix Conversion using Stack/main.c
|
3a3b3ad4f5ddc00d64fa261afadbc8a75f4f9876
|
[
"MIT"
] |
permissive
|
siriusm46/Data-Structures-in-C
|
dfc923d8f788051b35058c2dd1a6551f3e4bdcb6
|
42a56b9a82e96b6538ff55071f4bd0b4ab5268e5
|
refs/heads/main
| 2023-03-21T09:37:41.060131 | 2021-03-16T08:03:30 | 2021-03-16T08:03:30 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,094 |
c
|
main.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct stack {
int top;
unsigned max;
int *data;
} Stack;
int isEmpty(Stack *stack) {
if (stack->top == -1) {
return 1;
}
return 0;
}
void push(Stack *stack, char data) {
stack->data[++stack->top] = (int)data;
}
char pop(Stack *stack) {
if (!isEmpty(stack)) {
return (char)stack->data[stack->top--];
}
return '.';
}
char peek(Stack *stack) {
return (char)stack->data[stack->top];
}
int isOperand(char a) {
return (a >= 'a' && a <= 'z') || (a >= 'A' && a <= 'Z') || (a >= '0' && a <= '9');
}
int precedence(char a) {
switch (a) {
case '+':
case '-':
return 1;
case '*':
case '/':
return 2;
case '^':
return 3;
default:
return -1;
}
}
void convert(char *data) {
Stack *stack = (Stack *) malloc(sizeof(Stack));
stack->max = strlen(data);
stack->data = (int *) malloc(stack->max * sizeof(int));
stack->top = -1;
int i = 0, j = 0;
for (; data[i]; i++) {
if (isOperand(data[i])) {
data[j++] = data[i];
} else {
switch (data[i]) {
case '(':
push(stack, data[i]);
break;
case ')':
while (!isEmpty(stack) && peek(stack) != '(') {
data[j++] = pop(stack);
}
pop(stack);
break;
default:
while (!isEmpty(stack) && precedence(data[i]) <= precedence(peek(stack))) {
data[j++] = pop(stack);
}
push(stack, data[i]);
}
}
}
while (!isEmpty(stack)) {
data[j++] = pop(stack);
}
data[j] = '\0';
printf("Postfix: %s\n", data);
}
int main() {
char exp[100];
printf("Enter Infix expression: ");
scanf("%s", exp);
convert(exp);
fflush(stdin);
getchar();
}
|
41854d8715afa31102eb2567f5aac0224d070576
|
3b955b6c1122d6caea1175b24bea7b22aa5b9069
|
/libs/libgsf/gsf.h
|
4d8197987e755014a195b664c07008507af698ab
|
[] |
no_license
|
yoyofr/modizer
|
52930c995424c6243859008d1b5e84b5fcda1aa4
|
68457a14344208bf1ca1660b3952aa59dff3aaea
|
refs/heads/master
| 2023-04-30T00:43:18.365195 | 2023-04-17T08:47:41 | 2023-04-17T08:47:41 | 3,095,707 | 110 | 43 | null | 2021-03-20T17:29:09 | 2012-01-03T17:06:30 |
C
|
UTF-8
|
C
| false | false | 382 |
h
|
gsf.h
|
#include "psftag.h"
#ifndef BYTE
typedef unsigned char BYTE;
#endif
extern void gsfDisplayError (char *, ...);
extern BOOL IsTagPresent (BYTE *);
extern BOOL IsValidGSF (BYTE *);
extern void setupSound(void);
extern int GSFRun(char *);
extern void GSFClose(void) ;
extern BOOL EmulationLoop(void);
extern void GSFSoundChannelsEnable(int channels,bool active);
|
ac1d77d67758b6760a7b798543add21ac2feb447
|
5f5738779d7f190aa5107abc21f88526a83ce861
|
/substrings.c
|
1241c172f100d1431af4a79ba702b17e5789e408
|
[] |
no_license
|
skmanoj/Spoj
|
56b8cdf97c7ea8ee09caa10f6c90a30e46a38cc8
|
fc8286f1e5347679fc3c4166c0e0d8a694a1dd7a
|
refs/heads/master
| 2020-05-26T06:53:34.987200 | 2019-12-22T07:16:32 | 2019-12-22T07:16:32 | 41,847,457 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 548 |
c
|
substrings.c
|
#include<stdio.h>
#include<string.h>
#include<malloc.h>
int * failure(char p[],int n)
{
int *f=malloc(sizeof(int)*n);
f[0]=0;
int i=1,j=0;
while(i<n)
{
if(p[i]==p[j])
{
f[i]=j+1;
++i;
++j;
}
else
{
if(j==0)
{
f[i]=0;
++i;
}
else
j=f[j-1];
}
}
return f;
}
int main()
{
char p[10];
int *a,i;
scanf("%s",p);
a=malloc(sizeof(int) * strlen(p));
a=failure(p,strlen(p));
for(i=0;i<strlen(p);i++)
printf("%d",a[i]);
return 0;
}
|
d8f35903def051e3dc39e39e3908e9a128c3e9c1
|
e9969fa28bb1b4e9444f837596767a71ab3201ba
|
/Easy_44_19_Remove Nth Node From End of List.c
|
372dc73c02ef10b828ae8d0ce797cfecaa3fffa8
|
[] |
no_license
|
cmershen1/leetcode
|
a37372b6c0f64a61e67cd1c979360ce930ffa4c8
|
8b75c4c7970cd172bc6a5c8c580552860e059a5e
|
refs/heads/master
| 2021-01-01T05:11:50.478591 | 2016-05-25T09:06:35 | 2016-05-25T09:06:35 | 56,359,444 | 1 | 4 | null | null | null | null |
UTF-8
|
C
| false | false | 388 |
c
|
Easy_44_19_Remove Nth Node From End of List.c
|
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
if (!head)
return NULL;
struct ListNode *p1 = head;
struct ListNode *p2 = head;
for(int i = 0; i < n; i++)
p2 = p2->next;
if(!p2)
return head->next;
while(p2->next) {
p1 = p1->next;
p2 = p2->next;
}
p1->next=p1->next->next;
return head;
}
|
fbdf4158b60c22e6bdf1aad81c90419cce1d968c
|
2ac1fb335a8a2a223197a31d87250c23635ba57d
|
/Source/ShaderTypes.h
|
f9d2376baf4e6e225ea0ca1de513d03fd5abf8bb
|
[] |
no_license
|
adamnemecek/MishMash
|
11591f1f0c977f2ea40c76121557cf5ec1ffdfe2
|
4a64bffd1e9beb34ad197423edb5459d2b444a0d
|
refs/heads/master
| 2020-03-22T06:56:51.019679 | 2018-07-04T03:48:09 | 2018-07-04T03:48:09 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 35 |
h
|
ShaderTypes.h
|
#pragma once
#include "MishMash.h"
|
838617a2d2eff8bf84e5589c47d8306fb86e03aa
|
a7b68ff483edfd219bfcdbcee789b959639698aa
|
/systems/share.c
|
dfa3995b803569d383fb767f7d4e5430163db298
|
[] |
no_license
|
kq-li/stuy
|
576847d4d08ea935d80fce1af6253c4eaf29f9ff
|
64ef0b5f58ef5fadfa11e326af7964c1c5a60b22
|
refs/heads/master
| 2021-06-16T12:15:15.941817 | 2017-05-08T22:25:40 | 2017-05-08T22:25:40 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 172 |
c
|
share.c
|
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int main() {
int i = 0;
if (fork()) {
wait(NULL);
} else {
i = 1;
}
printf("%d\n", i);
return 0;
}
|
0f04227ff69962408eeb77b012f893beb579a70b
|
9985d1a5d17d75c350575c7028897d7a78668270
|
/SDK/img_processing/src/helpers.c
|
9a9051dd2645cf90f27a8e6bb38efd8bbbd6e5ed
|
[] |
no_license
|
conanind1/EmbeddedVision
|
eaecc83164beaaecf1715c6626834cd1e2d338d3
|
0b9047a09f1bfd8b863a42705e2572b0800b758f
|
refs/heads/main
| 2023-02-08T15:03:46.159248 | 2021-01-03T09:12:57 | 2021-01-03T09:12:57 | 325,406,801 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,331 |
c
|
helpers.c
|
/*
* Copyright (c) 2009 Xilinx, Inc. All rights reserved.
*
* Xilinx, Inc.
* XILINX IS PROVIDING THIS DESIGN, CODE, OR INFORMATION "AS IS" AS A
* COURTESY TO YOU. BY PROVIDING THIS DESIGN, CODE, OR INFORMATION AS
* ONE POSSIBLE IMPLEMENTATION OF THIS FEATURE, APPLICATION OR
* STANDARD, XILINX IS MAKING NO REPRESENTATION THAT THIS IMPLEMENTATION
* IS FREE FROM ANY CLAIMS OF INFRINGEMENT, AND YOU ARE RESPONSIBLE
* FOR OBTAINING ANY RIGHTS YOU MAY REQUIRE FOR YOUR IMPLEMENTATION.
* XILINX EXPRESSLY DISCLAIMS ANY WARRANTY WHATSOEVER WITH RESPECT TO
* THE ADEQUACY OF THE IMPLEMENTATION, INCLUDING BUT NOT LIMITED TO
* ANY WARRANTIES OR REPRESENTATIONS THAT THIS IMPLEMENTATION IS FREE
* FROM CLAIMS OF INFRINGEMENT, IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE.
*
*/
#include "helpers.h"
#define MFS_ADDRESS 0x500000
int init_fs()
{
// File should be in DDR at this point, initialize the filesystem with the file
mfs_init_genimage(MFS_NUMBYTES , (char *)(MFS_ADDRESS ), MFSINIT_IMAGE);
// check if index.html can be found
if (mfs_exists_file("index.html") == 0)
{
xil_printf("index.html not found, check if the file is loaded in DDR at address: 0x%x", MFS_ADDRESS);
return -1;
}
else
return 0;
}
void print_http_request(char *buf, int n)
{
int i;
printf("%s\r\n", buf);
}
int generate_http_header(unsigned char *buf, int fsize, unsigned char* type)
{
char lbuf[40];
strcpy(buf, "HTTP/1.1 200 OK\r\nContent-Type: ");
if(type == "html")
strcat(buf, "text/html");
else if(type == "css")
strcat(buf, "text/css");
else if(type == "js")
strcat(buf, "application/javascript");
strcat(buf, "\r\n");
sprintf(lbuf, "Content-length: %d", fsize);
strcat(buf, lbuf);
strcat(buf, "\r\n");
strcat(buf, "Connection: close\r\n");
strcat(buf, "\r\n");
return strlen(buf);
}
static int p_arg_count = 0;
http_arg *palloc_arg()
{
http_arg *a;
SYS_ARCH_DECL_PROTECT(lev);
SYS_ARCH_PROTECT(lev);
a = malloc(sizeof *a);
if (!a) {
print("out of memory, attempted to allocate a http argument structure\r\n");
} else {
a->count = p_arg_count++;
a->fd = -1;
a->fsize = 0;
}
SYS_ARCH_UNPROTECT(lev);
return a;
}
void pfree_arg(http_arg *arg)
{
SYS_ARCH_DECL_PROTECT(lev);
SYS_ARCH_PROTECT(lev);
free(arg);
SYS_ARCH_UNPROTECT(lev);
}
|
43ba54a4aee2ebb8a8c9af9680b7f00b3c9f6949
|
868f8b07d7612a4a4eb6b374e8aab3b360e807c2
|
/src/part1_emulator/emulator_utility/instruction.h
|
9ced89d2e73ab1b69932255abe8ceebd488949e6
|
[] |
no_license
|
LLu0830/arm11
|
5748e143d16020d2ca154305c1ece926375a3e8f
|
a24960c0e45fd80961cb3769e223b5111b19a57f
|
refs/heads/master
| 2020-06-16T23:19:08.433019 | 2019-07-08T03:48:50 | 2019-07-08T03:48:50 | 195,729,165 | 0 | 0 | null | 2019-07-08T03:48:51 | 2019-07-08T03:19:35 |
C
|
UTF-8
|
C
| false | false | 890 |
h
|
instruction.h
|
//
// Created by mw6118 on 26/05/19.
//
// (Rini) includes instructionType enum - having this header here reduces repetition
#ifndef C_GROUP_31_INSTRUCTION_H
#define C_GROUP_31_INSTRUCTION_H
#include "DefinedTypes.h"
#include <stdbool.h>
typedef struct {
InstructionType instructionType;
//first 4bits condition
Cond conditionType;
//
register_address rd;
register_address rn;
register_address rs;
register_address rm;
//opcode in data processing
OpCode operationType;
//12/24bits operand2
uint32_t offsets_or_operand2;
// in data processing
bool I;
// Set condition code
// in dataProcessing, Multiply
bool S;
//in Multiply
bool accumulate;
//in Single Data Transfer
bool immediateOffset;
bool Pre_Post;
bool upBit;
bool L;
}Instruction;
#endif //C_GROUP_31_INSTRUCTION_H
|
4f6fcbf30b1edc8adb04e835808158874642b5fd
|
36908d1cb7b59b80f8f308cfbd41e3bfc6262955
|
/snarf/tests/snarf_tests.c
|
baaca9c522d0bfbbd8e28c574d4150a997c8dd59
|
[] |
no_license
|
fannydai/CSE320
|
c40c70829731f80f239f360de2ec86120c8dc256
|
e2ad3afe323a1bb3d2a0b82f70d0ff2f606a0d46
|
refs/heads/master
| 2023-05-02T10:51:24.353463 | 2018-12-18T19:43:37 | 2018-12-18T19:43:37 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 8,329 |
c
|
snarf_tests.c
|
#include <criterion/criterion.h>
#include "url.h"
#include "http.h"
Test(url_suite, parse_normal_url) {
URL *url;
char *str = "http://www.google.com";
url = url_parse(str);
cr_assert_neq(url, NULL);
cr_assert_eq(url_port(url), 80);
cr_assert_str_eq(url_method(url), "http");
cr_assert_str_eq(url_hostname(url), "www.google.com");
cr_assert_str_eq(url_path(url), "/");
}
Test(url_suite, url_no_slash) {
URL *url;
url = url_parse("http:www.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_no_method) {
URL *url;
url = url_parse("//www.google.com");
cr_assert_neq(url, NULL);
cr_assert_eq(url_port(url), 0);
cr_assert_eq(url_method(url), NULL);
cr_assert_eq(url_hostname(url), NULL);
cr_assert_str_eq(url_path(url), "//www.google.com");
}
Test(http_suite, basic_test) {
URL *url = url_parse("http://www.google.com");
cr_assert_neq(url, NULL);
HTTP *http = http_open(url_address(url), url_port(url));
cr_assert_neq(http, NULL);
http_request(http, url);
http_response(http);
int code;
char *status = http_status(http, &code);
cr_assert_str_eq(status, "HTTP/1.0 200 OK");
cr_assert_eq(code, 200);
http_close(http);
}
Test(http_suite, query_header_test) {
URL *url = url_parse("http://bsd7.cs.stonybrook.edu/index.html");
cr_assert_neq(url, NULL);
HTTP *http = http_open(url_address(url), url_port(url));
cr_assert_neq(http, NULL);
http_request(http, url);
http_response(http);
int code;
char *status = http_status(http, &code);
cr_assert_str_eq(status, "HTTP/1.1 200 OK");
cr_assert_eq(code, 200);
cr_assert_str_eq(http_headers_lookup(http, "content-length"), "11510");
cr_assert_str_eq(http_headers_lookup(http, "content-type"), "text/html");
http_close(http);
}
Test(http_suite, not_found_test) {
URL *url = url_parse("http://www.google.com/no_such_document.html");
cr_assert_neq(url, NULL);
HTTP *http = http_open(url_address(url), url_port(url));
cr_assert_neq(http, NULL);
http_request(http, url);
http_response(http);
int code;
char *status = http_status(http, &code);
cr_assert_str_eq(status, "HTTP/1.0 404 Not Found");
cr_assert_eq(code, 404);
http_close(http);
}
//############################################
// STUDENT UNIT TESTS SHOULD BE WRITTEN BELOW
// DO NOT DELETE THESE COMMENTS
//############################################
Test(cli_suite, invalid_term_1) {
char* cmd = "bin/snarf -o -o";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 255,"Program exited with %d instead of -1", return_code);
}
Test(cli_suite, invalid_term_2) {
char* cmd = "bin/snarf -o -q";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 255,"Program exited with %d instead of -1", return_code);
}
Test(cli_suite, invalid_term_3) {
char* cmd = "bin/snarf -q -o";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 255,"Program exited with %d instead of -1", return_code);
}
Test(cli_suite, invalid_term_4) {
char* cmd = "bin/snarf -oo text.txt";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 255,"Program exited with %d instead of -1", return_code);
URL *url;
char *str = "http://www.facebook.com";
url = url_parse(str);
cr_assert_neq(url, NULL);
cr_assert_eq(url_port(url), 80);
cr_assert_str_eq(url_method(url), "http");
cr_assert_str_eq(url_hostname(url), "www.facebook.com");
cr_assert_str_eq(url_path(url), "/");
}
Test(cli_suite, invalid_term_5) {
char* cmd = "bin/snarf -qq content-type";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 255,"Program exited with %d instead of -1", return_code);
}
Test(cli_suite, invalid_term_6) {
char* cmd = "bin/snarf -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_7) {
char* cmd = "bin/snarf -h -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_8) {
char* cmd = "bin/snarf http://www.google.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_9) {
char* cmd = "bin/snarf http:///www.google.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_10) {
char* cmd = "bin/snarf //www.google.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_11) {
char* cmd = "bin/snarf :www.google.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_12) {
char* cmd = "bin/snarf http://www.google.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(cli_suite, invalid_term_13) {
char* cmd = "bin/snarf http://www.google.com http://www.google.com http://www.gogole.com -h";
int return_code = WEXITSTATUS(system(cmd));
cr_assert_eq(return_code, 0,"Program exited with %d instead of 0", return_code);
}
Test(url_suite, parse_facebook_url) {
URL *url;
char *str = "http://www.facebook.com";
url = url_parse(str);
cr_assert_neq(url, NULL);
cr_assert_eq(url_port(url), 80);
cr_assert_str_eq(url_method(url), "http");
cr_assert_str_eq(url_hostname(url), "www.facebook.com");
cr_assert_str_eq(url_path(url), "/");
}
Test(url_suite, parse_yahoo_url) {
URL *url;
char *str = "http://www.yahoo.com";
url = url_parse(str);
cr_assert_neq(url, NULL);
cr_assert_eq(url_port(url), 80);
cr_assert_str_eq(url_method(url), "http");
cr_assert_str_eq(url_hostname(url), "www.yahoo.com");
cr_assert_str_eq(url_path(url), "/");
}
Test(url_suite, url_no_slash_no_colon) {
URL *url;
url = url_parse("httpwww.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_one_slash) {
URL *url;
url = url_parse("http:/www.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_three_slash) {
URL *url;
url = url_parse("http:///www.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_no_http) {
URL *url;
url = url_parse("://www.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_no_http_no_colon) {
URL *url;
url = url_parse("//www.google.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_two_http) {
URL *url;
url = url_parse("http://http:/.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_three_http) {
URL *url;
url = url_parse("http://wwww.http://http://.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_wrong) {
URL *url;
url = url_parse("httphttp://www.http://.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_two_com_with_dot) {
URL *url;
url = url_parse("http://www.http://.com.com");
cr_assert_neq(url, NULL);
}
Test(url_suite, url_two_com) {
URL *url;
url = url_parse("http://www.http://.comcom");
cr_assert_neq(url, NULL);
}
Test(http_suite, basic_test_yahoo) {
URL *url = url_parse("http://www.yahoo.com");
cr_assert_neq(url, NULL);
HTTP *http = http_open(url_address(url), url_port(url));
cr_assert_neq(http, NULL);
http_request(http, url);
http_response(http);
int code;
char *status = http_status(http, &code);
cr_assert_str_eq(status, "HTTP/1.0 200 OK");
cr_assert_eq(code, 200);
http_close(http);
}
Test(status_code_suite, _100) {
URL *url = url_parse("http://httpstat.us/100");
cr_assert_neq(url, NULL);
HTTP *http = http_open(url_address(url), url_port(url));
cr_assert_neq(http, NULL);
http_request(http, url);
http_response(http);
int code;
http_status(http, &code);
cr_assert_eq(code, 100);
http_close(http);
}
|
437838759586c5b6988a1e9405d50e94e1325f48
|
7ea30b6778e3977b9dad7023700adb6577b8b651
|
/prog-ex4.1.c
|
0b0c3b65f2fd4aadf8b1a678e0c2fa30af16f7e3
|
[] |
no_license
|
ugarf13/K-R
|
3fcc1e9bebd66113277f86c813153996877203ac
|
e2e2d62b7adadd1c14bbe03e626b434a4f4e9378
|
refs/heads/master
| 2021-01-22T19:21:46.280213 | 2017-03-16T12:07:45 | 2017-03-16T12:07:45 | 85,190,697 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,004 |
c
|
prog-ex4.1.c
|
/* Program to return the position of the rightmost occurrence of t in s, or -1
* if there is none */
#include <stdio.h>
#define MAXLINE 100 /* maximum length of string */
int main (void)
{
char source[] = "hello world, this is a great world, the best world of all";
char pattern[] = "world";
int strrindex (char source[], char pattern[]);
printf("%s\n", source);
printf("Last match found at position %i\n", strrindex(source, pattern));
return 0;
}
/* strrindex: return index of rightmost occurrence of pattern in source */
int strrindex (char source[], char pattern[])
{
int i, j, k;
int index;
for ( i = 0; source[i] != '\0'; ++i ) {
for ( j = i, k = 0; pattern[k] != '\0' && pattern[k] == source[j]; ) {
++j; ++k; /* continue checking as long as chars match */
}
if ( k > 0 && pattern[k] == '\0' ) /* was the entire pattern matched ? */
index = i;
}
return (index >= 0) ? index : -1;
}
|
9c1355199d4a207921d5426aa8c8d2360b32ee0a
|
77fa5cb1ed79cae6185c81a0e4b92e252b5b70e1
|
/main.h
|
97e05395325c1879c680522dfe3a347544424336
|
[] |
no_license
|
0x416c6578/NMEAParser
|
e64a15e113d7b580e40ea3b46c00985806575082
|
b44b499bd5a948d2164a50b3ece98ab57aea6ef3
|
refs/heads/master
| 2023-07-10T07:41:10.361845 | 2021-08-20T18:09:25 | 2021-08-20T18:09:25 | 196,042,237 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 424 |
h
|
main.h
|
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <math.h>
#define BUF_LEN 100
#define TIME_LEN 10
#define SUCCESS 0
#define FAIL 1
typedef unsigned char bool;
typedef struct {
double lat, lon;
} position;
typedef struct {
position pos;
} gpsData;
int parseGPGGA(char* gpggaString, position* dataStore);
double parseLatLong(double latLong, bool isPositive);
|
693cb22fe2340749276715176b3bdbbc5eccc1da
|
d869e40ccf524dd239d3072dcf4e55da3b682a46
|
/include/nos/drvs/serial.h
|
32d16817eb7e3dd59571c99470c6c5c46cf4a0d4
|
[] |
no_license
|
hilarryxu/nos
|
eadc4d926a78d7e63c20b40228eb7c5c98ff97ab
|
5a289176382eec33bbecc2851782fe4d72679c12
|
refs/heads/master
| 2023-04-11T09:17:03.732582 | 2021-04-01T15:13:03 | 2021-04-01T15:13:03 | 331,001,120 | 2 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 339 |
h
|
serial.h
|
#ifndef _NOS_DRVS_SERIAL_H_
#define _NOS_DRVS_SERIAL_H_
#include <stdint.h>
#define SERIAL_COM1 0x3F8
// 默认波特率
#define SERIAL_DEFAULT_BAUDRATE 9600
// 初始化串口
void serial_setup();
// 读串口
char serial_read(uint16_t base);
// 写串口
void serial_write(uint16_t base, char chr);
#endif // !_NOS_DRVS_SERIAL_H_
|
69774076647bd25be04044ac1ca656a4fb976310
|
3dfb6f64d183eb4145fb7cd86132209a899faa83
|
/ios/Pods/Headers/Private/React/RCTImageBlurUtils.h
|
62ab77ffae2634001aa851404739a1c856abb7f0
|
[] |
no_license
|
JasonEVA/JWDemo-OC-RN
|
624d36ca1ec5bf1fe428714fbab67968fe91aa68
|
7f1dda6903c51bfa96ca11388f1b55d52574cbc5
|
refs/heads/master
| 2020-03-18T23:31:35.149332 | 2018-06-14T09:34:38 | 2018-06-14T09:34:38 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 83 |
h
|
RCTImageBlurUtils.h
|
../../../../../RNPart/node_modules/react-native/Libraries/Image/RCTImageBlurUtils.h
|
a9c27befd011b4becb7de5562a08d634f93745f2
|
b4fe2dfe1ae94f0a37f6c5c27d3122830406409b
|
/testlab1.c
|
e586c5a515eb5a98c7cbdb71891be8d863b9a147
|
[
"MIT"
] |
permissive
|
LoneLogical/xv6-public
|
436737138d004a04fe1e73b07b46bf030240ccfd
|
ef6dccc5a22ca8c51bf344ced5e69bea6e024a90
|
refs/heads/master
| 2020-03-08T15:28:57.147079 | 2018-05-03T23:20:16 | 2018-05-03T23:20:16 | 128,213,136 | 0 | 0 | null | 2018-04-05T13:51:19 | 2018-04-05T13:51:18 | null |
UTF-8
|
C
| false | false | 7,664 |
c
|
testlab1.c
|
#include "types.h"
#include "user.h"
int exitWait(void);
int waitPid(void);
int waitPidTestCases(void);
int main(int argc, char *argv[]) {
printf(1, "####################################################\n");
printf(1, "# This program tests the correctness of your lab#1\n");
printf(1, "####################################################\n");
if (atoi(argv[1]) == 1)
exitWait(); // Test exit and wait
else if (atoi(argv[1]) == 2)
waitPid(); // Test waitpid
else if (atoi(argv[1]) == 3)
waitPidTestCases(); //Phillip and Adrew's Test Cases for Lab 1
// For corner cases
else
printf(1, "\ntype \"lab1 1\" to test exit and wait, \"lab1 2\" to test waitpid \n");
// End of test
exit(0);
}
int exitWait(void) {
int pid, ret_pid, exit_status;
int i;
// use this part to test exit(int status) and wait(int* status)
printf(1, "Step 1: testing exit(int status) and wait(int* status):\n");
for (i = 0; i < 2; i++) {
pid = fork();
if (pid == 0) { // only the child executed this code
if (i == 0) {
printf(1, " - This is child with PID# %d and I will exit with status %d\n", getpid(), 0);
exit(0);
} else {
printf(1, " - This is child with PID# %d and I will exit with status %d\n" ,getpid(), -1);
exit(-1);
}
} else if (pid > 0) { // only the parent exeecutes this code
ret_pid = wait(&exit_status);
printf(1, " - This is the parent: child with PID# %d has exited with status %d\n", ret_pid, exit_status);
} else { // something went wrong with fork system call
printf(2, " - Error using fork\n");
exit(-1);
}
}
return 0;
}
int waitPid(void){
int ret_pid, exit_status;
int i;
int pid_a[5]={0, 0, 0, 0, 0};
// use this part to test wait(int pid, int* status, int options)
printf(1, "Step 2: testing waitpid(int pid, int* status, int options):\n");
for (i = 0; i <5; i++) {
pid_a[i] = fork();
if (pid_a[i] == 0) { // only the child executed this code
printf(1, " - The is child with PID# %d and I will exit with status %d\n", getpid(), 0);
exit(0);
}
}
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[3]);
ret_pid = waitpid(pid_a[3], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[1]);
ret_pid = waitpid(pid_a[1], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[2]);
ret_pid = waitpid(pid_a[2], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[0]);
ret_pid = waitpid(pid_a[0], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[4]);
ret_pid = waitpid(pid_a[4], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
return 0;
}
//CS153 Lab01
// Provideds multiple cases for testing WaitPid function
int waitPidTestCases(void){
int ret_pid, exit_status;
int i;
int pid_a[5]={0, 0, 0, 0, 0};
// use this part to test wait(int pid, int* status, int options)
printf(1, "Step 2: testing waitpid(int pid, int* status, int options):\n");
for (i = 0; i <5; i++) {
sleep(5);
pid_a[i] = fork();
if (pid_a[i] == 0) { // only the child executed this code
sleep(5);
if (i == 0) {
printf(1, " - This is child with PID# %d and I will exit with status %d\n", getpid(), 13);
exit(13);
}
else if (i == 1) {
printf(1, " - This is child with PID# %d and I will exit with status %d \n", getpid(), 0);
exit(0); //should return -1
}
else if (i == 2) {
printf(1, " - This is child with PID# %d and I will perform an exec call that should succeed and not return to call exit %d\n", getpid(), 13);
char *argvector[] = {"echo", "hello world", 0};
exec("echo", argvector); //should work and not return
printf(1, "init: fork failed\n");
exit(13);
}
else if (i == 3) {
printf(1, " - This is child with PID# %d and I will perform an exec call that should NOT succeed and should return to call exit with status %d \n", getpid(), 13);
char *argvector[] = {"echor", 0};
exec("echor", argvector); //should NOT work and return for us to exit
printf(1, "init: fork failed\n");
exit(13);
}
else {
printf(1, " - This is child with PID# %d and I will wait on my own pid %d\n", getpid(), getpid());
ret_pid = waitpid(getpid(), &exit_status, 0);
printf(1, " - Child with PID# %d returned from waitpid with value: %d and status: %d \n", getpid(), ret_pid, exit_status);
exit(0);
}
/*
else {
printf(1, " - This is child with PID# %d and I will spawn a new child \n", getpid());
pid_cc = fork();
if (pid_cc == 0) { //grandchild process of original process
printf(1, " - This is child with PID# %d and I will exit with status %d \n", getpid(), 77);
sleep(50);
exit(77);
}
else { //middle child process
printf(1, " - This is child with PID# %d and I will now exit with status %d\n", getpid(), 0);
exit(0);
}
}
*/
}
}
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[0]);
ret_pid = waitpid(pid_a[0], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[1]);
ret_pid = waitpid(pid_a[1], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[2]);
ret_pid = waitpid(pid_a[2], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[3]);
ret_pid = waitpid(pid_a[3], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(5);
printf(1, " - This is the parent: Now waiting for child with PID# %d\n",pid_a[4]);
ret_pid = waitpid(pid_a[4], &exit_status, 0);
printf(1, " - This is the parent: Child# %d has exited with status %d\n",ret_pid, exit_status);
sleep(50);
//ensure that child processes exited, and that waitpid returns -1 for nonexistant children
unsigned j;
for (j = 0; j < 5; j++) {
if (waitpid(pid_a[j], &exit_status, 0) != -1)
printf(1, " - FAIL -In parent: either child process %d did not exit correctly, or waitpid did not return correct value for non-existing process\n", pid_a[j]);
else
printf(1, " - This is the parent: exit verification for child %d success\n", pid_a[j]);
}
return 0;
}
|
a906835d15f9ab5b445f809b3d02124da2321ddf
|
ba2a97583c1b8f89941fc14436ac2bf04fbbad3e
|
/CPS3227/mpi_prod_cons.c
|
f8e2ee041ddf34932d9eb0f5c6b89cb7f6e4452c
|
[] |
no_license
|
jfarrugia-uom/2017Sem02CourseWork
|
e1fe0febf20f3fb0d86840a83a0492f9e1b85351
|
b3ca72901d05dd6d7f2af5959fb59d98d1c4a7ac
|
refs/heads/master
| 2021-01-20T13:42:30.543944 | 2017-06-22T00:25:01 | 2017-06-22T00:25:01 | 82,709,731 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 3,305 |
c
|
mpi_prod_cons.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <mpi.h>
#include <time.h>
#include <unistd.h>
#include "omp.h"
#include "mpi_library.h"
void printError(int errorCode, int myRank) {
char errorString[BUFSIZ];
int errorStringLen, errorClass;
MPI_Error_class(errorCode, &errorClass);
MPI_Error_string(errorClass, errorString, &errorStringLen);
fprintf(stderr, "%3d: %s\n", myRank, errorString);
MPI_Error_string(errorCode, errorString, &errorStringLen);
fprintf(stderr, "%3d: %s\n", myRank, errorString);
MPI_Abort(MPI_COMM_WORLD, errorCode);
}
int main (int argc,char **argv) {
int rank, size;
int number;
int errorCode;
int BUFFER_SIZE = 1000;
int* buffer;
int* consumerBuffer;
int stopSignal = 0;
// omp_set_num_threads(2);
// initialize MPI environment
MPI_Init (&argc, &argv);
// get process id within MPI_COMM_WORLD
MPI_Comm_rank (MPI_COMM_WORLD, &rank);
// get size of cluster
MPI_Comm_size (MPI_COMM_WORLD, &size);
// setup error handling
MPI_Errhandler_set(MPI_COMM_WORLD, MPI_ERRORS_RETURN);
buffer = allocateArray(BUFFER_SIZE);
int result = 0;
int consumerTotal = 0;
// while(1) {
// assign rank = 0 as producer
if (rank == 0) {
populateArray(buffer, BUFFER_SIZE);
for (int i = 0; i < BUFFER_SIZE; i++) {
// route message to other proceses except the producer process
int destination = (i % (size - 1)) + 1;
printf("Producer %d sending[%d] to destination = %d\n", rank, buffer[i], destination);
errorCode = MPI_Send(&buffer[i], 1, MPI_INT, destination, 0, MPI_COMM_WORLD);
if (errorCode != MPI_SUCCESS) printError(errorCode, rank);
// if (destination % (size-1) == 0) printf("====> Process with rank [%d] at barrier\n", rank);
// work in lock-step: suspend producer until all consumer processes reach barrier, then resume
if (destination % (size-1) == 0) MPI_Barrier(MPI_COMM_WORLD);
// if (destination % (size-1) == 0) printf("<==== Process with rank [%d] passed barrier\n", rank);
}
// send stop signal
printf("**** sending stop signal from producer\n");
stopSignal = -1;
for (int i = 1; i <=size; i++) {
errorCode = MPI_Send(&stopSignal, 1, MPI_INT, i, 0, MPI_COMM_WORLD);
}
// this is our consumer part
} else {
int counter = 0;
while (1) {
errorCode = MPI_Recv(&number, 1, MPI_INT, 0, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
if (number == -1) break;
if (errorCode != MPI_SUCCESS) printError(errorCode, rank);
// sleep(1);
printf("Consumer %d received number %d from process 0\n", rank, number);
buffer[counter++] = number;
// printf("====> Process with rank [%d] at barrier\n", rank);
MPI_Barrier(MPI_COMM_WORLD);
// printf("<==== Process with rank [%d] passed barrier\n", rank);
}
printf("Received stop signal...exiting.\n");
printf("Consumer with rank %d counter value = %d\n", rank, counter);
for (int i = 0; i < counter; i++){
consumerTotal += buffer[i];
}
printf("Consumer %d subtotal = %d\n", rank, consumerTotal);
}
MPI_Reduce(&consumerTotal, &result, 1, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
if (rank == 0) {
printf("Total sum = %d\n", result);
}
// }
MPI_Finalize();
free(buffer);
return 0;
}
|
dffafccf9112c182fb92a6a6c4e8efe889a077f5
|
c8736adb50c76cb04e5bdb3313f742a93d47fa71
|
/server/server.c
|
b252576524e2e7a06676507f095ccf65bea65631
|
[] |
no_license
|
Joshun/arduino-remote-bell
|
b44a20b4b5acc9db2a7503e89bfe8037ebb4ae0a
|
384a4ce5dae6c4719d92b9a27fd94defc652298c
|
refs/heads/master
| 2020-05-19T22:04:33.868488 | 2014-02-25T12:02:28 | 2014-02-25T12:02:28 | 17,171,408 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 4,716 |
c
|
server.c
|
/* Arduino server via pipes, for use with php
* Joshun 2013
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <limits.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <termios.h>
#define FIFO_PATH "/tmp/my_fifo.in"
#define FIFO_FEEDBACK_PATH "/tmp/my_fifo.out"
#define BUFFER_SIZE PIPE_BUF
#define ARDUINO_BUFFER_SIZE PIPE_BUF
#define DEVICE_PATH "/dev/ttyACM0"
#define DEVICE_BAUD B115200
#define END_CHAR '\n'
#define EOT 0x4
int arduino_init(struct termios *old_config, struct termios *new_config);
int main()
{
/* arduino stuff */
struct termios arduino_config;
struct termios backup_config;
char arduino_buffer[ARDUINO_BUFFER_SIZE + 1];
int arduino_fd = arduino_init(&backup_config, &arduino_config);
/* server stuff */
int pipe_fd;
int pipe_out_fd;
int read_once;
int open_mode = O_RDONLY;
int open_out_mode = O_WRONLY;
char buffer[BUFFER_SIZE + 1];
char name_buffer[BUFFER_SIZE + 1];
int bytes_read = 0;
/* if fifo does not exist / can't be accessed, create it */
if( access(FIFO_PATH, F_OK) == -1 ) {
read_once = mkfifo(FIFO_PATH, 0777);
if( read_once != 0 ) {
/* abort on failure to create fifo */
fprintf(stderr, "Could not create FIFO at %s\n", FIFO_PATH);
exit(EXIT_FAILURE);
}
}
if( access(FIFO_FEEDBACK_PATH, F_OK) == -1 ) {
read_once = mkfifo(FIFO_FEEDBACK_PATH, 0777);
if( read_once != 0 ) {
/* abort on failure to create fifo */
fprintf(stderr, "Could not create FIFO at %s\n", FIFO_PATH);
exit(EXIT_FAILURE);
}
}
memset(buffer, '\0', sizeof(buffer));
memset(name_buffer, '\0', sizeof(name_buffer));
memset(arduino_buffer, '\0', sizeof(arduino_buffer));
while(1) {
printf("Process %d opening FIFO O_RDONLY\n", getpid());
pipe_fd = open(FIFO_PATH, open_mode);
printf("Process %d opened fifo on fd %d\n", getpid(), pipe_fd);
pipe_out_fd = open(FIFO_FEEDBACK_PATH, open_out_mode);
if( pipe_fd != -1 ) {
do {
read_once = read(pipe_fd, buffer, BUFFER_SIZE);
if(read_once == 0)
break;
bytes_read += read_once;
/* safety check preventing overflow */
if((bytes_read + 10) > BUFFER_SIZE)
{
printf("Warning: large amount of data, cutting...\n");
break;
}
} while ( read_once > 0 );
buffer[bytes_read] = '\n';
buffer[bytes_read + 1] = '\0';
printf("Dump of received data: %s\n", buffer);
int i, j, end_index;
for(i=0; i<bytes_read; i++)
{
if(buffer[i] == EOT)
{
end_index = i;
printf("EOT found\n");
break;
}
}
j = end_index + 1;
for(i=0; i<bytes_read; i++)
{
if( buffer[j] == '\0' || buffer[j] == EOT)
break;
name_buffer[i] = buffer[j];
j++;
}
printf("Sent from %s\n", name_buffer);
j++;
for(i=0; i<bytes_read; i++)
{
if( buffer[j] == '\0' )
break;
name_buffer[i] = buffer[j];
j++;
}
name_buffer[i] = '\0';
printf("Message: %s\n", name_buffer);
buffer[end_index] = '\0';
printf("Closing FIFO...\n");
close(pipe_fd);
write(arduino_fd, buffer, strlen(buffer));
int nread, result;
char ch = 0;
for(nread = 0; ch != END_CHAR; nread++)
{
result = read(arduino_fd, &ch, 1);
arduino_buffer[nread] = ch;
printf("Read %c (%d)\n", ch, ch);
if( result < 0 )
{
printf("Warning: read error\n");
break;
}
if( (nread + 2) >= ARDUINO_BUFFER_SIZE )
{
printf("Warning: large buffer size\n");
break;
}
}
arduino_buffer[nread] = '\0';
//printf("Response: %d\n", arduino_buffer[0]);
printf("Response (%d): %s\n", nread, arduino_buffer);
write(pipe_out_fd, arduino_buffer, strlen(arduino_buffer));
memset(arduino_buffer, '\0', nread);
memset(buffer, '\0', bytes_read);
memset(name_buffer, '\0', sizeof(name_buffer));
close(pipe_out_fd);
}
else {
exit(EXIT_FAILURE);
}
}
}
int arduino_init(struct termios *old_config, struct termios *new_config)
{
int fd = open(DEVICE_PATH, O_RDWR | O_NOCTTY);
// int fd = open(DEVICE_PATH, O_RDWR);
if(fd == -1)
{
printf("Arduino not connected. Exiting...\n");
exit(EXIT_FAILURE);
}
printf("Arduino fd opened as %i\n", fd);
tcgetattr(fd, old_config);
new_config = old_config;
cfsetispeed(new_config, DEVICE_BAUD);
cfsetospeed(new_config, DEVICE_BAUD);
new_config->c_cflag &= ~PARENB;
new_config->c_cflag &= ~CSTOPB;
new_config->c_cflag &= ~CSIZE;
new_config->c_cflag |= CS8;
/* Canonical mode */
//new_config->c_lflag |= ICANON;
new_config->c_lflag |= ICANON;
/* commit the serial port settings */
tcsetattr(fd, TCSANOW, new_config);
return fd;
}
|
c3231afa74c30f04b564f400cc6c24dcbd0ef5c2
|
f51dfc8726e0f74806098d6e165b626d56dbfd40
|
/srcs/ft_exit.c
|
83c688f06441cc4c3e058f83d53cb81f51254b35
|
[] |
no_license
|
apitoise/philosophers
|
09b50edc39728157c9f7741da256962e332c3df7
|
5affae004c7a63a91fb67ee1a66b80dab1b3becf
|
refs/heads/master
| 2023-06-06T23:52:40.542394 | 2021-06-30T14:59:31 | 2021-06-30T14:59:31 | 378,882,932 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,156 |
c
|
ft_exit.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_exit.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: apitoise <apitoise@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/06/29 16:53:51 by apitoise #+# #+# */
/* Updated: 2021/06/30 14:24:10 by apitoise ### ########.fr */
/* */
/* ************************************************************************** */
#include "../header/philo.h"
void ft_exit(t_struct *st, t_philo *philo)
{
int i;
i = 0;
while (i < st->data.philo_nb)
{
pthread_mutex_destroy(&st->forks[i]);
i++;
}
free(st->forks);
free(st->state);
free(philo);
pthread_mutex_destroy(&st->print);
}
|
dfffb33f6d765fa3853114da3bc56b2d6bd77af1
|
779ad936c5e20dfb3e7b9ace6a786484b74d9bdd
|
/proxy.c
|
eff6d55f34937eab6edc431e4d4b10e4ae2fcd0e
|
[] |
no_license
|
Woodzyowl/proxyServer
|
669aa6bce89f874f5a81cfa4e334710b838b4716
|
bb8f056cd7a17055928acd861f79f32c16e3e51b
|
refs/heads/master
| 2021-03-27T14:43:54.791790 | 2016-04-27T17:38:50 | 2016-04-27T17:38:50 | 56,455,234 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 8,013 |
c
|
proxy.c
|
/*
* proxy.c - CS:APP Web proxy
*
* TEAM MEMBERS: put your name(s) and e-mail addresses here
* John Hyatt hyattjp0@sewanee.edu
* Tyler Epps eppstd0@sewanee.edu
*
* Provides a handy dandy proxy for logging web traffic
*/
#include <stdio.h>
/* Recommended max cache and object sizes */
#define MAX_CACHE_SIZE 1049000
#define MAX_OBJECT_SIZE 102400
#include <ctype.h>
#include <string.h>
#include <unistd.h>
#include "csapp.h"
#include <time.h>
FILE *fp;
void* doit(void* fd);
int parse_uri(char *uri, char *hostname, char *pathname, int *port);
char *strcasestr(const char *haystack, const char *needle);
void logrequest (char *browserIP, char *URL, char *numberofbytes);
/*
* doit - handle proxy request
*/
/* $begin doit */
void* doit(void* fd)
{
//struct stat sbuf;
int servfd,clientfd=*((int *)fd);
free(fd);
char buf[MAXLINE], method[MAXLINE], uri[MAXLINE], version[MAXLINE],
hostname[MAXLINE],pathname [MAXLINE];
int* port=(int *)malloc(sizeof(int));
//char filename[MAXLINE];
char response[MAX_OBJECT_SIZE];
char request[MAX_OBJECT_SIZE];
char temp_response[MAX_OBJECT_SIZE];
int response_size,temp_response_size;
rio_t rio, servrio;
char portstr[MAXLINE];
/* Read request line and headers */
rio_readinitb(&rio, clientfd);
rio_readlineb(&rio, buf, MAXLINE);
strcat(request,buf);
sscanf(buf, "%s %s %s", method, uri, version); //line:netp:doit:parserequest
parse_uri(uri, hostname, pathname, port);
sprintf(portstr,"%d",*port);
while(strcmp(buf, "\r\n")) { //line:netp:readhdrs:checkterm
rio_readlineb(&rio, buf, MAXLINE);
strcat(request,buf);
}
strcat(request,"\r\n\r\n");
servfd=open_clientfd(hostname, portstr);
rio_readinitb(&servrio,servfd);
rio_writen(servfd,request,strlen(request));
do{
if(strcasestr(response,"</html>")!=(char*) NULL){
break;
}
temp_response_size=rio_readlineb(&servrio,temp_response,MAX_OBJECT_SIZE);
response_size+=temp_response_size-1;
strcat(response,temp_response);
strcat(response,"\n");
}while(temp_response_size>0);
rio_writen(clientfd,response,response_size);
char response_size_str[MAXLINE];
sprintf(response_size_str,"%d",response_size);
logrequest("NERD", uri,response_size_str);
free(port);
return NULL;
//serve_static(fd, filename, sbuf.st_size); //line:netp:doit:servestatic
}
/* $end doit */
/********* Start of Logging Functions *********/
/*
Function to calculate the day of the week,
written by Sakamoto, Lachman, Keith and Craver,
based on the fact that Jan 1 1900 was a Monday.
*/
int dayofweek(int d, int m, int y)
{
static int t[] = { 0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4 };
y -= m < 3;
return ( y + y/4 - y/100 + y/400 + t[m-1] + d) % 7;
}
/*
Builds a formatted string out of a buffer for date-logging
*/
void formatdate(char* buffer) {
struct tm* tm_info;
time_t timer;
char day[3];
char year[5];
char month[5];
char weekday[4];
char clock[10];
char *temp;
time(&timer);
tm_info = localtime(&timer);
strftime(day, 3, "%d", tm_info);
strftime(month, 5, "%m", tm_info);
strftime(year, 5, "%Y", tm_info);
strftime(clock, 10, "%H:%M:%S", tm_info);
long dayval = strtol(day, &temp, 10);
long monthval = strtol(month, &temp, 10);
long yearval = strtol(year, &temp, 10);
int weekval = dayofweek((int)dayval, (int)monthval, (int)yearval);
if (weekval == 0) {
strcpy(weekday, "Sun");
} else if (weekval == 1) {
strcpy(weekday, "Mon");
} else if (weekval == 2) {
strcpy(weekday, "Tues");
} else if (weekval == 3) {
strcpy(weekday, "Wed");
} else if (weekval == 4) {
strcpy(weekday, "Thur");
} else if (weekval == 5) {
strcpy(weekday, "Fri");
} else {
strcpy(weekday, "Sat");
}
if (monthval == 1) {
strcpy(month, "Jan");
} else if (monthval == 2) {
strcpy(month, "Feb");
} else if (monthval == 3) {
strcpy(month, "March");
} else if (monthval == 4) {
strcpy(month, "April");
} else if (monthval == 5) {
strcpy(month, "May");
} else if (monthval == 6) {
strcpy(month, "June");
} else if (monthval == 7) {
strcpy(month, "July");
} else if (monthval == 8) {
strcpy(month, "Aug");
} else if (monthval == 9) {
strcpy(month, "Sept");
} else if (monthval == 10) {
strcpy(month, "Oct");
} else if (monthval == 11) {
strcpy(month, "Nov");
} else {
strcpy(month, "Dec");
}
sprintf(buffer, "[%s %i %s %i %s]", weekday, (int)dayval, month, (int)yearval, clock);
}
/*
Creates a log file if one does not exist,
logs the server's activation time
*/
void logcreate () {
fp = fopen("proxy.log", "a+"); //creates file or opens for appending
if (fp == NULL) {
printf("Error openning log file at activation.\n");
}
fflush(fp);
char buffer[33];
formatdate(buffer);
if (fprintf(fp, "%s ", buffer) < 0) {
printf("Error writing time of activation to log.\n");
}
if (fprintf(fp, "Server Activated\n") < 0) {
printf("Error writing activation message to log.\n");
}
fclose(fp);
}
/*
Adds the client's request to the log file
*/
void logrequest (char *browserIP, char *URL, char *numberofbytes) {
fp = fopen("proxy.log", "a+");
if (fp == NULL) {
printf("Error openning log file at request.\n");
}
fflush(fp);
char buffer[33];
formatdate(buffer);
if (fprintf(fp, "%s ", buffer) < 0) {
printf("Error writing time of request to log.\n");
}
if (fprintf(fp, "%s ", browserIP) < 0) {
printf("Error writing browserIP request to log.\n");
}
if (fprintf(fp, "%s ", URL) < 0) {
printf("Error writing URL request to log.\n");
}
if (fprintf(fp, "%s\n", numberofbytes) < 0) {
printf("Error writing size request to log.\n");
}
fclose(fp);
}
/*
Logs the time of the server closing
*/
void logclose () {
fp = fopen("proxy.log", "a+");
if (fp == NULL) {
printf("Error openning log file at closure.\n");
}
fflush(fp);
char buffer[33];
formatdate(buffer);
if (fprintf(fp, "%s ", buffer) < 0) {
printf("Error writing time of closing to log.\n");
}
if (fprintf(fp, "Server Closed\n") < 0) {
printf("Error writing closure message to log.\n");
}
fclose(fp);
}
/********* End of Logging Functions *********/
int main(int argc, char **argv)
{
int listenfd;
int *connfdp;
socklen_t clientlen;
struct sockaddr_in clientaddr;
pthread_t *tid=(pthread_t *)malloc(sizeof(pthread_t));
if (argc != 2) {
fprintf(stderr, "usage: %s <port>\n", argv[0]);
exit(0);
}
listenfd = Open_listenfd(argv[1]);
logcreate(); /* OPENS LOG FILE */
while (1) {
clientlen = sizeof(clientaddr);
connfdp=(int *) malloc(sizeof(int));
*connfdp = Accept(listenfd, (SA *)&clientaddr, &clientlen);
/* determine the domain name and IP address of the client */
pthread_create(tid,NULL,doit,connfdp);
}
logclose(); /* CLOSES LOG FILE */
exit(0);
}
/* $end echoserverimain */
/*
* parse_uri - URI parser
*
* Given a URI from an HTTP proxy GET request (i.e., a URL), extract
* the host name, path name, and port. The memory for hostname and
* pathname must already be allocated and should be at least MAXLINE
* bytes. Return -1 if there are any problems.
*/
int parse_uri(char *uri, char *hostname, char *pathname, int *port)
{
char *hostbegin;
char *hostend;
char *pathbegin;
int len;
if (strncasecmp(uri, "http://", 7) != 0) {
hostname[0] = '\0';
return -1;
}
/* Extract the host name */
hostbegin = uri + 7;
hostend = strpbrk(hostbegin, " :/\r\n\0");
len = hostend - hostbegin;
strncpy(hostname, hostbegin, len);
hostname[len] = '\0';
/* Extract the port number */
*port = 80; /* default */
if (*hostend == ':')
*port = atoi(hostend + 1);
/* Extract the path */
pathbegin = strchr(hostbegin, '/');
if (pathbegin == NULL) {
pathname[0] = '\0';
}
else {
pathbegin++;
strcpy(pathname, pathbegin);
}
return 0;
}
|
4c8fdd779b9ea4f76e9657442dc7a573061ee090
|
2b629e43caf47915ed7db4a8d69d0fe582ea47c2
|
/STM32/mavlink/Lattepanda_shiled/mavlink_msg_real_time_clock_set.h
|
5349121d007a632668a00d5aa5dbd19e95f22abe
|
[
"MIT"
] |
permissive
|
mocona05/Lattepanda-Measurement-Shield
|
a53c7f5416944f9f8f37e7b282d488076509672d
|
c1aa84dd57c301acd97d415b9b7ef5adeea8da37
|
refs/heads/master
| 2023-08-05T08:43:43.512899 | 2023-07-31T22:55:06 | 2023-07-31T22:55:06 | 96,897,825 | 3 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 18,699 |
h
|
mavlink_msg_real_time_clock_set.h
|
// MESSAGE REAL_TIME_CLOCK_SET PACKING
#define MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET 209
MAVPACKED(
typedef struct __mavlink_real_time_clock_set_t {
uint32_t subsec; /*< Real time clock sec setting*/
uint16_t year; /*< Real time clock Year setting*/
uint8_t month; /*< Real time clock month setting*/
uint8_t mday; /*< Real time clock month setting*/
uint8_t wday; /*< Real time clock wday setting*/
uint8_t hour; /*< Real time clock hour setting*/
uint8_t min; /*< Real time clock min setting*/
uint8_t sec; /*< Real time clock sec setting*/
uint8_t timeFormat; /*< Real time clock timeFormat setting*/
uint8_t DayLightSaving; /*< Real time clock DayLightSaving setting*/
}) mavlink_real_time_clock_set_t;
#define MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN 14
#define MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN 14
#define MAVLINK_MSG_ID_209_LEN 14
#define MAVLINK_MSG_ID_209_MIN_LEN 14
#define MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC 234
#define MAVLINK_MSG_ID_209_CRC 234
#if MAVLINK_COMMAND_24BIT
#define MAVLINK_MESSAGE_INFO_REAL_TIME_CLOCK_SET { \
209, \
"REAL_TIME_CLOCK_SET", \
10, \
{ { "subsec", NULL, MAVLINK_TYPE_UINT32_T, 0, 0, offsetof(mavlink_real_time_clock_set_t, subsec) }, \
{ "year", NULL, MAVLINK_TYPE_UINT16_T, 0, 4, offsetof(mavlink_real_time_clock_set_t, year) }, \
{ "month", NULL, MAVLINK_TYPE_UINT8_T, 0, 6, offsetof(mavlink_real_time_clock_set_t, month) }, \
{ "mday", NULL, MAVLINK_TYPE_UINT8_T, 0, 7, offsetof(mavlink_real_time_clock_set_t, mday) }, \
{ "wday", NULL, MAVLINK_TYPE_UINT8_T, 0, 8, offsetof(mavlink_real_time_clock_set_t, wday) }, \
{ "hour", NULL, MAVLINK_TYPE_UINT8_T, 0, 9, offsetof(mavlink_real_time_clock_set_t, hour) }, \
{ "min", NULL, MAVLINK_TYPE_UINT8_T, 0, 10, offsetof(mavlink_real_time_clock_set_t, min) }, \
{ "sec", NULL, MAVLINK_TYPE_UINT8_T, 0, 11, offsetof(mavlink_real_time_clock_set_t, sec) }, \
{ "timeFormat", NULL, MAVLINK_TYPE_UINT8_T, 0, 12, offsetof(mavlink_real_time_clock_set_t, timeFormat) }, \
{ "DayLightSaving", NULL, MAVLINK_TYPE_UINT8_T, 0, 13, offsetof(mavlink_real_time_clock_set_t, DayLightSaving) }, \
} \
}
#else
#define MAVLINK_MESSAGE_INFO_REAL_TIME_CLOCK_SET { \
"REAL_TIME_CLOCK_SET", \
10, \
{ { "subsec", NULL, MAVLINK_TYPE_UINT32_T, 0, 0, offsetof(mavlink_real_time_clock_set_t, subsec) }, \
{ "year", NULL, MAVLINK_TYPE_UINT16_T, 0, 4, offsetof(mavlink_real_time_clock_set_t, year) }, \
{ "month", NULL, MAVLINK_TYPE_UINT8_T, 0, 6, offsetof(mavlink_real_time_clock_set_t, month) }, \
{ "mday", NULL, MAVLINK_TYPE_UINT8_T, 0, 7, offsetof(mavlink_real_time_clock_set_t, mday) }, \
{ "wday", NULL, MAVLINK_TYPE_UINT8_T, 0, 8, offsetof(mavlink_real_time_clock_set_t, wday) }, \
{ "hour", NULL, MAVLINK_TYPE_UINT8_T, 0, 9, offsetof(mavlink_real_time_clock_set_t, hour) }, \
{ "min", NULL, MAVLINK_TYPE_UINT8_T, 0, 10, offsetof(mavlink_real_time_clock_set_t, min) }, \
{ "sec", NULL, MAVLINK_TYPE_UINT8_T, 0, 11, offsetof(mavlink_real_time_clock_set_t, sec) }, \
{ "timeFormat", NULL, MAVLINK_TYPE_UINT8_T, 0, 12, offsetof(mavlink_real_time_clock_set_t, timeFormat) }, \
{ "DayLightSaving", NULL, MAVLINK_TYPE_UINT8_T, 0, 13, offsetof(mavlink_real_time_clock_set_t, DayLightSaving) }, \
} \
}
#endif
/**
* @brief Pack a real_time_clock_set message
* @param system_id ID of this system
* @param component_id ID of this component (e.g. 200 for IMU)
* @param msg The MAVLink message to compress the data into
*
* @param subsec Real time clock sec setting
* @param year Real time clock Year setting
* @param month Real time clock month setting
* @param mday Real time clock month setting
* @param wday Real time clock wday setting
* @param hour Real time clock hour setting
* @param min Real time clock min setting
* @param sec Real time clock sec setting
* @param timeFormat Real time clock timeFormat setting
* @param DayLightSaving Real time clock DayLightSaving setting
* @return length of the message in bytes (excluding serial stream start sign)
*/
static inline uint16_t mavlink_msg_real_time_clock_set_pack(uint8_t system_id, uint8_t component_id, mavlink_message_t* msg,
uint32_t subsec, uint16_t year, uint8_t month, uint8_t mday, uint8_t wday, uint8_t hour, uint8_t min, uint8_t sec, uint8_t timeFormat, uint8_t DayLightSaving)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
char buf[MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN];
_mav_put_uint32_t(buf, 0, subsec);
_mav_put_uint16_t(buf, 4, year);
_mav_put_uint8_t(buf, 6, month);
_mav_put_uint8_t(buf, 7, mday);
_mav_put_uint8_t(buf, 8, wday);
_mav_put_uint8_t(buf, 9, hour);
_mav_put_uint8_t(buf, 10, min);
_mav_put_uint8_t(buf, 11, sec);
_mav_put_uint8_t(buf, 12, timeFormat);
_mav_put_uint8_t(buf, 13, DayLightSaving);
memcpy(_MAV_PAYLOAD_NON_CONST(msg), buf, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN);
#else
mavlink_real_time_clock_set_t packet;
packet.subsec = subsec;
packet.year = year;
packet.month = month;
packet.mday = mday;
packet.wday = wday;
packet.hour = hour;
packet.min = min;
packet.sec = sec;
packet.timeFormat = timeFormat;
packet.DayLightSaving = DayLightSaving;
memcpy(_MAV_PAYLOAD_NON_CONST(msg), &packet, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN);
#endif
msg->msgid = MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET;
return mavlink_finalize_message(msg, system_id, component_id, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
}
/**
* @brief Pack a real_time_clock_set message on a channel
* @param system_id ID of this system
* @param component_id ID of this component (e.g. 200 for IMU)
* @param chan The MAVLink channel this message will be sent over
* @param msg The MAVLink message to compress the data into
* @param subsec Real time clock sec setting
* @param year Real time clock Year setting
* @param month Real time clock month setting
* @param mday Real time clock month setting
* @param wday Real time clock wday setting
* @param hour Real time clock hour setting
* @param min Real time clock min setting
* @param sec Real time clock sec setting
* @param timeFormat Real time clock timeFormat setting
* @param DayLightSaving Real time clock DayLightSaving setting
* @return length of the message in bytes (excluding serial stream start sign)
*/
static inline uint16_t mavlink_msg_real_time_clock_set_pack_chan(uint8_t system_id, uint8_t component_id, uint8_t chan,
mavlink_message_t* msg,
uint32_t subsec,uint16_t year,uint8_t month,uint8_t mday,uint8_t wday,uint8_t hour,uint8_t min,uint8_t sec,uint8_t timeFormat,uint8_t DayLightSaving)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
char buf[MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN];
_mav_put_uint32_t(buf, 0, subsec);
_mav_put_uint16_t(buf, 4, year);
_mav_put_uint8_t(buf, 6, month);
_mav_put_uint8_t(buf, 7, mday);
_mav_put_uint8_t(buf, 8, wday);
_mav_put_uint8_t(buf, 9, hour);
_mav_put_uint8_t(buf, 10, min);
_mav_put_uint8_t(buf, 11, sec);
_mav_put_uint8_t(buf, 12, timeFormat);
_mav_put_uint8_t(buf, 13, DayLightSaving);
memcpy(_MAV_PAYLOAD_NON_CONST(msg), buf, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN);
#else
mavlink_real_time_clock_set_t packet;
packet.subsec = subsec;
packet.year = year;
packet.month = month;
packet.mday = mday;
packet.wday = wday;
packet.hour = hour;
packet.min = min;
packet.sec = sec;
packet.timeFormat = timeFormat;
packet.DayLightSaving = DayLightSaving;
memcpy(_MAV_PAYLOAD_NON_CONST(msg), &packet, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN);
#endif
msg->msgid = MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET;
return mavlink_finalize_message_chan(msg, system_id, component_id, chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
}
/**
* @brief Encode a real_time_clock_set struct
*
* @param system_id ID of this system
* @param component_id ID of this component (e.g. 200 for IMU)
* @param msg The MAVLink message to compress the data into
* @param real_time_clock_set C-struct to read the message contents from
*/
static inline uint16_t mavlink_msg_real_time_clock_set_encode(uint8_t system_id, uint8_t component_id, mavlink_message_t* msg, const mavlink_real_time_clock_set_t* real_time_clock_set)
{
return mavlink_msg_real_time_clock_set_pack(system_id, component_id, msg, real_time_clock_set->subsec, real_time_clock_set->year, real_time_clock_set->month, real_time_clock_set->mday, real_time_clock_set->wday, real_time_clock_set->hour, real_time_clock_set->min, real_time_clock_set->sec, real_time_clock_set->timeFormat, real_time_clock_set->DayLightSaving);
}
/**
* @brief Encode a real_time_clock_set struct on a channel
*
* @param system_id ID of this system
* @param component_id ID of this component (e.g. 200 for IMU)
* @param chan The MAVLink channel this message will be sent over
* @param msg The MAVLink message to compress the data into
* @param real_time_clock_set C-struct to read the message contents from
*/
static inline uint16_t mavlink_msg_real_time_clock_set_encode_chan(uint8_t system_id, uint8_t component_id, uint8_t chan, mavlink_message_t* msg, const mavlink_real_time_clock_set_t* real_time_clock_set)
{
return mavlink_msg_real_time_clock_set_pack_chan(system_id, component_id, chan, msg, real_time_clock_set->subsec, real_time_clock_set->year, real_time_clock_set->month, real_time_clock_set->mday, real_time_clock_set->wday, real_time_clock_set->hour, real_time_clock_set->min, real_time_clock_set->sec, real_time_clock_set->timeFormat, real_time_clock_set->DayLightSaving);
}
/**
* @brief Send a real_time_clock_set message
* @param chan MAVLink channel to send the message
*
* @param subsec Real time clock sec setting
* @param year Real time clock Year setting
* @param month Real time clock month setting
* @param mday Real time clock month setting
* @param wday Real time clock wday setting
* @param hour Real time clock hour setting
* @param min Real time clock min setting
* @param sec Real time clock sec setting
* @param timeFormat Real time clock timeFormat setting
* @param DayLightSaving Real time clock DayLightSaving setting
*/
#ifdef MAVLINK_USE_CONVENIENCE_FUNCTIONS
static inline void mavlink_msg_real_time_clock_set_send(mavlink_channel_t chan, uint32_t subsec, uint16_t year, uint8_t month, uint8_t mday, uint8_t wday, uint8_t hour, uint8_t min, uint8_t sec, uint8_t timeFormat, uint8_t DayLightSaving)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
char buf[MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN];
_mav_put_uint32_t(buf, 0, subsec);
_mav_put_uint16_t(buf, 4, year);
_mav_put_uint8_t(buf, 6, month);
_mav_put_uint8_t(buf, 7, mday);
_mav_put_uint8_t(buf, 8, wday);
_mav_put_uint8_t(buf, 9, hour);
_mav_put_uint8_t(buf, 10, min);
_mav_put_uint8_t(buf, 11, sec);
_mav_put_uint8_t(buf, 12, timeFormat);
_mav_put_uint8_t(buf, 13, DayLightSaving);
_mav_finalize_message_chan_send(chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET, buf, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
#else
mavlink_real_time_clock_set_t packet;
packet.subsec = subsec;
packet.year = year;
packet.month = month;
packet.mday = mday;
packet.wday = wday;
packet.hour = hour;
packet.min = min;
packet.sec = sec;
packet.timeFormat = timeFormat;
packet.DayLightSaving = DayLightSaving;
_mav_finalize_message_chan_send(chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET, (const char *)&packet, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
#endif
}
/**
* @brief Send a real_time_clock_set message
* @param chan MAVLink channel to send the message
* @param struct The MAVLink struct to serialize
*/
static inline void mavlink_msg_real_time_clock_set_send_struct(mavlink_channel_t chan, const mavlink_real_time_clock_set_t* real_time_clock_set)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
mavlink_msg_real_time_clock_set_send(chan, real_time_clock_set->subsec, real_time_clock_set->year, real_time_clock_set->month, real_time_clock_set->mday, real_time_clock_set->wday, real_time_clock_set->hour, real_time_clock_set->min, real_time_clock_set->sec, real_time_clock_set->timeFormat, real_time_clock_set->DayLightSaving);
#else
_mav_finalize_message_chan_send(chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET, (const char *)real_time_clock_set, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
#endif
}
#if MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN <= MAVLINK_MAX_PAYLOAD_LEN
/*
This varient of _send() can be used to save stack space by re-using
memory from the receive buffer. The caller provides a
mavlink_message_t which is the size of a full mavlink message. This
is usually the receive buffer for the channel, and allows a reply to an
incoming message with minimum stack space usage.
*/
static inline void mavlink_msg_real_time_clock_set_send_buf(mavlink_message_t *msgbuf, mavlink_channel_t chan, uint32_t subsec, uint16_t year, uint8_t month, uint8_t mday, uint8_t wday, uint8_t hour, uint8_t min, uint8_t sec, uint8_t timeFormat, uint8_t DayLightSaving)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
char *buf = (char *)msgbuf;
_mav_put_uint32_t(buf, 0, subsec);
_mav_put_uint16_t(buf, 4, year);
_mav_put_uint8_t(buf, 6, month);
_mav_put_uint8_t(buf, 7, mday);
_mav_put_uint8_t(buf, 8, wday);
_mav_put_uint8_t(buf, 9, hour);
_mav_put_uint8_t(buf, 10, min);
_mav_put_uint8_t(buf, 11, sec);
_mav_put_uint8_t(buf, 12, timeFormat);
_mav_put_uint8_t(buf, 13, DayLightSaving);
_mav_finalize_message_chan_send(chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET, buf, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
#else
mavlink_real_time_clock_set_t *packet = (mavlink_real_time_clock_set_t *)msgbuf;
packet->subsec = subsec;
packet->year = year;
packet->month = month;
packet->mday = mday;
packet->wday = wday;
packet->hour = hour;
packet->min = min;
packet->sec = sec;
packet->timeFormat = timeFormat;
packet->DayLightSaving = DayLightSaving;
_mav_finalize_message_chan_send(chan, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET, (const char *)packet, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_MIN_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_CRC);
#endif
}
#endif
#endif
// MESSAGE REAL_TIME_CLOCK_SET UNPACKING
/**
* @brief Get field subsec from real_time_clock_set message
*
* @return Real time clock sec setting
*/
static inline uint32_t mavlink_msg_real_time_clock_set_get_subsec(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint32_t(msg, 0);
}
/**
* @brief Get field year from real_time_clock_set message
*
* @return Real time clock Year setting
*/
static inline uint16_t mavlink_msg_real_time_clock_set_get_year(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint16_t(msg, 4);
}
/**
* @brief Get field month from real_time_clock_set message
*
* @return Real time clock month setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_month(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 6);
}
/**
* @brief Get field mday from real_time_clock_set message
*
* @return Real time clock month setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_mday(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 7);
}
/**
* @brief Get field wday from real_time_clock_set message
*
* @return Real time clock wday setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_wday(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 8);
}
/**
* @brief Get field hour from real_time_clock_set message
*
* @return Real time clock hour setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_hour(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 9);
}
/**
* @brief Get field min from real_time_clock_set message
*
* @return Real time clock min setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_min(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 10);
}
/**
* @brief Get field sec from real_time_clock_set message
*
* @return Real time clock sec setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_sec(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 11);
}
/**
* @brief Get field timeFormat from real_time_clock_set message
*
* @return Real time clock timeFormat setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_timeFormat(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 12);
}
/**
* @brief Get field DayLightSaving from real_time_clock_set message
*
* @return Real time clock DayLightSaving setting
*/
static inline uint8_t mavlink_msg_real_time_clock_set_get_DayLightSaving(const mavlink_message_t* msg)
{
return _MAV_RETURN_uint8_t(msg, 13);
}
/**
* @brief Decode a real_time_clock_set message into a struct
*
* @param msg The message to decode
* @param real_time_clock_set C-struct to decode the message contents into
*/
static inline void mavlink_msg_real_time_clock_set_decode(const mavlink_message_t* msg, mavlink_real_time_clock_set_t* real_time_clock_set)
{
#if MAVLINK_NEED_BYTE_SWAP || !MAVLINK_ALIGNED_FIELDS
real_time_clock_set->subsec = mavlink_msg_real_time_clock_set_get_subsec(msg);
real_time_clock_set->year = mavlink_msg_real_time_clock_set_get_year(msg);
real_time_clock_set->month = mavlink_msg_real_time_clock_set_get_month(msg);
real_time_clock_set->mday = mavlink_msg_real_time_clock_set_get_mday(msg);
real_time_clock_set->wday = mavlink_msg_real_time_clock_set_get_wday(msg);
real_time_clock_set->hour = mavlink_msg_real_time_clock_set_get_hour(msg);
real_time_clock_set->min = mavlink_msg_real_time_clock_set_get_min(msg);
real_time_clock_set->sec = mavlink_msg_real_time_clock_set_get_sec(msg);
real_time_clock_set->timeFormat = mavlink_msg_real_time_clock_set_get_timeFormat(msg);
real_time_clock_set->DayLightSaving = mavlink_msg_real_time_clock_set_get_DayLightSaving(msg);
#else
uint8_t len = msg->len < MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN? msg->len : MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN;
memset(real_time_clock_set, 0, MAVLINK_MSG_ID_REAL_TIME_CLOCK_SET_LEN);
memcpy(real_time_clock_set, _MAV_PAYLOAD(msg), len);
#endif
}
|
68dcc0eff26d3a50fb0aea4b466bdb20c243492b
|
976f5e0b583c3f3a87a142187b9a2b2a5ae9cf6f
|
/source/freebsd/sys/x86/x86/extr_local_apic.c_lapic_calibrate_initcount.c
|
15abb31c70d96725daf368eff3a055022a0ebc21
|
[] |
no_license
|
isabella232/AnghaBench
|
7ba90823cf8c0dd25a803d1688500eec91d1cf4e
|
9a5f60cdc907a0475090eef45e5be43392c25132
|
refs/heads/master
| 2023-04-20T09:05:33.024569 | 2021-05-07T18:36:26 | 2021-05-07T18:36:26 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,652 |
c
|
extr_local_apic.c_lapic_calibrate_initcount.c
|
#define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward declarations */
/* Type definitions */
typedef scalar_t__ u_long ;
struct lapic {int dummy; } ;
/* Variables and functions */
scalar_t__ APIC_TIMER_MAX_COUNT ;
int /*<<< orphan*/ DELAY (int) ;
int /*<<< orphan*/ LAPIC_CCR_TIMER ;
scalar_t__ bootverbose ;
scalar_t__ count_freq ;
scalar_t__ lapic_read32 (int /*<<< orphan*/ ) ;
int lapic_timer_divisor ;
int /*<<< orphan*/ lapic_timer_oneshot_nointr (struct lapic*,scalar_t__) ;
int /*<<< orphan*/ lapic_timer_set_divisor (int) ;
int /*<<< orphan*/ panic (char*) ;
int /*<<< orphan*/ printf (char*,int,scalar_t__) ;
__attribute__((used)) static void
lapic_calibrate_initcount(struct lapic *la)
{
u_long value;
/* Start off with a divisor of 2 (power on reset default). */
lapic_timer_divisor = 2;
/* Try to calibrate the local APIC timer. */
do {
lapic_timer_set_divisor(lapic_timer_divisor);
lapic_timer_oneshot_nointr(la, APIC_TIMER_MAX_COUNT);
DELAY(1000000);
value = APIC_TIMER_MAX_COUNT - lapic_read32(LAPIC_CCR_TIMER);
if (value != APIC_TIMER_MAX_COUNT)
break;
lapic_timer_divisor <<= 1;
} while (lapic_timer_divisor <= 128);
if (lapic_timer_divisor > 128)
panic("lapic: Divisor too big");
if (bootverbose) {
printf("lapic: Divisor %lu, Frequency %lu Hz\n",
lapic_timer_divisor, value);
}
count_freq = value;
}
|
801595c8d7d564f90a80af7454fc6412249766bb
|
1236837bcd4f595e7e2f31557e62ed58fc6d4e05
|
/c01/ex08/ft_sort_int_tab.c
|
cb8c65fb4b8a7eb6a2ae3982d65b670cc6168d1c
|
[] |
no_license
|
soykilian/42piscina
|
415100021789de4f227bf89f5a6dd7f030c6ec80
|
2434dc1fdf2691acc79f516b56d4db5c6809b261
|
refs/heads/master
| 2023-06-22T21:08:35.689612 | 2021-07-14T19:00:54 | 2021-07-14T19:00:54 | 380,812,094 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,197 |
c
|
ft_sort_int_tab.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_sort_int_tab.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mclerico <mclerico@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/06/26 12:09:21 by mclerico #+# #+# */
/* Updated: 2021/07/07 10:46:37 by mclerico ### ########.fr */
/* */
/* ************************************************************************** */
void ft_sort_int_tab(int *tab, int size)
{
int i;
int ord;
int act;
int sig;
i = 0;
ord = 0;
while (ord == 0 )
{
ord = 1;
while (i < size - 1)
{
act = tab[i];
sig = tab[i + 1];
if (act > sig)
{
tab[i + 1] = act;
tab[i] = sig;
ord = 0;
}
i++;
}
i = 0;
}
}
|
4ca1764c2af41789cf20c2fc35f617a50ec5a0c6
|
648a28444f41f9d95f3d02fb85bbc60f6adebb2d
|
/primoej.c
|
afab3e01feae86e2821946b05e241510af0f8937
|
[] |
no_license
|
CrossNox/codegolfing
|
1f7eaac8efce4263421230b1c3bea411f272d6d7
|
29c9bf5a6cee23000da713842779fd307df69cf5
|
refs/heads/master
| 2021-06-02T13:31:04.571323 | 2016-09-10T06:06:23 | 2016-09-10T06:06:23 | 59,879,746 | 2 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 43 |
c
|
primoej.c
|
main(a,b){for(scanf("%d",&b);b%++a;);a/=b;}
|
466aaea4ab2ad77aee0e244a32d27fbf923cfe9b
|
f246f9d0a10e08344cdbdc85122e95bc6d670a8f
|
/prob39.c
|
ad4329467fec1acdcbea6ab7a6036d05e19387d5
|
[] |
no_license
|
pavantc/project_euler
|
bfdc925c93363403dfaa292e3cf9043db46fba83
|
36602f589dfa8b7fd1073c9eb8a611779c30a94b
|
refs/heads/master
| 2020-04-14T05:41:17.193809 | 2012-10-23T13:27:08 | 2012-10-23T13:27:08 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 422 |
c
|
prob39.c
|
#include <stdio.h>
#include <stdlib.h>
#define SQ(x) (x * x)
int
main()
{
int a, b, c, n, sum, max = 0, max_n, count;
for (n = 1000; n > 5; n--) {
count = 0;
for (a = n/2; a > 0; a--) {
sum = n - a;
for (b = 1; b < sum; b++) {
c = sum - b;
if (SQ(a) == (SQ(b) + SQ(c))) {
count++;
}
}
}
if (count > max) {
max = count;
max_n = n;
}
}
printf("%d\n", max_n);
return (0);
}
|
e6ab32065648f4c7f0b3d38db6540872a92fbbc4
|
dddbf02291026c79a7146fc854ea01db47f62a92
|
/joycon_spoofer/Src/joycon_cmd.c
|
a497567ba4bc2b65d8cd0f188873c07d64a5aacd
|
[] |
no_license
|
shinyquagsire23/Nintendo_Switch_Reverse_Engineering
|
5d7ae163057561486200fa34adcd9c55ba487920
|
2e347e66d844cf5f1784be5991533821b1d67b9a
|
refs/heads/master
| 2021-01-19T08:24:45.185453 | 2017-04-08T11:03:30 | 2017-04-08T11:03:30 | 87,625,931 | 5 | 1 | null | 2017-04-08T10:27:29 | 2017-04-08T10:27:28 | null |
UTF-8
|
C
| false | false | 5,896 |
c
|
joycon_cmd.c
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "joycon_cmd.h"
linear_buf switch_lb;
uint8_t handshake_header[4] = {0xa1, 0xa2, 0xa3, 0xa4};
uint8_t connect_request[12] = {0x19, 0x01, 0x03, 0x07, 0x00, 0xA5, 0x02, 0x01, 0x7E, 0x00, 0x00, 0x00};
uint8_t connect_request_response[12] = {0x19, 0x81, 0x03, 0x07, 0x00, 0xA5, 0x02, 0x02, 0x7D, 0x00, 0x00, 0x64};
uint8_t cmd2[12] = {0x19, 0x01, 0x03, 0x07, 0x00, 0x91, 0x01, 0x00, 0x00, 0x00, 0x00, 0x24};
// grey
uint8_t cmd2_response[20] = {0x19, 0x81, 0x03, 0x0F, 0x00, 0x94, 0x01, 0x08, 0x00, 0x00, 0xFA, 0xE8, 0x01, 0x31, 0x67, 0x9C, 0x8A, 0xBB, 0x7C, 0x00};
// red
// uint8_t cmd2_response[20] = {0x19, 0x81, 0x03, 0x0F, 0x00, 0x94, 0x01, 0x08, 0x00, 0x00, 0x8F, 0x87, 0x01, 0xE6, 0x4C, 0x5F, 0xB9, 0xE6, 0x98, 0x00};
uint8_t cmd3[20] = {0x19, 0x01, 0x03, 0x0F, 0x00, 0x91, 0x20, 0x08, 0x00, 0x00, 0xBD, 0xB1, 0xC0, 0xC6, 0x2D, 0x00, 0x00, 0x00, 0x00, 0x00};
uint8_t cmd3_response[12] = {0x19, 0x81, 0x03, 0x07, 0x00, 0x94, 0x20, 0x00, 0x00, 0x00, 0x00, 0xA8};
uint8_t cmd4[12] = {0x19, 0x01, 0x03, 0x07, 0x00, 0x91, 0x11, 0x00, 0x00, 0x00, 0x00, 0x0E};
uint8_t cmd4_response[12] = {0x19, 0x81, 0x03, 0x07, 0x00, 0x94, 0x11, 0x00, 0x00, 0x0F, 0x00, 0x33};
uint8_t cmd5[12] = {0x19, 0x01, 0x03, 0x07, 0x00, 0x91, 0x10, 0x00, 0x00, 0x00, 0x00, 0x3D};
uint8_t cmd5_response[12] = {0x19, 0x81, 0x03, 0x07, 0x00, 0x94, 0x10, 0x00, 0x00, 0x00, 0x00, 0xD6};
uint8_t cmd6[16] = {0x19, 0x01, 0x03, 0x0B, 0x00, 0x91, 0x12, 0x04, 0x00, 0x00, 0x12, 0xA6, 0x0F, 0x00, 0x00, 0x00};
uint8_t cmd6_response[12] = {0x19, 0x81, 0x03, 0x07, 0x00, 0x94, 0x12, 0x00, 0x00, 0x00, 0x00, 0xB0};
uint8_t update_request[13] = {0x19, 0x01, 0x03, 0x08, 0x00, 0x92, 0x00, 0x01, 0x00, 0x00, 0x69, 0x2D, 0x1F};
uint8_t update_request_reponse[61] = {0x19, 0x81, 0x03, 0x38, 0x00, 0x92, 0x00, 0x31, 0x00, 0x00, 0xD2, 0xD2, 0x30, 0xCA, 0x50, 0x00, 0x80, 0x00, 0x6F, 0x67, 0x84, 0x00, 0x00, 0x00, 0x90, 0x4D, 0x00, 0x2E, 0x00, 0x71, 0x10, 0xF7, 0xFF, 0xDD, 0xFF, 0xA5, 0x00, 0x9B, 0x00, 0x49, 0x00, 0x4A, 0x10, 0x36, 0x00, 0xD9, 0xFF, 0xA7, 0x00, 0x05, 0x01, 0x56, 0x00, 0xA3, 0x10, 0x3E, 0x00, 0xDE, 0xFF, 0xA7, 0x00};
void fatal_error()
{
while(1)
{
HAL_GPIO_WritePin(DEBUG_LED_GPIO_Port, DEBUG_LED_Pin, GPIO_PIN_SET);
HAL_Delay(400);
HAL_GPIO_WritePin(DEBUG_LED_GPIO_Port, DEBUG_LED_Pin, GPIO_PIN_RESET);
HAL_Delay(100);
for (int i = 0; i < 32; ++i)
printf("0x%x ", switch_lb.buf[i]);
printf("\n\n");
}
}
void usart2_init(uint32_t baud)
{
stm32_uart2_ptr->Instance = USART2;
stm32_uart2_ptr->Init.BaudRate = baud;
stm32_uart2_ptr->Init.WordLength = UART_WORDLENGTH_8B;
stm32_uart2_ptr->Init.StopBits = UART_STOPBITS_1;
stm32_uart2_ptr->Init.Parity = UART_PARITY_NONE;
stm32_uart2_ptr->Init.Mode = UART_MODE_TX_RX;
stm32_uart2_ptr->Init.HwFlowCtl = UART_HWCONTROL_NONE;
stm32_uart2_ptr->Init.OverSampling = UART_OVERSAMPLING_16;
stm32_uart2_ptr->Init.OneBitSampling = UART_ONE_BIT_SAMPLE_DISABLE;
stm32_uart2_ptr->AdvancedInit.AdvFeatureInit = UART_ADVFEATURE_RXINVERT_INIT;
stm32_uart2_ptr->AdvancedInit.RxPinLevelInvert = UART_ADVFEATURE_RXINV_ENABLE;
if (HAL_UART_Init(stm32_uart2_ptr) != HAL_OK)
{
fatal_error();
}
}
void transmit_with_cts(uint8_t *data, uint16_t size)
{
for (int i = 0; i < size; ++i)
{
while(HAL_GPIO_ReadPin(GPIOA, FC_JC_TX_EN_Pin) == GPIO_PIN_RESET)
;
HAL_UART_Transmit(stm32_uart2_ptr, data + i, 1, 1000);
}
}
void get_header()
{
HAL_UART_Receive_IT(stm32_uart2_ptr, switch_lb.buf, 4);
NSTX_ENABLE();
uart_status = UART_WAITING;
while(uart_status != UART_RECEIVED)
if(huart2.RxXferCount <= 1)
NSTX_DISABLE();
}
void get_payload()
{
uint8_t* buf_start = switch_lb.buf + 4;
uint8_t recv_size = switch_lb.buf[3] + 1;
HAL_UART_Receive_IT(stm32_uart2_ptr, buf_start, recv_size);
NSTX_ENABLE();
uart_status = UART_WAITING;
while(uart_status != UART_RECEIVED)
if(huart2.RxXferCount <= 1)
NSTX_DISABLE();
}
void get_msg()
{
linear_buf_reset(&switch_lb);
get_header();
if(memcmp(switch_lb.buf, handshake_header, 4) == 0)
get_header();
get_payload();
}
void attach()
{
HAL_UART_MspDeInit(stm32_uart2_ptr);
GPIO_InitTypeDef GPIO_InitStruct;
GPIO_InitStruct.Pin = GPIO_PIN_3;
GPIO_InitStruct.Mode = GPIO_MODE_INPUT;
GPIO_InitStruct.Pull = GPIO_PULLDOWN;
HAL_GPIO_Init(GPIOA, &GPIO_InitStruct);
HAL_Delay(1000);
HAL_GPIO_DeInit(GPIOA, GPIO_PIN_3);
HAL_UART_MspInit(stm32_uart2_ptr);
usart2_init(1000000);
get_msg();
if(memcmp(switch_lb.buf, connect_request, 12) != 0)
fatal_error();
transmit_with_cts(connect_request_response, 12);
get_msg();
if(memcmp(switch_lb.buf, cmd2, 12) != 0)
fatal_error();
transmit_with_cts(cmd2_response, 20);
get_msg();
if(memcmp(switch_lb.buf, cmd3, 20) != 0)
fatal_error();
transmit_with_cts(cmd3_response, 12);
HAL_UART_MspDeInit(stm32_uart2_ptr);
while(HAL_GPIO_ReadPin(GPIOA, GPIO_PIN_3) == GPIO_PIN_RESET)
;
while(HAL_GPIO_ReadPin(GPIOA, GPIO_PIN_3) == GPIO_PIN_SET)
;
HAL_UART_MspInit(stm32_uart2_ptr);
usart2_init(3125000);
get_msg();
if(memcmp(switch_lb.buf, cmd4, 12) != 0)
fatal_error();
transmit_with_cts(cmd4_response, 12);
get_msg();
if(memcmp(switch_lb.buf, cmd5, 12) != 0)
fatal_error();
transmit_with_cts(cmd5_response, 12);
get_msg();
if(memcmp(switch_lb.buf, cmd6, 16) != 0)
fatal_error();
transmit_with_cts(cmd6_response, 12);
while(1)
{
get_msg();
if(memcmp(switch_lb.buf, update_request, 13) == 0)
transmit_with_cts(update_request_reponse, 61);
}
for (int i = 0; i < 32; ++i)
printf("0x%x ", switch_lb.buf[i]);
printf("\ndone!\n");
}
|
36e4bad4cd2fc3fb2376d212d888fa5724588f2b
|
46433eef4cb129b7bf803842f57be71e72cc946f
|
/hackerrank/Day 1 Data Types.c
|
010663f6202d6d360bc1678e97c5f58a9bfd53e8
|
[] |
no_license
|
asifjoardar/solving-oj-problems
|
7300f2bb6ce651c79b9a90649b38b8baf5fc517d
|
992c6472ffefea024a6879e1007d8118b7d221ca
|
refs/heads/master
| 2022-05-15T15:55:53.822581 | 2022-05-07T18:26:18 | 2022-05-07T18:26:18 | 136,577,556 | 0 | 1 | null | null | null | null |
UTF-8
|
C
| false | false | 740 |
c
|
Day 1 Data Types.c
|
#include <stdio.h>
int main() {
int i = 4;
double d = 4.0;
char s[] = "HackerRank ";
// Declare second integer, double, and String variables.
int j;
char s1[100];
double d1;
// Read and save an integer, double, and String to your variables.
scanf("%d",&j);
scanf("%lf",&d1);
getchar();
gets(s1);
//scanf("%s",s1);
// Print the sum of both integer variables on a new line.
printf("%d\n",i+j);
// Print the sum of the double variables on a new line.
printf("%.1lf\n",d+d1);
// Concatenate and print the String variables on a new line
// The 's' variable above should be printed first.
printf("%s%s\n",s,s1);
return 0;
}
|
db570213c58aeeba746e7fdb9bb53ae8ce98f179
|
b01362095f36b4da5a77a41a3de3f27df394c7eb
|
/RandomSampleEliot/AudioSampleRibbet.h
|
280cc5bc2b1e3899b902abc1184e04fc388735a4
|
[] |
no_license
|
ryanbledsoe/DuoTEMPORARY
|
ff593864293807ae9cf7ba63dc8e8ea986934e06
|
e1fe6a06a5945624fa1ba609d516b328f405271b
|
refs/heads/master
| 2021-01-25T00:22:12.482306 | 2017-10-26T01:38:07 | 2017-10-26T01:38:07 | 97,345,737 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 107 |
h
|
AudioSampleRibbet.h
|
// Audio data converted from WAV file by wav2sketch
extern const unsigned int AudioSampleRibbet[5889];
|
a7ea194318c1fc1403c6b20793fa04fa999b0d4a
|
f121151e11cbfb3f615bc9bd05890a92b0821059
|
/ds.c
|
f58496ca643c0e5da743eb32c6c7fed19f5c1695
|
[] |
no_license
|
gauravsingh9891/Data-structure
|
77d531d6cd11ba45bf5b13c19072fde59e5fa47c
|
d548d7a74cbe46e7fc42dc0daf939e4d169c42db
|
refs/heads/master
| 2020-07-11T04:03:02.155043 | 2019-12-02T18:14:52 | 2019-12-02T18:14:52 | 204,440,919 | 2 | 1 | null | 2019-08-30T17:43:22 | 2019-08-26T09:22:18 |
C
|
UTF-8
|
C
| false | false | 929 |
c
|
ds.c
|
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>
int a[5],top=-1;
void push();
void pop();
void list();
main()
{
int d;
while(1)
{
puts("\nMain stack menu\n");
puts("\n Press 1: push");
puts("\n Press 2: pop");
puts("\n Press 3: list");
puts("\n Press 4: exit");
puts("\n Enter the choice ");
scanf("%d",&d);
switch(d)
{
case 1: push();
break;
case 2: pop();
break;
case 3: list();
break;
case 4: exit(0);
default: puts("\n Invalid input!");
}
}
getch();
}
push()
{
top++;
if(top==5)
{
puts("stack is overflow");
top--;
getch();
}
else
{
puts("\nenter the new elements");
scanf("%d",&a[top]);
}
}
pop()
{
if(top==-1)
{
puts("\nstack is underflow");
getch();
}
else
{
printf("\n%d is popped",a[top]);
a[top]=0;
top--;
}
}
list()
{
int i;
puts("\nstack elements are\n");
for(i=0;i<top;i++)
printf("\n%d",a[i]);
getch();
}
|
f44a2617c394fd0af13b3f1764ea1a82920964d6
|
e38365f1861205b51f2157206338928988114563
|
/processes/mycli/cli_mini/common/platform/bc_platform_thread.c
|
f49c9c251c52757ff39fbe642236356cbc255ca1
|
[] |
no_license
|
bainwang/igmp-snooping
|
5b57a8e95be762bd956ca315fc55384cdebc9cdd
|
c290664a5e7d624267dd08cddad0c005e641e4fb
|
refs/heads/master
| 2021-04-30T14:44:06.179054 | 2018-02-12T09:03:34 | 2018-02-12T09:03:34 | 121,224,586 | 7 | 2 | null | null | null | null |
GB18030
|
C
| false | false | 16,503 |
c
|
bc_platform_thread.c
|
/************************************************************
Copyright (C), 1988-2014, xxxxx Tech. Co., Ltd.
FileName:
Author: wangbin Version : 1.0 Date:2014-2-8
Description: 线程相关函数
Version: 1.0
History:
1. Date:
Author:
Modification:
2. ...
***********************************************************/
#include "bc_platform_thread.h"
#include "bc_platform_sem.h"
#include "bc_platform_time.h"
#include "bc_platform_mem.h"
#include "bc_platform_mutex.h"
#include "bc_print.h"
#include "utili_list.h"
#define BC_PLATFORM_THREAD_DEBUG 1
#if BC_PLATFORM_THREAD_DEBUG
static bc_uint32 bc_platform_thread_count_curr;
static bc_uint32 bc_platform_thread_count_max;
static bc_uint32 bc_platform_thread_stack_size_curr;
static bc_uint32 bc_platform_thread_stack_size_max;
#define BC_PLATFORM_THREAD_RESOURCE_USAGE_INCR(a_cnt, a_cnt_max, a_sz, \
a_sz_max, n_ssize, ilock) \
a_cnt++; \
a_sz += (n_ssize); \
a_cnt_max = ((a_cnt) > (a_cnt_max)) ? (a_cnt) : (a_cnt_max); \
a_sz_max = ((a_sz) > (a_sz_max)) ? (a_sz) : (a_sz_max)
#define BC_PLATFORM_THREAD_RESOURCE_USAGE_DECR(a_count, a_ssize, n_ssize, ilock)\
a_count--; \
a_ssize -= (n_ssize)
/*
* Function:
* bc_platform_thread_ResourceUsageGet
* Purpose:
* Provides count of active threads and stack allocation
* Parameters:
* alloc_curr - Current memory usage.
* alloc_max - Memory usage high water mark
*/
void bc_platform_thread_ResourceUsageGet(unsigned int *ktos_thread_count_curr,
unsigned int *ktos_stack_size_curr,
unsigned int *ktos_thread_count_max,
unsigned int *ktos_stack_size_max)
{
if (ktos_thread_count_curr != NULL) {
*ktos_thread_count_curr = bc_platform_thread_count_curr;
}
if (ktos_stack_size_curr != NULL) {
*ktos_stack_size_curr = bc_platform_thread_stack_size_curr;
}
if (ktos_thread_count_max != NULL) {
*ktos_thread_count_max = bc_platform_thread_count_max;
}
if (ktos_stack_size_max != NULL) {
*ktos_stack_size_max = bc_platform_thread_stack_size_max;
}
}
#else
/* Resource tracking disabled */
#define BC_PLATFORM_THREAD_RESOURCE_USAGE_INCR(a_cnt, a_cnt_max, a_sz, \
a_sz_max, n_ssize, ilock)
#define BC_PLATFORM_THREAD_RESOURCE_USAGE_DECR(a_count, a_ssize, n_ssize, ilock)
#endif
#define BC_PTHREAD_STACK_MIN (16*BC_THREAD_1K_STACK_SIAE) /* min stack 16k*/
#define BC_PTHREAD_STACK_MAX (5*1024*BC_THREAD_1K_STACK_SIAE) /*max stack 5M*/
/*
* Function:
* thread_boot
* Purpose:
* Entry point for each new thread created
* Parameters:
* ti - information about thread being created
* Notes:
* Signals and other parameters are configured before jumping to
* the actual thread's main routine.
*/
typedef struct {
bc_char name[BC_THREAD_MAX_API_NAME];
bc_thread_t id;
bc_int32 stacksize;
bc_int32 prio;
bc_pid_t tid;
void (*f)(void *);
void *arg;
bc_sem_t *sem;
} bc_thread_info_t;
typedef struct
{
utili_node utili_node;
bc_thread_info_t data;
} bc_thread_node_t;
static utili_list bc_platform_thread_head;
static bc_pthread_mutex_t *bc_platform_thread_mut;
static void *__bc_platform_thread_boot( void *ti_void)
{
bc_thread_info_t *ti = ti_void;
void (*f)(void *);
void *arg;
/* Ensure that we give up all resources upon exit */
pthread_detach(pthread_self());
#ifndef netbsd
/* not supported */
pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);
pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
#endif /* netbsd */
f = ti->f;
arg = ti->arg;
ti->id = pthread_self();
ti->tid = syscall(SYS_gettid);
/* Notify parent to continue */
bc_platform_sem_post(ti->sem);
/* Call thread function */
(*f)(arg);
/* Thread function did not call bc_platform_thread_exit() */
bc_platform_thread_exit(0);
/* Will never get here */
return NULL;
}
static bc_int32 __bc_platform_thread_compare(void * node, bc_uint32 key)
{
bc_thread_info_t *ti = &((bc_thread_node_t *)node)->data;
if(node == NULL)
{
return -1;
}
if(ti->id == (bc_thread_t)key)
{
return 0;
}
else if(ti->id > (bc_thread_t)key)
{
return 1;
}
else
{
return -1;
}
}
/*************************************************
Function: bc_platform_thread_init
Description:线程结构初始化
Input:
Output:
Return:
void
Note: 用bc_platform_init替代bc_platform_thread_init进行
初始化
History:
*************************************************/
void bc_platform_thread_init(void)
{
if((bc_platform_thread_mut = bc_platform_mutex_create("ThreadMutex1")) == NULL)
{
BC_PT_ERROR(BC_MODULE_PLATFORM,"<%s>:create mutex 1 fail!\n",__FUNCTION__);
return ;
}
utili_lst_init(&bc_platform_thread_head,__bc_platform_thread_compare);
}
/*************************************************
Function: bc_platform_thread_create
Description:创建一个线程
Input:
name : name of task
stacksize : stack size requested
prio : scheduling prio (1 = lowest,99 = highest)
f:address of function to call
arg:argument passed to func
Output:
Return:
成功:THREAD ID
失败:NULL
Note:
History:
*************************************************/
bc_thread_t *bc_platform_thread_create(
bc_char *name,
bc_int32 stacksize,
bc_int32 prio,
void (*f)(void *),
void *arg
)
{
pthread_attr_t attribs;
struct sched_param priority_holder;
bc_thread_info_t *ti;
bc_thread_node_t *thread_node;
bc_sem_t *sem;
if((name == NULL)||(prio<1)||(prio>99)||(f == NULL))
{
return NULL;
}
if(strlen(name) >= BC_THREAD_MAX_API_NAME)
{
BC_PT_ERROR(BC_MODULE_PLATFORM,"thread name is too long\n");
return NULL;
}
if (pthread_attr_init(&attribs))
{
return NULL;
}
if (stacksize < BC_PTHREAD_STACK_MIN)
{
stacksize = BC_PTHREAD_STACK_MIN;
}
if (stacksize > BC_PTHREAD_STACK_MAX)
{
stacksize = BC_PTHREAD_STACK_MAX;
}
pthread_attr_setstacksize(&attribs, stacksize);
priority_holder.sched_priority = prio;
pthread_attr_setschedparam(&attribs,&priority_holder);
if ((thread_node = bc_platform_mem_malloc(BC_MODULE_PLATFORM,sizeof (*thread_node))) == NULL)
{
return NULL;
}
if ((sem = bc_platform_sem_create("threadBoot", 0)) == NULL)
{
bc_platform_mem_free(BC_MODULE_PLATFORM,thread_node);
return NULL;
}
ti = &thread_node->data;
strcpy(ti->name,name);
ti->id = (bc_thread_t)0;
ti->stacksize = stacksize;
ti->prio = prio;
ti->f = f;
ti->arg = arg;
ti->tid = (bc_pid_t)0;
ti->sem = sem;
if (pthread_create(&(ti->id), &attribs, __bc_platform_thread_boot, (void *)ti))
{
bc_platform_mem_free(BC_MODULE_PLATFORM,thread_node);
bc_platform_sem_destroy(sem);
return NULL;
}
bc_platform_mutex_lock(bc_platform_thread_mut);
utili_lst_add(&bc_platform_thread_head,(utili_node *)thread_node);
BC_PLATFORM_THREAD_RESOURCE_USAGE_INCR(
bc_platform_thread_count_curr,
bc_platform_thread_count_max,
bc_platform_thread_stack_size_curr,
bc_platform_thread_stack_size_max,
stacksize,
ilock);
bc_platform_mutex_unlock(bc_platform_thread_mut);
/*
* Note that at this point ti can no longer be safely
* dereferenced, as the thread we just created may have
* exited already. Instead we wait for the new thread
* to update bc_thread_info_t and tell us to continue.
*/
bc_platform_sem_wait(sem, BC_SEM_WAIT_FOREVER);
bc_platform_sem_destroy(sem);
return (bc_thread_t *)(&ti->id);;
}
/*************************************************
Function: bc_platform_thread_destroy
Description:destroy a task
Input:
thread : thread id
Output:
Return:
成功:BC_ERR_OK 失败:other
Notes:
This routine is not generally used by Broadcom drivers because
it's unsafe. If a task is destroyed while holding a mutex or
other resource, system operation becomes unpredictable. Also,
some RTOS's do not include kill routines.
Instead, Broadcom tasks are written so they can be notified via
semaphore when it is time to exit, at which time they call
bc_platform_thread_exit().
History:
*************************************************/
bc_err_e bc_platform_thread_destroy(bc_thread_t *thread)
{
bc_thread_info_t *ti;
utili_node *node;
bc_platform_mutex_lock(bc_platform_thread_mut);
if (pthread_cancel(*thread))
{
bc_platform_mutex_unlock(bc_platform_thread_mut);
return BC_ERR_PARA;
}
node = utili_lst_remove(&bc_platform_thread_head,*thread);
if(node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
BC_PLATFORM_THREAD_RESOURCE_USAGE_DECR(
bc_platform_thread_count_curr,
bc_platform_thread_stack_size_curr,
ti->stacksize,
ilock);
bc_platform_mem_free(BC_MODULE_PLATFORM,node);
bc_platform_mutex_unlock(bc_platform_thread_mut);
return BC_ERR_OK;
}
bc_platform_mutex_unlock(bc_platform_thread_mut);
return BC_ERR_PARA;
}
/*************************************************
Function: bc_platform_thread_exit
Description:Exit the calling thread
Input:
rc - return code from thread.
Output:
Return:
void
Notes:
History:
*************************************************/
void bc_platform_thread_exit(bc_int32 rc)
{
bc_thread_info_t *ti;
utili_node *node;
bc_thread_t thread = pthread_self();
bc_platform_mutex_lock(bc_platform_thread_mut);
node = utili_lst_remove(&bc_platform_thread_head,thread);
if (node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
BC_PLATFORM_THREAD_RESOURCE_USAGE_DECR(
bc_platform_thread_count_curr,
bc_platform_thread_stack_size_curr,
ti->stacksize,
ilock);
bc_platform_mem_free(BC_MODULE_PLATFORM,node);
bc_platform_mutex_unlock(bc_platform_thread_mut);
return ;
}
bc_platform_mutex_unlock(bc_platform_thread_mut);
pthread_exit(BC_INT_TO_PTR(rc));
}
/*************************************************
Function: bc_platform_thread_id_get
Description:Return thread ID of caller
Input:
Output:
Return:
void
Notes:
History:
*************************************************/
bc_thread_t bc_platform_thread_id_get(void)
{
return (bc_thread_t) pthread_self();
}
/*************************************************
Function: bc_platform_thread_name_get
Description:Return name given to thread when it was created
Input:
thread : thread ID
thread_name : buffer to return thread name;
gets empty string if not available
thread_name_size : maximum size of buffer
Output:
Return:
成功:BC_ERR_OK 失败:other
Notes:
History:
*************************************************/
bc_err_e bc_platform_thread_name_get(
bc_thread_t *thread,
bc_int8 *thread_name,
bc_int32 thread_name_size
)
{
bc_thread_info_t *ti;
utili_node *node;
if (thread_name_size < BC_THREAD_MAX_API_NAME)
{
return BC_ERR_PARA;
}
memset(thread_name, 0, thread_name_size);
node = utili_lst_find(&bc_platform_thread_head,*thread);
if (node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
memcpy(thread_name, ti->name, BC_THREAD_MAX_API_NAME);
return BC_ERR_OK;
}
return BC_ERR_PLATFROM_THREAD_NOT_EXIST;
}
/*************************************************
Function: bc_platform_thread_stack_get
Description:Return stack given to thread when it was created
Input:
thread : thread ID
stacksize : stack size
Output:
Return:
成功:BC_ERR_OK 失败:other
Notes:
History:
*************************************************/
bc_err_e bc_platform_thread_stack_get(bc_thread_t *thread, bc_int32 *stacksize)
{
bc_thread_info_t *ti;
utili_node *node;
node = utili_lst_find(&bc_platform_thread_head,*thread);
if (node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
*stacksize = ti->stacksize;
return BC_ERR_OK;
}
return BC_ERR_PLATFROM_THREAD_NOT_EXIST;
}
/*************************************************
Function: bc_platform_thread_piro_get
Description:Return prio given to thread when it was created
Input:
thread : thread ID
pro : pro
Output:
Return:
成功:BC_ERR_OK 失败:other
Notes:
History:
*************************************************/
bc_err_e bc_platform_thread_piro_get(bc_thread_t *thread, bc_int32 *pro)
{
bc_thread_info_t *ti;
utili_node *node;
node = utili_lst_find(&bc_platform_thread_head,*thread);
if (node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
*pro = ti->prio;
return BC_ERR_OK;
}
return BC_ERR_PLATFROM_THREAD_NOT_EXIST;
}
/*************************************************
Function: bc_platform_thread_tid_get
Description:Return tid given to thread when it was created
Input:
thread : thread ID
tid :
Output:
Return:
成功:BC_ERR_OK 失败:other
Notes:
History:
*************************************************/
bc_err_e bc_platform_thread_tid_get(bc_thread_t *thread, bc_int32 *tid)
{
bc_thread_info_t *ti;
utili_node *node;
node = utili_lst_find(&bc_platform_thread_head,*thread);
if (node != NULL)
{
ti = &((bc_thread_node_t *)node)->data;
*tid = ti->tid;
return BC_ERR_OK;
}
return BC_ERR_PLATFROM_THREAD_NOT_EXIST;
}
/*************************************************
Function: bc_platform_thread_show
Description:dump所有 线程信息
Input:
Output:
Return:
void
Notes:
History:
*************************************************/
void bc_platform_thread_show(void)
{
bc_uint32 i = 1;
utili_node *predecessor,*next;
bc_thread_info_t *ti;
BC_PT_COMMAND(BC_MODULE_PLATFORM,"\r\n=================================================================");
BC_PT_COMMAND(BC_MODULE_PLATFORM,"\r\n%-4s %-30s %-11s %-12s %-8s","Id", "Name", "Thread ID", "StackSize", "Pri");
BC_PT_COMMAND(BC_MODULE_PLATFORM,"\r\n-----------------------------------------------------------------");
predecessor = utili_lst_first(&bc_platform_thread_head);
while(predecessor != NULL)
{
ti = &((bc_thread_node_t *)predecessor)->data;
BC_PT_COMMAND(BC_MODULE_PLATFORM,"\r\n%-4d %-30s %-9d 0x%-10x %-6d",i,ti->name,ti->tid,ti->stacksize,ti->prio);
next = utili_lst_next((utili_node *)predecessor);
predecessor = next;
i++;
}
#if BC_PLATFORM_THREAD_DEBUG
BC_PT_COMMAND(BC_MODULE_PLATFORM,"\r\nthread info total[COUNT:%d,MAX:%d,USED STACK:%0.1lfMB,MAX STACK:%0.1lfMB]\n",bc_platform_thread_count_curr,bc_platform_thread_count_max,((float)bc_platform_thread_stack_size_curr)/1024/1024,((float)bc_platform_thread_stack_size_max)/1024/1024);
#endif
}
/*************************************************
Function: bc_platform_time_sleep
Description:Suspend calling thread for a specified number of seconds
Input:
sec:number of seconds to suspend
Output:
Return:
void
Notes:Other tasks are free to run while the caller is suspended.
History:
*************************************************/
void bc_platform_time_sleep(bc_uint32 sec)
{
struct timeval tv;
tv.tv_sec = (time_t) sec;
tv.tv_usec = 0;
select(0, (fd_set *) 0, (fd_set *) 0, (fd_set *) 0, &tv);
}
/*************************************************
Function: bc_platform_time_usleep
Description:Suspend calling thread for a specified number of microseconds.
Input:
usec:number of microseconds to suspend
Output:
Return:
void
Notes: The actual delay period depends on the resolution of the
Unix select routine, whose precision is limited to the
the period of the scheduler tick, generally 1/60 or 1/100 sec.
Other tasks are free to run while the caller is suspended.
History:
*************************************************/
void bc_platform_time_usleep(bc_uint32 usec)
{
struct timeval tv;
tv.tv_sec = (time_t) (usec / SECOND_USEC);
tv.tv_usec = (long) (usec % SECOND_USEC);
select(0, (fd_set *) 0, (fd_set *) 0, (fd_set *) 0, &tv);
}
|
4a29996a1306cd6315843eb350d10f6ef691d3b3
|
70d4aa0e3e68908a5652faab3394c18c09fc3848
|
/serveur/equipe.c
|
3602e25a54c56c1a423f7ec22c4c7d02b1b38247
|
[] |
no_license
|
MrAntotoal/Projet_n1
|
4ddd775b19012927c90d4c8ad74532b2e782676b
|
12524fc7cac90e78fcc4b53cf630e559fdfedc43
|
refs/heads/master
| 2022-01-09T20:20:54.415167 | 2019-05-06T12:28:55 | 2019-05-06T12:28:55 | 169,314,263 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,249 |
c
|
equipe.c
|
#include "equipe.h"
void init_equipe(){
index_equipe = 0;
}
void creer_equipe(Client * c){
Equipe e;
e.nb_joueur = 1;
e.numj = 1;
GL_equipe[index_equipe] = e;
c->numEquipe = index_equipe;
GL_equipe[index_equipe].membre[0] = c;
index_equipe++;
ajouterChamps(*c);
}
/* avec num le numéro de l'équipe dans le tableau global */
void rejoindre_equipe(Client * c, int num){
GL_equipe[num].nb_joueur++;
GL_equipe[num].membre[GL_equipe[num].numj] = c;
GL_equipe[num].numj++;
c->numEquipe = num;
ajouterChamps(*c);
}
void quitter_equipe(Client *c){
int place = 0;
for (int i = 0; i < GL_equipe[c->numEquipe].nb_joueur; i++) {
if(GL_equipe[c->numEquipe].membre[i]->pseudo == c->pseudo) break;
place++;
}
for (int i = place; i < GL_equipe[c->numEquipe].nb_joueur; i++) {
GL_equipe[c->numEquipe].membre[i] = GL_equipe[c->numEquipe].membre[i + 1];
}
place = c->numEquipe;
GL_equipe[c->numEquipe].nb_joueur--;
GL_equipe[c->numEquipe].numj--;
c->numEquipe = -1;
if(GL_equipe[place].nb_joueur == 0)
{
supprimer_equipe(place);
index_equipe--;
}
int tmp = 0;
while (list[tmp].pseudo != c->pseudo) {
tmp++;
}
memmove(list + tmp, list + tmp + 1,(nb - tmp - 1) * sizeof(Client));
nb--;
refresh_html();
}
void supprimer_equipe(int place){
int tmp = 0;
for (int i = place; i <= index_equipe; i++) {
GL_equipe[i] = GL_equipe[i+1];
for (int j = 0; j < GL_equipe[i].nb_joueur; j++) {
GL_equipe[i].membre[j]->numEquipe--;
while (list[tmp].pseudo != GL_equipe[i].membre[j]->pseudo) {
tmp++;
}
list[tmp].numEquipe--;
tmp = 0;
}
}
refresh_html();
}
int position_equipe(Client c){
for (int i = 0; i < GL_equipe[c.numEquipe].nb_joueur; i++) {
if(c.pseudo == GL_equipe[c.numEquipe].membre[i]->pseudo)
return i;
}
return -1;
}
void affiche_equipe(int n){
#ifdef AFFICHAGE
char *t = get_lexeme(GL_equipe[n].membre[0]->pseudo);
fprintf(stderr,"Chef d'équipe : %s\n",t);
for (int i = 0; i < GL_equipe[n].nb_joueur; i++) {
printf("%d : %s\n",i,get_lexeme(GL_equipe[n].membre[i]->pseudo));
}
#endif
}
void affiche_tt_e(){
for (int i = 0; i < index_equipe; i++) {
affiche_equipe(i);
}
}
|
abc7082bdbdd82834846cea505dfd85e89870b7d
|
4f2ed07772996a26e03d8106ecab3def97889623
|
/Progra Avanzada/Assignment5/count.c
|
3e60fc0b4474be7502b8c0a561d238d1b16a02cf
|
[] |
no_license
|
lujeolhe/Clases-de-C
|
df17e15a70bb8b0d1168150b7aa42aa580e71f4d
|
0652f37d1ba0e2f90606f9bce50d46caa5686ede
|
refs/heads/master
| 2023-01-07T19:37:57.467059 | 2020-11-12T06:22:25 | 2020-11-12T06:22:25 | 300,016,823 | 0 | 0 | null | 2020-09-30T18:31:15 | 2020-09-30T18:31:14 | null |
UTF-8
|
C
| false | false | 545 |
c
|
count.c
|
/////////Librerias////////////////
#include <stdio.h>
/////////Funciones////////////////
int count(unsigned long num);
////////////MAIN/////////////
int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
unsigned long num=(unsigned long )n;
printf("%d", count(num));
return 0;
}
/////////Funciones////////////////
int count(unsigned long num){
unsigned long masc = 0x80000000;
int cuenta = 0;
int length=32;
for(int i = 0; i < length; i++){
if((masc >> i)& num){
cuenta++;
}
}
return cuenta;
}
|
e1d4c51646c256d7584983f799e868f6de49d51a
|
fb85ff1e7dfe756ca9ebf06d1fc1d51437788cb5
|
/basic declarations/28.c
|
96e28f2d9bc14b7b35038e502626fdd0e67f0da2
|
[] |
no_license
|
Rahjael/C_exercises
|
7b3f9e2f9d5e9f5570419019dfa0171685d67053
|
ae189dcea1720c69c9c9a14144ae5bb6842bbea9
|
refs/heads/master
| 2020-04-18T02:30:04.613740 | 2019-07-22T13:06:43 | 2019-07-22T13:06:43 | 167,165,198 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 700 |
c
|
28.c
|
#include <stdio.h>
#define NUM 5
/*
Write a C program that read 5 numbers and
counts the number of positive numbers and print
the average of all positive values.
*/
int main() {
int array[NUM], sum = 0, counter = 0;
// user input NUM numbers
for (int i=0; i<NUM; i++){
printf("Insert a positive or negative number:\n");
scanf("%d", &array[i]);
}
for (int i=0; i<NUM; i++){
printf("array %d is %d\n", i, array[i]);
}
// counter numeri positivi
for (int i=0; i<NUM; i++){
counter = (array[i] > 0 ? counter + 1 : counter);
sum = (array[i] > 0 ? sum + array[i] : sum);
printf("sum = %d, counter = %d\n", sum, counter);
}
// EXERCISE NOT FINISHED
return 0;
}
|
7c6166e04e64a7c5152d909773dbf6e50d9b265c
|
835ea5440df4b89602628ada6a9e00979ea6e703
|
/src/solve2.c
|
22ad8d23675f3f6b4d72f0b5f4b135d1e45c5269
|
[] |
no_license
|
Awajsbro/Lem_in
|
91c7fc184ddbdd249f5c0014ee6226931e5ce0f5
|
51043b289c50abec8f3217330cbd99be2d329603
|
refs/heads/master
| 2020-03-18T06:31:03.545369 | 2018-10-19T08:56:25 | 2018-10-19T08:56:25 | 134,400,533 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,427 |
c
|
solve2.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* solve2.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: awajsbro <awajsbro@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/10/14 19:03:08 by awajsbro #+# #+# */
/* Updated: 2018/10/14 19:05:22 by awajsbro ### ########.fr */
/* */
/* ************************************************************************** */
#include "../lem_in.h"
char move_ant(t_li *li, int lem)
{
int i;
i = -1;
if (lem > 0 && (li->way[lem - 1] == NULL || *(li->way[lem - 1]) != 1))
{
while (++i < lem)
if (li->way[i] != NULL && li->way[i][0] != 1)
{
++(li->way[i]);
ft_printf("L%d-%s", i + 1, li->room[*(li->way[i])]->name);
if (i + 1 < li->lem && li->way[i + 1] != NULL)
ft_putchar(' ');
}
ft_putchar('\n');
return (1);
}
i = -1;
while (++i < lem)
if (li->way[i][0] != 1 && move_ant(li, lem - 1))
return (1);
return (0);
}
|
e7e05005de543b7eaad4da08891fa94025e8bf6c
|
6add452d4554da28b9c792aa86c6c1fba5aee525
|
/test/main.c
|
9b7498757a5820ee092307fc762b44890aa77e05
|
[
"MIT"
] |
permissive
|
maekawatoshiki/qcc
|
c96ddca45955d020c27e1e08b3cd90887e40b770
|
c73fe2174c1d3ba748fe2021cd45cd967e7842a0
|
refs/heads/master
| 2021-01-20T20:09:19.333984 | 2017-02-21T07:48:11 | 2017-02-21T07:48:11 | 70,221,316 | 51 | 8 | null | 2017-03-07T23:50:08 | 2016-10-07T06:31:08 |
C++
|
UTF-8
|
C
| false | false | 225 |
c
|
main.c
|
#include <stdio.h>
int test();
int main() {
int ret_code = test();
if(ret_code == 0)
printf(TEST_NAME " ... \x1b[32mOK\x1b[39m\n");
else
printf(TEST_NAME " ... \x1b[31mFAILED\x1b[39m\n");
return ret_code;
}
|
51c7df3f206dd2d3b0d335b2c4bc4733635d29d8
|
1b4c74231af4e21024ef841fc9d4d10d691716b5
|
/PP_src/PhotoPlayer/src/getimage.h
|
1b9cb3c4a67e801df568c998fae66bb8a4594304
|
[
"IJG"
] |
permissive
|
agunta/photoplayer
|
8e800d97c76bd25c2bad05284b9a54ae51aad467
|
0251cfbec5c60d9829f862c5e8b999f450ee5c94
|
refs/heads/master
| 2016-08-05T04:10:34.940247 | 2013-08-16T05:53:57 | 2013-08-16T05:53:57 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 51 |
h
|
getimage.h
|
#pragma once
int __cdecl getim (char* inputFile);
|
ee68648e87ddacd85a32b8fa1ccde33df9f8e0ab
|
4c7a1051c49159a521271019f5dfab0e793dcf60
|
/my_webGet/createDataFiles.c
|
ed5324837c0feb3b35fcb161a96091a6b2b6b689
|
[] |
no_license
|
wrbeasl/424-Homework2
|
dd7fbd8fee88eb97d31345ea5cd8018936b56a3e
|
e1f8974599b8b60e03111af0a610e2401b657ccc
|
refs/heads/master
| 2021-01-19T11:02:57.023938 | 2015-02-21T14:36:01 | 2015-02-21T14:36:01 | 30,871,511 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 937 |
c
|
createDataFiles.c
|
/* CpSc 852 Hw 3 Q 3: Master program module */
#include <stdio.h>
#include <stdlib.h>
/* GLOBALS */
char binaryFileNameBuffer[32];
/*-------------------------------------------------------*/
/* PROGRAM */
/*-------------------------------------------------------*/
int main(int argc, char** argv) {
int dataSize=0;
int fileID=0;
int i=0;
int rc = 0; //0 no error, -1 on error
FILE *binaryFile;
char *bFile = binaryFileNameBuffer;
/* Make sure the poor user has a clue. */
if (argc <3 )
{
printf("usage: ./createDataFiles size fileID\n");
rc = 1;
}
if (rc == 0) {
dataSize = atoi(argv[1]);
fileID = atoi(argv[2]);
sprintf(bFile,"DataFile%d.dat",fileID);
binaryFile = fopen(bFile, "w+");
unsigned char myByte = 0x00;
for (i=0;i<dataSize;i++) {
fwrite(&myByte,sizeof(unsigned char),1,binaryFile);
}
fclose(binaryFile);
}
exit(rc);
}
|
0877888c1d831936d204438433f6be6dbef97793
|
16d1709d5b20bd8b09bde487a7aca2714767eec8
|
/Work/mnt/home/apps/openCl/nachiket/lib/lib2/newtest.c
|
848fb25b91b82ef33f6f67974ebe55b47e3fa4e6
|
[] |
no_license
|
Harshit661000143/Work
|
f3dfacbed30168b80fa1da210964a824226e9ba9
|
571a984bd738ff69629216fd2fcd765b408ec582
|
refs/heads/master
| 2020-12-24T14:10:00.696055 | 2015-05-14T07:49:07 | 2015-05-14T07:49:07 | 30,471,876 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,758 |
c
|
newtest.c
|
#include<stdio.h>
#include"sample.h"
main(int argc,char** argv)
{
int i;
n=atoi(argv[1]);
alpha=atoi(argv[2]);
incx=atoi(argv[3]);
incy=atoi(argv[4]);
float *A = (float*)malloc(sizeof(float)*n);
float *B = (float*)malloc(sizeof(float)*n);
cl_platform_id platform_id = NULL;
cl_device_id device_id = NULL;
cl_uint ret_num_devices;
cl_uint ret_num_platforms;
cl_int ret = clGetPlatformIDs(1, &platform_id, &ret_num_platforms);
if(ret!=CL_SUCCESS)
{
printf("platform id error");
}
ret = clGetDeviceIDs( platform_id, CL_DEVICE_TYPE_GPU, 1, &device_id, &ret_num_devices);
if(ret!=CL_SUCCESS)
{
printf("device id error");
}
// Create an OpenCL context
cl_context context = clCreateContext( NULL, 1, &device_id, NULL, NULL, &ret);
if(ret!=CL_SUCCESS)
{
printf("context error");}
// Create a command queue
cl_command_queue command_queue = clCreateCommandQueue( context,device_id,0, &ret );
if(ret!=CL_SUCCESS)
{
printf("queue error");}
// Create memory buffers on the device for each vector
cl_mem a_mem_obj = clCreateBuffer(context, CL_MEM_READ_WRITE,n * sizeof(float), NULL, &ret);
if(ret!=CL_SUCCESS)
{
printf("a_mem error");}
cl_mem b_mem_obj = clCreateBuffer(context, CL_MEM_READ_ONLY, n * sizeof(float), NULL, &ret);
if(ret!=CL_SUCCESS)
{
printf("b mem error");}
for(i=0;i<n;i++)
{
A[i]=1.0;
B[i]=1.0;
}
// Copy the lists A and B to their respective memory buffers
ret = clEnqueueWriteBuffer(command_queue, a_mem_obj, CL_TRUE, 0,n * sizeof(float), A, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, b_mem_obj, CL_TRUE, 0,n * sizeof(float), B, 0, NULL, NULL);
A=saxpy(n,alpha,A,incx,B,incy,device_id,context,command_queue,a_mem_obj,b_mem_obj);
for(i=0;i<n;i++)
{
printf("%f\t",A[i]);}
return 0;
}
|
d38b4012284e73d4e434e34d61a175c7b00a4a9c
|
ca7a46043938f98db792f34949ef47068f829c15
|
/rtthread-port/jerry_callbacks.h
|
9cb30155e04ca8ccfa240bdf43fd0fbb164529ad
|
[
"Apache-2.0"
] |
permissive
|
RT-Thread-packages/jerryscript
|
f60e695029bd4f8af4ce275940225e307907d1de
|
cf11f944fed46779f39e22e4e073caadd56f2691
|
refs/heads/master
| 2021-12-01T01:49:41.428566 | 2021-11-18T03:50:35 | 2021-11-18T03:50:35 | 108,094,897 | 18 | 21 |
Apache-2.0
| 2021-11-18T03:50:36 | 2017-10-24T07:54:34 |
C
|
UTF-8
|
C
| false | false | 880 |
h
|
jerry_callbacks.h
|
#ifndef JERRY_CALLBACKS_H__
#define JERRY_CALLBACKS_H__
#include <rtthread.h>
#include <jerry_util.h>
#ifdef __cplusplus
extern "C" {
#endif
typedef void(*js_callback_func)(const void *args, uint32_t size);
typedef rt_bool_t(*js_mq_func)(void *args);
struct js_callback
{
js_callback_func function;
struct js_callback *next;
};
struct js_mq_callback
{
struct js_callback *callback;
void *args;
uint32_t size;
};
struct js_callback *js_add_callback(js_callback_func callback);
void js_remove_callback(struct js_callback *callback);
void js_remove_all_callbacks(void);
void js_call_callback(struct js_callback *callback, const void *data, uint32_t size);
rt_bool_t js_send_callback(struct js_callback *callback, const void *args, uint32_t size);
void js_mq_func_init(js_mq_func signal);
void js_mq_func_deinit(void);
#ifdef __cplusplus
}
#endif
#endif
|
d2a641cd0028d9056d91f3d6ac7f62cd19c88924
|
637c4892287929583bdadd8630d5353dd78dc82c
|
/vendor/otf2/test/OTF2_AnchorFile_test/OTF2_AnchorFile_test.c
|
3caeaf841c4f9278925d4e89cd60a6dda23bad4f
|
[
"LicenseRef-scancode-unknown-license-reference",
"BSD-3-Clause"
] |
permissive
|
readex-eu/readex-scorep
|
6819f074bba6b4fe9d6de07cf7037d2829cbbccf
|
38d7b84145f229b44670656d59f84faa51007ced
|
refs/heads/master
| 2020-03-27T01:04:12.730561 | 2018-08-22T14:42:37 | 2018-08-22T14:42:37 | 145,679,275 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 20,748 |
c
|
OTF2_AnchorFile_test.c
|
/*
* This file is part of the Score-P software (http://www.score-p.org)
*
* Copyright (c) 2009-2012,
* RWTH Aachen University, Germany
*
* Copyright (c) 2009-2012,
* Gesellschaft fuer numerische Simulation mbH Braunschweig, Germany
*
* Copyright (c) 2009-2013,
* Technische Universitaet Dresden, Germany
*
* Copyright (c) 2009-2012,
* University of Oregon, Eugene, USA
*
* Copyright (c) 2009-2012,
* Forschungszentrum Juelich GmbH, Germany
*
* Copyright (c) 2009-2012,
* German Research School for Simulation Sciences GmbH, Juelich/Aachen, Germany
*
* Copyright (c) 2009-2012,
* Technische Universitaet Muenchen, Germany
*
* This software may be modified and distributed under the terms of
* a BSD-style license. See the COPYING file in the package base
* directory for details.
*
*/
/** @internal
*
* @file
*
* @brief Sets defined information in the archive and writes an anchor
* file. Then reads the anchor file back in and compares the read
* information with the defined information.
*/
#include <config.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdarg.h>
#include <ctype.h>
#include <otf2/otf2.h>
#if HAVE( PTHREAD )
#include <otf2/OTF2_Pthread_Locks.h>
#endif
#include <UTILS_Error.h>
#include <UTILS_Debug.h>
#include <UTILS_IO.h>
#include <UTILS_CStr.h>
#include <otf2_internal.h>
#include <otf2_file_types.h>
#include <otf2_reader.h>
#include <otf2_archive.h>
#include <otf2-test/check.h>
#define OTF2_TEST_CHUNK_POOL_CHUNK_SIZE ( 256 * 1024 )
#define OTF2_TEST_CHUNK_POOL_NUMBER_OF_CHUNKS 4
#include <otf2-test/chunk-pool.h>
#include <otf2-test/gettime.h>
#define OTF2_TEST_FLUSH_DEFAULT OTF2_FLUSH
#define OTF2_TEST_FLUSH_GETTIME otf2_test_gettime
#include <otf2-test/flush.h>
/* ___ main _________________________________________________________________ */
int
main( void )
{
char archive_path[] = "OTF2_AnchorFile_trace/trace";
char archive_name[] = "archive.otf2";
/* Information stored in the trace. */
uint64_t chunk_size_events = 1024 * 1024;
uint64_t chunk_size_defs = 4 * 1024 * 1024;
OTF2_FileSubstrate substrate = OTF2_SUBSTRATE_POSIX;
OTF2_Compression compression = OTF2_COMPRESSION_NONE;
uint64_t num_locations = 123;
uint64_t num_definitions = 456;
char* machine_name = "TestMachine";
char* creator = "TestCreator";
char* description = "TestDescription";
/* We will write only two properties. The third one will be deleted,
* that means it won't be written to anchor file. */
const char* const invalid_property_names[] =
{
"", // empty
"foo", // no "::" at all
"::foo", // empty first component 1
"::foo::bar", // empty first component 2
"foo::::", // empty middle component 1
"::::foo", // empty middle component 2
"foo::", // empty last component 1
"foo::bar::", // empty last component 2
"foo::ba ::baz", // invalid character 1
"foo::bar::ba ", // invalid character 2
NULL
};
char* string_property_names[] = { "NamespaceA::Property1", "NamespaceA::Property2", "NamespaceA::Property3" };
char* string_property_values[] = { "Valid", "OK", "true" };
char* bool_property_names[] = { "NamespaceB::BoolProperty1", "NamespaceB::BoolProperty2" };
bool bool_property_values[] = { true, false };
uint32_t number_of_string_properties = sizeof( string_property_names ) / sizeof( *string_property_names );
uint32_t number_of_bool_properties = sizeof( bool_property_names ) / sizeof( *bool_property_names );
uint32_t number_of_properties = number_of_string_properties + number_of_bool_properties;
char* property_name_to_delete = "Whatever::Property";
char* arbitrary_property_value = "Whatever::Value";
char* value_to_delete_property = "";
/* Print out info. */
if ( otf2_DEBUG )
{
printf( "\n=== OTF2_ANCHORFILE_TEST [DEBUG MODE] ===\n\n" );
}
else
{
printf( "\n=== OTF2_ANCHORFILE_TEST ===\n\n" );
}
char* extension_dot = strrchr( archive_name, '.' );
/* cut the extension from the archive_name when writing */
*extension_dot = '\0';
/* Create new archive handle. */
OTF2_Archive* archive = OTF2_Archive_Open( archive_path,
archive_name,
OTF2_FILEMODE_WRITE,
chunk_size_events,
chunk_size_defs,
substrate,
compression );
check_pointer( archive, "Open new archive." );
OTF2_ErrorCode status = OTF2_Archive_SetFlushCallbacks( archive, &otf2_test_flush_callbacks, NULL );
check_status( status, "Set flush callbacks." );
#if HAVE( PTHREAD )
pthread_mutexattr_t mutex_attr_archive;
pthread_mutexattr_init( &mutex_attr_archive );
#if HAVE( PTHREAD_MUTEX_ERRORCHECK )
pthread_mutexattr_settype( &mutex_attr_archive, PTHREAD_MUTEX_ERRORCHECK );
#endif
status = OTF2_Pthread_Archive_SetLockingCallbacks( archive, &mutex_attr_archive );
check_status( status, "Set Pthread locking callbacks." );
#endif
/* Set number of locations. */
status = otf2_archive_set_number_of_locations( archive, num_locations );
check_status( status, "Set number of locations." );
/* Set number of global definitions. */
status = otf2_archive_set_number_of_global_defs( archive, num_definitions );
check_status( status, "Set number of definitions." );
/* Set machine name, creator and description (optional) */
status = OTF2_Archive_SetMachineName( archive, machine_name );
check_status( status, "Set machine name." );
status = OTF2_Archive_SetCreator( archive, creator );
check_status( status, "Set creator." );
status = OTF2_Archive_SetDescription( archive, description );
check_status( status, "Set description." );
status = OTF2_Archive_SetSerialCollectiveCallbacks( archive );
check_status( status, "Set serial mode." );
/* Check for some invalid property names */
for ( const char* const* invalid_property_name_it = invalid_property_names;
*invalid_property_name_it;
invalid_property_name_it++ )
{
status = OTF2_Archive_SetProperty( archive,
*invalid_property_name_it,
"value",
true );
if ( status == OTF2_SUCCESS )
{
status = OTF2_ERROR_PROPERTY_NAME_INVALID;
}
else if ( status == OTF2_ERROR_PROPERTY_NAME_INVALID )
{
status = OTF2_SUCCESS;
}
check_status( status, "Test invalid property names failed for %s.", *invalid_property_name_it );
}
/* Write some additional meta-information to anchor file. */
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
value_to_delete_property,
false );
check_status( status, "Set empty string as value of a non-existing property should have no effect." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
arbitrary_property_value,
false );
check_status( status, "Write arbitrary property that will be deleted later on." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
value_to_delete_property,
true );
check_status( status, "Delete property at the front of the list." );
status = OTF2_Archive_SetProperty( archive,
string_property_names[ 0 ],
arbitrary_property_value,
false );
check_status( status, "Write first property." );
status = OTF2_Archive_SetProperty( archive,
string_property_names[ 1 ],
string_property_values[ 1 ],
false );
check_status( status, "Write second property." );
status = OTF2_Archive_SetProperty( archive,
string_property_names[ 0 ],
string_property_values[ 0 ],
true );
check_status( status, "Re-write first property." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
arbitrary_property_value,
false );
check_status( status, "Write arbitrary property that will be deleted later on." );
status = OTF2_Archive_SetProperty( archive,
string_property_names[ 2 ],
string_property_values[ 2 ],
false );
check_status( status, "Write third property." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
value_to_delete_property,
true );
check_status( status, "Delete property somewhere in the middle of the list." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
arbitrary_property_value,
false );
check_status( status, "Write arbitrary property that will be deleted later on." );
status = OTF2_Archive_SetProperty( archive,
property_name_to_delete,
value_to_delete_property,
true );
check_status( status, "Delete property at the end of the list." );
status = OTF2_Archive_SetBoolProperty( archive,
bool_property_names[ 0 ],
bool_property_values[ 0 ],
false );
check_status( status, "Write fourth property (first one of type boolean)." );
status = OTF2_Archive_SetBoolProperty( archive,
bool_property_names[ 1 ],
bool_property_values[ 1 ],
false );
check_status( status, "Write fifth property (second one of type boolean)." );
/* Close archive. */
status = OTF2_Archive_Close( archive );
check_status( status, "Close archive." );
/* Open new archive. */
/* add the extension back to the archive_name when reading */
*extension_dot = '.';
char* full_path = UTILS_IO_JoinPath( 2, archive_path, archive_name );
check_pointer( full_path, "Could not create full path to anchor file." );
OTF2_Reader* reader = OTF2_Reader_Open( full_path );
check_pointer( reader, "Open new reader for reading." );
status = OTF2_Reader_SetSerialCollectiveCallbacks( reader );
check_status( status, "Set serial mode." );
#if HAVE( PTHREAD )
pthread_mutexattr_t mutex_attr_reader;
pthread_mutexattr_init( &mutex_attr_reader );
#if HAVE( PTHREAD_MUTEX_ERRORCHECK )
pthread_mutexattr_settype( &mutex_attr_reader, PTHREAD_MUTEX_ERRORCHECK );
#endif
status = OTF2_Pthread_Reader_SetLockingCallbacks( reader, &mutex_attr_reader );
check_status( status, "Set Pthread locking callbacks." );
#endif
free( full_path );
/* Information read from the trace. */
uint8_t version_read[ 3 ];
uint64_t num_locations_read;
uint64_t num_definitions_read;
uint64_t chunk_size_events_read;
uint64_t chunk_size_defs_read;
OTF2_FileSubstrate substrate_read;
OTF2_Compression compression_read;
char* machine_name_read;
char* creator_read;
char* description_read;
char** property_names_read;
char* string_property_value_read;
bool bool_property_value_read;
uint32_t number_of_properties_read;
/* Get version. */
status = OTF2_Reader_GetVersion( reader,
&version_read[ 0 ],
&version_read[ 1 ],
&version_read[ 2 ] );
check_status( status, "Get version." );
check_condition( OTF2_VERSION_MAJOR == version_read[ 0 ],
"Major version does not match: "
"Expected %u. Got %u.",
OTF2_VERSION_MAJOR, version_read[ 0 ] );
check_condition( OTF2_VERSION_MINOR == version_read[ 1 ],
"Minor version does not match: "
"Expected %u. Got %u.",
OTF2_VERSION_MINOR, version_read[ 1 ] );
check_condition( OTF2_VERSION_BUGFIX == version_read[ 2 ],
"Bugfix version does not match: "
"Expected %u. Got %u.",
OTF2_VERSION_BUGFIX, version_read[ 2 ] );
/* Get number of locations. */
status = OTF2_Reader_GetNumberOfLocations( reader,
&num_locations_read );
check_status( status, "Get number of locations." );
check_condition( num_locations == num_locations_read,
"Number of locations does not match: "
"Expected %" PRIu64 ". Got %" PRIu64 ".",
num_locations, num_locations_read );
/* Get number of definitions. */
status = OTF2_Reader_GetNumberOfGlobalDefinitions( reader,
&num_definitions_read );
check_status( status, "Get number of definitions." );
check_condition( num_definitions == num_definitions_read,
"Number of definitions does not match: "
"Expected %" PRIu64 ". Got %" PRIu64 ".",
num_definitions, num_definitions_read );
/* Get chunk sizes. */
status = OTF2_Reader_GetChunkSize( reader,
&chunk_size_events_read,
&chunk_size_defs_read );
check_status( status, "Get chuck sizes." );
check_condition( chunk_size_events == chunk_size_events_read,
"Event chunk size does not match: "
"Expected %" PRIu64 ". Got %" PRIu64 ".",
chunk_size_events, chunk_size_events_read );
check_condition( chunk_size_defs == chunk_size_defs_read,
"Definition chunk size does not match: "
"Expected %" PRIu64 ". Got %" PRIu64 ".",
chunk_size_defs, chunk_size_defs_read );
/* Get substrate. */
status = OTF2_Reader_GetFileSubstrate( reader,
&substrate_read );
check_status( status, "Get file substrate." );
check_condition( substrate == substrate_read,
"File subtrate does not match: Expected %u. Got %u.",
substrate, substrate_read );
/* Get compression. */
status = OTF2_Reader_GetCompression( reader,
&compression_read );
check_status( status, "Get compression." );
check_condition( compression == compression_read,
"Compression does not match: Expected %u. Got %u.",
compression, compression_read );
/* Get machine name */
status = OTF2_Reader_GetMachineName( reader, &machine_name_read );
check_status( status, "Get machine name." );
check_condition( 0 == strcmp( machine_name, machine_name_read ),
"Machine name does not match: Expected %s. Got %s.",
machine_name, machine_name_read );
free( machine_name_read );
status = OTF2_Reader_GetCreator( reader, &creator_read );
check_status( status, "Get creator." );
check_condition( 0 == strcmp( creator, creator_read ),
"Creator does not match: Expected %s. Got %s.",
creator, creator_read );
free( creator_read );
status = OTF2_Reader_GetDescription( reader, &description_read );
check_status( status, "Get description." );
check_condition( 0 == strcmp( description, description_read ),
"Description does not match: Expected %s. Got %s.",
description, description_read );
free( description_read );
/* Get additional meta-information (a.k.a. properties) */
status = OTF2_Reader_GetPropertyNames( reader, &number_of_properties_read, &property_names_read );
check_status( status, "Get number of properties." );
/* Check number of properties */
check_condition( number_of_properties == number_of_properties_read,
"Number of properties does not match: Expected %u. Got %u.",
number_of_properties, number_of_properties_read );
char* converted_name;
for ( uint32_t i = 0; i < number_of_properties_read; i++ )
{
/*
* First, this test writes #number_of_string_properties properties of type
* string to the anchor file. Afterwards, #number_of_bool_properties are
* written to the anchor file.
*/
/* Property names are store in upper case. If everything works correctly,
* OTF2_Reader_GetProperty will return our property names converted from
* mixed case to upper case. Therefore, we also have to convert property
* names to upper case. */
if ( i < number_of_string_properties )
{
converted_name = UTILS_CStr_dup( string_property_names[ i ] );
}
else
{
converted_name = UTILS_CStr_dup( bool_property_names[ i - number_of_string_properties ] );
}
for ( char* ptr = converted_name; *ptr; ptr++ )
{
*ptr = toupper( *ptr );
}
/* Check name of property */
check_condition( 0 == strcmp( converted_name, property_names_read[ i ] ),
"Property name does not match: Expected %s. Got %s.",
converted_name, property_names_read[ i ] );
free( converted_name );
if ( i < number_of_string_properties )
{
/* Check property value (value is of type string) */
status = OTF2_Reader_GetProperty( reader, property_names_read[ i ], &string_property_value_read );
check_status( status, "Get property value." );
check_condition( 0 == strcmp( string_property_values[ i ], string_property_value_read ),
"Property value does not match: Expected %s. Got %s.",
string_property_values[ i ], string_property_value_read );
free( string_property_value_read );
}
else
{
/* Check property value (value is of type boolean) */
status = OTF2_Reader_GetBoolProperty( reader,
property_names_read[ i ],
&bool_property_value_read );
check_status( status, "Get boolean property value." );
check_condition( bool_property_values[ i - number_of_string_properties ] == bool_property_value_read,
"Property value does not match: Expected %s. Got %s.",
( bool_property_values[ i - number_of_string_properties ] ) ? "true" : "false",
( bool_property_value_read ) ? "true" : "false" );
}
}
free( property_names_read );
/* Close reader. */
status = OTF2_Reader_Close( reader );
check_status( status, "Close reader." );
return EXIT_SUCCESS;
}
|
a141b2502472afd46ff2334caa6a19411141e443
|
6cb80969469b15108d46debcfe81d837c647aabe
|
/compilateur/tests/test_while.c
|
ae3c38667cc9b0352fb315996a703769043a48a0
|
[] |
no_license
|
Remy64/project_sys_info
|
91f13a8c460934f73934216a00cd2c34a46b4ad6
|
068dd9ed4a9c2731a59c44d13cb887698adfb9b0
|
refs/heads/master
| 2021-03-29T21:17:35.217150 | 2020-05-26T21:54:51 | 2020-05-26T21:54:51 | 247,985,595 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 86 |
c
|
test_while.c
|
void main() {
int i=0;
while(i<10) {
printf(i);
i = i + 1 * 2;
}
return i;
}
|
dee309634039b44cbf7d34798d44e75cc43d9697
|
ac2f89206bc00aa45e3965dfcc7e8b35154eabab
|
/写入读取文件.c
|
efb7d43a036a109cd9a37b2601d479bfcc97d881
|
[] |
no_license
|
AZrookie/cProject
|
0210a2a05448d1875faa0f3d8a71b78a7ca00594
|
dd4b5614f0aba39156cfe000f6b545f877f64fe8
|
refs/heads/master
| 2022-07-28T05:51:22.429095 | 2020-05-20T09:23:22 | 2020-05-20T09:23:22 | 265,506,289 | 0 | 0 | null | null | null | null |
WINDOWS-1252
|
C
| false | false | 693 |
c
|
写入读取文件.c
|
#include <stdio.h>
#include <stdlib.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char *argv[]) {
FILE *fp;
fp=fopen("D:\ceshi.txt","w");
int number=2019051058;
char name[9]={"ÐìÔóãü"};
char gender[3]={"ÄÐ"};
fprintf(fp,"%d\n%s\n%s\n",number,name,gender);
fclose(fp);
FILE *fp1;
fp1=fopen("D:\ceshi.txt","r");
int i,j;
fscanf(fp1,"%d",&j);
printf("%d",j);
int j1,i2,j2;
char name1[9];
for (i2=0;i2<9;i2++){
fscanf(fp1,"%c",&name1[i2]);
printf("%c",name1[i2]);
}
char gender1[]={};
for (j2=0;j2<3;j2++){
fscanf(fp1,"%c",&gender1[j2]);
printf("%c",gender1[j2]);
}
return 0;
}
|
c10f3a1fe734e9bf6f59c782e8f88545b4aa1799
|
72d5eb28cbb106bc092f908971314c4bb5b8cec4
|
/OS-Fall-2015-master/bbb-xinu/system/future_queue.c
|
d26aa8f6e3a9b8ad487d120fb9fbd38d630896e0
|
[] |
no_license
|
shahamish150294/Filesystem-and-Sync
|
3b7b20ead9168928a1b5a48a249b703a8f171e3f
|
f5c7d76321205279911a5fd6e0b028bbb45ffed9
|
refs/heads/master
| 2021-01-10T04:20:17.404410 | 2016-01-17T00:21:15 | 2016-01-17T00:21:15 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 1,082 |
c
|
future_queue.c
|
#include <future.h>
#include <prodcons.h>
syscall enq(pid32 p,future *fut, int call){
intmask mask;
mask=disable();
if(call==FROM_GET){
int x=fut->get_queue.back;
fut->get_queue.qarr[x]=p;
++(fut->get_queue.back);
// printf("\nEnqueued pid for getQ %d",p);
// printf("Value of back %d and front %d",fut->get_queue.back,fut->get_queue.front);
restore(mask);
}
else if(call==FROM_SET){
int x=fut->set_queue.back;
fut->set_queue.qarr[x]=p;
++(fut->set_queue.back);
// printf("\nEnqueued pid for setQ%d",p);
// printf("Value of back %d and front %d",fut->get_queue.back,fut->get_queue.front);
restore(mask);
}
return OK;
}
pid32 deq(future *fut,int call){
pid32 procid;
intmask mask;
mask=disable();
int x;
if(call==FROM_GET)
{
x=fut->get_queue.front;
procid=fut->get_queue.qarr[x];
++(fut->get_queue.front);
}
else if (call==FROM_SET)
{ x=fut->set_queue.front;
procid=fut->set_queue.qarr[x];
++(fut->set_queue.front);
}
//printf("Deq: Value of back %d and front %d",fut->get_queue.back,fut->get_queue.front);
restore(mask);
return procid;
}
|
4757ede29174b0c29bfb37d8f5f28947e40ae17d
|
a24b1c2cb0bf8b5a9aa945c8914e75de9ea154fc
|
/components/fonts/dejavu_sans_condensed_12.c
|
2acaf6b3f2f28107c55f29d8ea838a0356e0326f
|
[] |
no_license
|
bkgoodman/ESP32_IDF_EINK
|
a89c1d581e28b4d5fffc5039adb26e79b6522711
|
313e793d1bf307dfe21a947ea953b4467aebe4e4
|
refs/heads/master
| 2023-04-09T02:21:20.572749 | 2021-01-10T22:24:37 | 2021-01-10T22:24:37 | 326,068,248 | 0 | 1 | null | 2021-01-06T22:24:38 | 2021-01-01T22:42:19 |
C
|
UTF-8
|
C
| false | false | 10,799 |
c
|
dejavu_sans_condensed_12.c
|
#ifndef PROGMEM
#define PROGMEM
#endif
#include <stdint.h>
const uint8_t oledfont_DejaVu_Sans_Condensed_12[] PROGMEM = {
6 , // Width
16 , // Height
32 , // First Char
95 , // Number of Characters
// Jump Table:
0xff, 0xff, 0x00, 6, // Char 32 - Nodata
0x0, 0x0, 0x4, 0x4, // Char 33 !
0x0, 0x4, 0x5, 0x5, // Char 34 "
0x0, 0x9, 0xe, 0x9, // Char 35 #
0x0, 0x17, 0xa, 0x7, // Char 36 $
0x0, 0x21, 0x14, 0xc, // Char 37 %
0x0, 0x35, 0xe, 0x9, // Char 38 &
0x0, 0x43, 0x1, 0x3, // Char 39 '
0x0, 0x44, 0x4, 0x4, // Char 40 (
0x0, 0x48, 0x4, 0x4, // Char 41 )
0x0, 0x4c, 0x9, 0x7, // Char 42 *
0x0, 0x55, 0xd, 0x9, // Char 43 +
0x0, 0x62, 0x2, 0x3, // Char 44 ,
0x0, 0x64, 0x4, 0x4, // Char 45 -
0x0, 0x68, 0x2, 0x3, // Char 46 .
0x0, 0x6a, 0x7, 0x6, // Char 47 /
0x0, 0x71, 0xa, 0x7, // Char 48 0
0x0, 0x7b, 0xa, 0x7, // Char 49 1
0x0, 0x85, 0xa, 0x7, // Char 50 2
0x0, 0x8f, 0xa, 0x7, // Char 51 3
0x0, 0x99, 0xc, 0x8, // Char 52 4
0x0, 0xa5, 0xa, 0x7, // Char 53 5
0x0, 0xaf, 0xa, 0x7, // Char 54 6
0x0, 0xb9, 0x9, 0x7, // Char 55 7
0x0, 0xc2, 0xa, 0x7, // Char 56 8
0x0, 0xcc, 0xa, 0x7, // Char 57 9
0x0, 0xd6, 0x4, 0x4, // Char 58 :
0x0, 0xda, 0x2, 0x3, // Char 59 ;
0x0, 0xdc, 0xe, 0x9, // Char 60 <
0x0, 0xea, 0xe, 0x9, // Char 61 =
0x0, 0xf8, 0xe, 0x9, // Char 62 >
0x1, 0x6, 0x7, 0x6, // Char 63 ?
0x1, 0xd, 0x12, 0xb, // Char 64 @
0x1, 0x1f, 0xe, 0x9, // Char 65 A
0x1, 0x2d, 0xc, 0x8, // Char 66 B
0x1, 0x39, 0xc, 0x8, // Char 67 C
0x1, 0x45, 0xe, 0x9, // Char 68 D
0x1, 0x53, 0xa, 0x7, // Char 69 E
0x1, 0x5d, 0x9, 0x7, // Char 70 F
0x1, 0x66, 0xe, 0x9, // Char 71 G
0x1, 0x74, 0xc, 0x8, // Char 72 H
0x1, 0x80, 0x2, 0x3, // Char 73 I
0x1, 0x82, 0x6, 0x5, // Char 74 J
0x1, 0x88, 0xc, 0x8, // Char 75 K
0x1, 0x94, 0xa, 0x7, // Char 76 L
0x1, 0x9e, 0xe, 0x9, // Char 77 M
0x1, 0xac, 0xc, 0x8, // Char 78 N
0x1, 0xb8, 0xe, 0x9, // Char 79 O
0x1, 0xc6, 0x9, 0x7, // Char 80 P
0x1, 0xcf, 0xe, 0x9, // Char 81 Q
0x1, 0xdd, 0xc, 0x8, // Char 82 R
0x1, 0xe9, 0xa, 0x7, // Char 83 S
0x1, 0xf3, 0xd, 0x9, // Char 84 T
0x2, 0x0, 0xc, 0x8, // Char 85 U
0x2, 0xc, 0xd, 0x9, // Char 86 V
0x2, 0x19, 0x13, 0xc, // Char 87 W
0x2, 0x2c, 0xc, 0x8, // Char 88 X
0x2, 0x38, 0xb, 0x8, // Char 89 Y
0x2, 0x43, 0xe, 0x9, // Char 90 Z
0x2, 0x51, 0x4, 0x4, // Char 91 [
0x2, 0x55, 0x8, 0x6, // Char 92 Backslash
0x2, 0x5d, 0x4, 0x4, // Char 93 ]
0x2, 0x61, 0xd, 0x9, // Char 94 ^
0x2, 0x6e, 0xa, 0x7, // Char 95 _
0x2, 0x78, 0x3, 0x4, // Char 96 `
0x2, 0x7b, 0xa, 0x7, // Char 97 a
0x2, 0x85, 0xa, 0x7, // Char 98 b
0x2, 0x8f, 0x8, 0x6, // Char 99 c
0x2, 0x97, 0xa, 0x7, // Char 100 d
0x2, 0xa1, 0xa, 0x7, // Char 101 e
0x2, 0xab, 0x7, 0x6, // Char 102 f
0x2, 0xb2, 0xa, 0x7, // Char 103 g
0x2, 0xbc, 0xa, 0x7, // Char 104 h
0x2, 0xc6, 0x2, 0x3, // Char 105 i
0x2, 0xc8, 0x4, 0x4, // Char 106 j
0x2, 0xcc, 0xa, 0x7, // Char 107 k
0x2, 0xd6, 0x2, 0x3, // Char 108 l
0x2, 0xd8, 0x12, 0xb, // Char 109 m
0x2, 0xea, 0xa, 0x7, // Char 110 n
0x2, 0xf4, 0xa, 0x7, // Char 111 o
0x2, 0xfe, 0xa, 0x7, // Char 112 p
0x3, 0x8, 0xa, 0x7, // Char 113 q
0x3, 0x12, 0x5, 0x5, // Char 114 r
0x3, 0x17, 0x8, 0x6, // Char 115 s
0x3, 0x1f, 0x8, 0x6, // Char 116 t
0x3, 0x27, 0xa, 0x7, // Char 117 u
0x3, 0x31, 0xb, 0x8, // Char 118 v
0x3, 0x3c, 0x10, 0xa, // Char 119 w
0x3, 0x4c, 0xa, 0x7, // Char 120 x
0x3, 0x56, 0xb, 0x8, // Char 121 y
0x3, 0x61, 0xa, 0x7, // Char 122 z
0x3, 0x6b, 0x8, 0x6, // Char 123 {
0x3, 0x73, 0x2, 0x3, // Char 124 |
0x3, 0x75, 0x9, 0x7, // Char 125 }
0x3, 0x7e, 0xe, 0x9, // Char 126 ~
// Data Table:
0xf8 , 0x9 , 0xf8 , 0xd , // Char 33 !
0x38 , 0x0 , 0x0 , 0x0 , 0x38 , // Char 34 "
0x40 , 0x1 , 0x40 , 0xf , 0xe0 , 0x1 , 0x58 , 0x9 , 0xc0 , 0x7 , 0x78 , 0x1 , 0x40 , 0x1 , // Char 35 #
0xe0 , 0x8 , 0x90 , 0x8 , 0xfc , 0x3f , 0x10 , 0x9 , 0x0 , 0x7 , // Char 36 $
0x20 , 0x0 , 0xf8 , 0x0 , 0x88 , 0x8 , 0xf8 , 0xe , 0x0 , 0x3 , 0xc0 , 0x0 , 0x30 , 0x7 , 0x88 , 0x8 , 0x80 , 0xd , 0x0 , 0x7 , // Char 37 %
0x80 , 0x7 , 0xf8 , 0x8 , 0x88 , 0x8 , 0x8 , 0x9 , 0x0 , 0x6 , 0x0 , 0xf , 0x80 , 0x8 , // Char 38 &
0x38 , // Char 39 '
0xf0 , 0x7 , 0xc , 0x18 , // Char 40 (
0xc , 0x18 , 0xf8 , 0xf , // Char 41 )
0x10 , 0x0 , 0x60 , 0x0 , 0xf8 , 0x1 , 0x60 , 0x0 , 0x90 , // Char 42 *
0x80 , 0x0 , 0x80 , 0x0 , 0x80 , 0x0 , 0xf0 , 0xf , 0x80 , 0x0 , 0x80 , 0x0 , 0x80 , // Char 43 +
0x0 , 0x1c , // Char 44 ,
0x0 , 0x1 , 0x0 , 0x1 , // Char 45 -
0x0 , 0xc , // Char 46 .
0x0 , 0x38 , 0x80 , 0xf , 0xf8 , 0x0 , 0x8 , // Char 47 /
0xf0 , 0x7 , 0x18 , 0xc , 0x8 , 0x8 , 0x18 , 0xc , 0xf0 , 0x7 , // Char 48 0
0x8 , 0x8 , 0x8 , 0x8 , 0xf8 , 0xf , 0x0 , 0x8 , 0x0 , 0x8 , // Char 49 1
0x18 , 0xc , 0x8 , 0xe , 0x8 , 0x9 , 0xd8 , 0x8 , 0x70 , 0x8 , // Char 50 2
0x8 , 0x8 , 0x48 , 0x8 , 0x48 , 0x8 , 0xf8 , 0xc , 0x30 , 0x7 , // Char 51 3
0x0 , 0x2 , 0x80 , 0x3 , 0x60 , 0x2 , 0x18 , 0x2 , 0xf8 , 0xf , 0x0 , 0x2 , // Char 52 4
0x78 , 0x8 , 0x48 , 0x8 , 0x48 , 0x8 , 0xc8 , 0xc , 0x80 , 0x7 , // Char 53 5
0xf0 , 0x7 , 0xd8 , 0xc , 0x48 , 0x8 , 0x48 , 0x8 , 0x88 , 0x7 , // Char 54 6
0x8 , 0x0 , 0x8 , 0xc , 0x88 , 0x7 , 0xf8 , 0x0 , 0x18 , // Char 55 7
0x70 , 0x7 , 0x88 , 0x8 , 0x88 , 0x8 , 0xd8 , 0x8 , 0x70 , 0x7 , // Char 56 8
0xf0 , 0x8 , 0x8 , 0x9 , 0x8 , 0x9 , 0x98 , 0xd , 0xf0 , 0x3 , // Char 57 9
0x60 , 0xc , 0x40 , 0x8 , // Char 58 :
0x60 , 0x1c , // Char 59 ;
0x80 , 0x1 , 0x80 , 0x1 , 0xc0 , 0x3 , 0x40 , 0x2 , 0x40 , 0x6 , 0x60 , 0x4 , 0x20 , 0x4 , // Char 60 <
0x80 , 0x2 , 0x80 , 0x2 , 0x80 , 0x2 , 0x80 , 0x2 , 0x80 , 0x2 , 0x80 , 0x2 , 0x80 , 0x2 , // Char 61 =
0x20 , 0x4 , 0x60 , 0x4 , 0x40 , 0x6 , 0x40 , 0x2 , 0xc0 , 0x3 , 0x80 , 0x1 , 0x80 , 0x1 , // Char 62 >
0x8 , 0x0 , 0x88 , 0xf , 0xd8 , 0x0 , 0x70 , // Char 63 ?
0xe0 , 0xf , 0x30 , 0x18 , 0x98 , 0x33 , 0xc8 , 0x26 , 0x48 , 0x24 , 0xc8 , 0x26 , 0xd8 , 0x37 , 0x30 , 0x6 , 0xe0 , 0x3 , // Char 64 @
0x0 , 0x8 , 0x0 , 0x7 , 0xe0 , 0x2 , 0x18 , 0x2 , 0x78 , 0x2 , 0xc0 , 0x3 , 0x0 , 0xe , // Char 65 A
0xf8 , 0xf , 0x88 , 0x8 , 0x88 , 0x8 , 0x88 , 0x8 , 0xf0 , 0xf , 0x0 , 0x2 , // Char 66 B
0xf0 , 0x7 , 0x18 , 0xc , 0x8 , 0x8 , 0x8 , 0x8 , 0x8 , 0x8 , 0x10 , 0x4 , // Char 67 C
0xf8 , 0xf , 0x8 , 0x8 , 0x8 , 0x8 , 0x8 , 0x8 , 0x18 , 0xc , 0xf0 , 0x7 , 0xc0 , 0x1 , // Char 68 D
0xf8 , 0xf , 0x88 , 0x8 , 0x88 , 0x8 , 0x88 , 0x8 , 0x88 , 0x8 , // Char 69 E
0xf8 , 0xf , 0x88 , 0x0 , 0x88 , 0x0 , 0x88 , 0x0 , 0x8 , // Char 70 F
0xf0 , 0x7 , 0x18 , 0xc , 0x8 , 0x8 , 0x8 , 0x8 , 0x88 , 0x8 , 0x98 , 0xf , 0x80 , 0x7 , // Char 71 G
0xf8 , 0xf , 0x80 , 0x0 , 0x80 , 0x0 , 0x80 , 0x0 , 0x80 , 0x0 , 0xf8 , 0xf , // Char 72 H
0xf8 , 0xf , // Char 73 I
0x0 , 0x40 , 0x0 , 0x40 , 0xf8 , 0x3f , // Char 74 J
0xf8 , 0xf , 0xc0 , 0x0 , 0x60 , 0x1 , 0x30 , 0x2 , 0x18 , 0xc , 0x8 , 0x8 , // Char 75 K
0xf8 , 0xf , 0x0 , 0x8 , 0x0 , 0x8 , 0x0 , 0x8 , 0x0 , 0x8 , // Char 76 L
0xf8 , 0xf , 0x38 , 0x0 , 0xe0 , 0x1 , 0x0 , 0x3 , 0xc0 , 0x1 , 0x38 , 0x0 , 0xf8 , 0xf , // Char 77 M
0xf8 , 0xf , 0x38 , 0x0 , 0xe0 , 0x0 , 0x80 , 0x3 , 0x0 , 0xe , 0xf8 , 0xf , // Char 78 N
0xf0 , 0x7 , 0x18 , 0xc , 0x8 , 0x8 , 0x8 , 0x8 , 0x18 , 0xc , 0x30 , 0x6 , 0xe0 , 0x3 , // Char 79 O
0xf8 , 0xf , 0x88 , 0x0 , 0x88 , 0x0 , 0x88 , 0x0 , 0x70 , // Char 80 P
0xf0 , 0x7 , 0x18 , 0xc , 0x8 , 0x8 , 0x8 , 0x8 , 0x18 , 0x1c , 0x30 , 0x26 , 0xe0 , 0x3 , // Char 81 Q
0xf8 , 0xf , 0x88 , 0x0 , 0x88 , 0x0 , 0x88 , 0x1 , 0x70 , 0x7 , 0x0 , 0xc , // Char 82 R
0x70 , 0x8 , 0xc8 , 0x8 , 0x88 , 0x8 , 0x88 , 0x8 , 0x8 , 0x7 , // Char 83 S
0x8 , 0x0 , 0x8 , 0x0 , 0x8 , 0x0 , 0xf8 , 0xf , 0x8 , 0x0 , 0x8 , 0x0 , 0x8 , // Char 84 T
0xf8 , 0x7 , 0x0 , 0xc , 0x0 , 0x8 , 0x0 , 0x8 , 0x0 , 0xc , 0xf8 , 0x7 , // Char 85 U
0x8 , 0x0 , 0x70 , 0x0 , 0x80 , 0x3 , 0x0 , 0xc , 0x0 , 0xf , 0xe0 , 0x1 , 0x38 , // Char 86 V
0x8 , 0x0 , 0xf8 , 0x1 , 0x80 , 0xf , 0x0 , 0xf , 0xf0 , 0x1 , 0x38 , 0x0 , 0xe0 , 0x3 , 0x0 , 0xe , 0xc0 , 0xf , 0x78 , // Char 87 W
0x18 , 0xc , 0x30 , 0x3 , 0xc0 , 0x1 , 0xe0 , 0x3 , 0x38 , 0x6 , 0x8 , 0x8 , // Char 88 X
0x8 , 0x0 , 0x38 , 0x0 , 0x60 , 0x0 , 0xc0 , 0xf , 0x60 , 0x0 , 0x18 , // Char 89 Y
0x0 , 0x8 , 0x8 , 0xc , 0x8 , 0xb , 0x88 , 0x9 , 0x68 , 0x8 , 0x38 , 0x8 , 0x8 , 0x8 , // Char 90 Z
0xfc , 0x1f , 0x4 , 0x10 , // Char 91 [
0x18 , 0x0 , 0xe0 , 0x1 , 0x0 , 0x1e , 0x0 , 0x10 , // Char 92 Backslash
0x4 , 0x10 , 0xfc , 0x1f , // Char 93 ]
0x20 , 0x0 , 0x30 , 0x0 , 0x18 , 0x0 , 0xc , 0x0 , 0x18 , 0x0 , 0x30 , 0x0 , 0x20 , // Char 94 ^
0x0 , 0x40 , 0x0 , 0x40 , 0x0 , 0x40 , 0x0 , 0x40 , 0x0 , 0x40 , // Char 95 _
0x6 , 0x0 , 0xc , // Char 96 `
0x20 , 0xf , 0x20 , 0x9 , 0x20 , 0x9 , 0xe0 , 0xf , 0x80 , 0xf , // Char 97 a
0xfc , 0xf , 0x60 , 0xc , 0x20 , 0x8 , 0x20 , 0x8 , 0xc0 , 0x7 , // Char 98 b
0xc0 , 0x7 , 0x20 , 0x8 , 0x20 , 0x8 , 0x20 , 0x8 , // Char 99 c
0xc0 , 0x7 , 0x20 , 0x8 , 0x20 , 0x8 , 0x60 , 0xc , 0xfc , 0xf , // Char 100 d
0xc0 , 0x7 , 0x20 , 0x9 , 0x20 , 0x9 , 0x60 , 0x9 , 0xc0 , 0x9 , // Char 101 e
0x20 , 0x0 , 0xf8 , 0xf , 0x24 , 0x0 , 0x24 , // Char 102 f
0xc0 , 0x47 , 0x20 , 0x48 , 0x20 , 0x48 , 0x60 , 0x6c , 0xe0 , 0x3f , // Char 103 g
0xfc , 0xf , 0x40 , 0x0 , 0x20 , 0x0 , 0x20 , 0x0 , 0xc0 , 0xf , // Char 104 h
0xe4 , 0xf , // Char 105 i
0x0 , 0x40 , 0xe4 , 0x3f , // Char 106 j
0xfc , 0xf , 0x80 , 0x1 , 0xc0 , 0x2 , 0x60 , 0xc , 0x20 , 0x8 , // Char 107 k
0xfc , 0xf , // Char 108 l
0xe0 , 0xf , 0x60 , 0x0 , 0x20 , 0x0 , 0x60 , 0x0 , 0xc0 , 0xf , 0x20 , 0x0 , 0x20 , 0x0 , 0xe0 , 0x0 , 0x80 , 0xf , // Char 109 m
0xe0 , 0xf , 0x20 , 0x0 , 0x20 , 0x0 , 0x20 , 0x0 , 0xc0 , 0xf , // Char 110 n
0xc0 , 0x7 , 0x20 , 0x8 , 0x20 , 0x8 , 0x60 , 0xc , 0xc0 , 0x7 , // Char 111 o
0xe0 , 0x7f , 0x60 , 0xc , 0x20 , 0x8 , 0x20 , 0x8 , 0xc0 , 0x7 , // Char 112 p
0xc0 , 0x7 , 0x20 , 0x8 , 0x20 , 0x8 , 0x60 , 0xc , 0xe0 , 0x7f , // Char 113 q
0xe0 , 0xf , 0x20 , 0x0 , 0x20 , // Char 114 r
0xe0 , 0x9 , 0x20 , 0x9 , 0x20 , 0x9 , 0x20 , 0x6 , // Char 115 s
0x20 , 0x0 , 0xf8 , 0x7 , 0x20 , 0x8 , 0x20 , 0x8 , // Char 116 t
0xe0 , 0x7 , 0x0 , 0x8 , 0x0 , 0x8 , 0x0 , 0xc , 0xe0 , 0xf , // Char 117 u
0x20 , 0x0 , 0xe0 , 0x1 , 0x0 , 0xf , 0x0 , 0xc , 0xc0 , 0x3 , 0x60 , // Char 118 v
0x20 , 0x0 , 0xe0 , 0x3 , 0x0 , 0xe , 0xc0 , 0x7 , 0xe0 , 0x0 , 0x80 , 0xf , 0x0 , 0xe , 0xe0 , 0x1 , // Char 119 w
0x60 , 0xc , 0xc0 , 0x7 , 0x80 , 0x3 , 0x60 , 0xe , 0x20 , 0x8 , // Char 120 x
0x20 , 0x0 , 0xe0 , 0x41 , 0x0 , 0x7f , 0x0 , 0x1e , 0xc0 , 0x3 , 0x60 , // Char 121 y
0x0 , 0x8 , 0x20 , 0xe , 0x20 , 0xb , 0xa0 , 0x8 , 0x60 , 0x8 , // Char 122 z
0x80 , 0x0 , 0x80 , 0x0 , 0x7c , 0x1f , 0x4 , 0x20 , // Char 123 {
0xfc , 0x3f , // Char 124 |
0x4 , 0x20 , 0x4 , 0x20 , 0xf8 , 0x1f , 0x80 , 0x0 , 0x80 , // Char 125 }
0x0 , 0x1 , 0x80 , 0x0 , 0x80 , 0x0 , 0x80 , 0x1 , 0x0 , 0x1 , 0x0 , 0x1 , 0x80 , 0x1 , // Char 126 ~
};
|
462e20a61fb8ec3f9709608ffc724721536f68ee
|
d016c473bc20efe81c700d40a1b097b4aae0a418
|
/src/survive_usb.c
|
743d805adbf2786c6d409c309445c552bcb5f997
|
[
"MIT",
"GPL-1.0-or-later"
] |
permissive
|
asymingt/libsurvive
|
1e87e7a7335d4cc6c2f66a56f3b45a9f518eaaec
|
d6614108c50b33eb79bd64bd9af2e6784513f24c
|
refs/heads/master
| 2020-04-05T19:26:08.880701 | 2018-12-10T22:03:18 | 2018-12-10T22:03:18 | 157,134,285 | 1 | 0 |
MIT
| 2018-11-12T00:13:21 | 2018-11-12T00:13:21 | null |
UTF-8
|
C
| false | false | 681 |
c
|
survive_usb.c
|
//<>< (C) 2016 C. N. Lohr, MOSTLY Under MIT/x11 License.
//
//Based off of https://github.com/collabora/OSVR-Vive-Libre
// Originally Copyright 2016 Philipp Zabel
// Originally Copyright 2016 Lubosz Sarnecki <lubosz.sarnecki@collabora.co.uk>
// Originally Copyright (C) 2013 Fredrik Hultin
// Originally Copyright (C) 2013 Jakob Bornecrantz
//
//But, re-written as best as I can to get it put under an open souce license instead of a forced-source license.
//If there are portions of the code too similar to the original, I would like to know so they can be re-written.
//All MIT/x11 Licensed Code in this file may be relicensed freely under the GPL or LGPL licenses.
//No code?
|
f505b56c8882abe0c4d4925285f64cf7a5023c9f
|
e0d48746515979b4f9093dc0fbb20e568ff3f09b
|
/src/device_test.h
|
7f95e68654c81322dbc2834a5611c552770c1b11
|
[] |
no_license
|
chaoscircuit/libchaos
|
0165383eaa5ec3d28520362cde125ac61fed78a2
|
e0e1da3581fad5888e2a64cb0498fe5c067b319e
|
refs/heads/master
| 2021-01-20T11:31:45.212762 | 2010-05-20T02:58:04 | 2010-05-20T02:58:04 | 489,569 | 1 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 191 |
h
|
device_test.h
|
/**
* \file device_test.h
* \brief Header file for device_test.c
*/
#ifndef DEVICE_TEST_H
#define DEVICE_TEST_H
#include "libchaos.h"
#include "usb_comm.h"
int DT_testDevice();
#endif
|
4d202a964bf16177614442134cc568af97f4f28d
|
b7c0537cd194d2a458e8093c51d389fb8d19140f
|
/Pods/Headers/Public/TLKit/TLActionSheet.h
|
a78a1a53aaac377d558ca13fde81bdb771516b10
|
[
"MIT"
] |
permissive
|
cnxingyu/TLChat
|
f6884edd9c3ec37556dd7670b18f59f2e9ef4aa8
|
9a1ec8b623356813a9179750f9f3ca2112d52ecd
|
refs/heads/master
| 2022-03-30T06:28:41.741447 | 2020-01-29T12:41:52 | 2020-01-29T12:41:52 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 71 |
h
|
TLActionSheet.h
|
../../../TLKit/TLKit/Classes/TLFunctional/TLActionSheet/TLActionSheet.h
|
e319ea8fb1c58a1b1566d99a70bd09c5574f9a8b
|
8db17a4d4dc57486f7970d03e8bd4e751985c1d9
|
/src/motors.c
|
e2628f57a30509b3b6b3bc03e1f0e104a5f81611
|
[
"MIT"
] |
permissive
|
team-raiju/raiju
|
c50c2027b682bd49a6b8f3752eec5bd70366d4ce
|
f76580d3880a669430af55767657b6f33f592985
|
refs/heads/master
| 2022-03-14T03:00:44.849090 | 2019-12-02T03:06:55 | 2019-12-02T03:06:55 | null | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 2,502 |
c
|
motors.c
|
/**
* @file motors.c
*
* @brief Functions used to control motors
*/
#include "motors.h"
#include "tim.h"
#include "utils.h"
/***********************************************************************
* PWM Adapter
***********************************************************************/
void pwm_init(pwm_t* pwm) {
if (pwm->init_f != NULL) {
pwm->init_f();
}
HAL_TIM_PWM_Start(pwm->htim, pwm->channel);
__HAL_TIM_SET_COMPARE(pwm->htim, pwm->channel, 0);
}
void pwm_set(pwm_t* pwm, uint32_t value) {
__HAL_TIM_SET_COMPARE(pwm->htim, pwm->channel, value);
}
/***********************************************************************
* Motor Adapter
***********************************************************************/
void motor_init(motor_t* motor) {
pwm_init(&motor->red_pwm);
pwm_init(&motor->black_pwm);
}
void motor_stop(motor_t* motor) {
pwm_set(&motor->red_pwm, 0);
pwm_set(&motor->black_pwm, 0);
}
void motor_drive(motor_t* motor, int32_t speed) {
if (speed < 0) {
pwm_set(&motor->red_pwm, -speed);
pwm_set(&motor->black_pwm, 0);
} else {
pwm_set(&motor->red_pwm, 0);
pwm_set(&motor->black_pwm, speed);
}
}
/***********************************************************************
* Driving Service
***********************************************************************/
static motor_t left_motor = {
.black_pwm = {
.init_f = MX_TIM1_Init,
.htim = &htim1,
.channel = TIM_CHANNEL_1,
},
.red_pwm = {
.init_f = MX_TIM2_Init,
.htim = &htim2,
.channel = TIM_CHANNEL_1,
},
};
static motor_t right_motor = {
.black_pwm = {
.init_f = MX_TIM17_Init,
.htim = &htim17,
.channel = TIM_CHANNEL_1,
},
// MX_TIM1_Init is already called on the left_motor
// It should only be called once
.red_pwm = {
.init_f = NULL,
.htim = &htim1,
.channel = TIM_CHANNEL_2,
},
};
void motors_init() {
motor_init(&left_motor);
motor_init(&right_motor);
}
void motors_drive(int16_t left, int16_t right) {
left = constrain(left, -99, 99);
right = constrain(right, -99, 99);
// deadzone
if (abs(left) < 10) {
left = 0;
}
if (abs(right) < 10) {
right = 0;
}
left = map(left, -100, 100, -1000, 1000);
right = map(right, -100, 100, -1000, 1000);
motor_drive(&left_motor, left);
motor_drive(&right_motor, right);
}
|
943253fb649d34e576c32e4df417d9fe3f90adab
|
a178ab57e4c0424d6925bff608cf8b5333b199e7
|
/libft/ft_strchr.c
|
753484b4307a80b3a6fabf87787208fb0b508d35
|
[] |
no_license
|
Dimastii/msh
|
b5c9904de242be24ae240b30b9e261c70de1d614
|
2be3f210df7c6182eaca145456785ea4d1cebdcf
|
refs/heads/main
| 2023-04-09T04:43:02.870319 | 2021-04-25T14:14:03 | 2021-04-25T14:14:03 | 354,606,452 | 1 | 1 | null | 2021-04-12T14:34:54 | 2021-04-04T17:33:33 |
C
|
UTF-8
|
C
| false | false | 1,150 |
c
|
ft_strchr.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strchr.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cveeta <cveeta@student.21-school.ru> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/10/29 14:33:54 by cveeta #+# #+# */
/* Updated: 2020/10/29 14:59:43 by cveeta ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
char *ft_strchr(const char *string, int symbol)
{
char *str;
char sb;
sb = (char)symbol;
str = (char *)string;
while (*str)
{
if (*str == sb)
return (str);
str++;
}
if (*str == sb)
return (str);
else
return (NULL);
}
|
791d275a8b9f7ad817c05c1865ea1603a718e65f
|
fdfb7386f0dc2e270cb555469f4a156df96a82ff
|
/0x13-more_singly_linked_lists/2-add_nodeint.c
|
642f86bcc784ee1a661f3725dff0ea06d97baa91
|
[] |
no_license
|
faykris/holbertonschool-low_level_programming
|
72c4043e351500ea094d3a8329e00743fdd88e5d
|
7f66c9ca5e02c7d6387c90659b621cc367c450e2
|
refs/heads/main
| 2023-08-17T04:22:56.079885 | 2021-09-03T03:00:30 | 2021-09-03T03:00:30 | 335,694,916 | 0 | 0 | null | null | null | null |
UTF-8
|
C
| false | false | 408 |
c
|
2-add_nodeint.c
|
#include "lists.h"
/**
* add_nodeint - function that adds a new node at the beginning
* of a listint_t list.
* @head: Address head struct
* @n: integer value.
*
* Return: a size_t value.
*/
listint_t *add_nodeint(listint_t **head, const int n)
{
listint_t *new;
new = malloc(sizeof(listint_t));
if (!new)
{
return (NULL);
}
new->n = n;
new->next = *head;
*head = new;
return (new);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.