file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/176706425.c
|
int fib(const int n) {
if (n == 1) return 1;
if (n == 2) return 1;
return fib(n-1) + fib(n-2);
}
|
the_stack_data/100139662.c
|
#include <stdio.h>
#include <stdlib.h>
int global_count = 0;
void exchange_member(int *arr, int x, int y) {
int tmp = arr[x];
arr[x] = arr[y];
arr[y] = tmp;
return;
}
void select_pivot_first(int *arr, int lo, int hi){
return;
}
void select_pivot_last(int *arr, int lo, int hi){
exchange_member(arr, lo, hi);
return;
}
void select_pivot_medium(int *arr, int lo, int hi){
int mid = (hi-lo)/2+lo;
if (((arr[lo]<arr[mid])&&(arr[mid]<arr[hi]))||((arr[hi]<arr[mid])&&(arr[mid]<arr[lo]))) {
exchange_member(arr, lo, mid);
}
else if (((arr[lo]<arr[hi])&&(arr[hi]<arr[mid]))||((arr[mid]<arr[hi])&&(arr[hi]<arr[lo]))){
exchange_member(arr, lo, hi);
}
return;
}
int partition(int *arr, int lo, int hi) {
select_pivot_medium(arr, lo, hi);
int pivot = arr[lo];
int i = lo + 1;
for (int j = lo + 1; j <= hi; j++) {
if (arr[j] < pivot) {
exchange_member(arr, j, i);
i++;
}
}
exchange_member(arr, lo, i - 1);
return i;
}
void quick_sort(int *arr, int lo, int hi) {
if (lo < hi) {
int mid = partition(arr, lo, hi);
quick_sort(arr, lo, mid - 2);
global_count += mid - lo;
quick_sort(arr, mid, hi);
global_count += hi - mid;
}
return;
}
int main() {
int size_of_problem = 10000;
int *numbers_to_sort = (int *) malloc(size_of_problem * sizeof(int));
for (int i = 0; i < size_of_problem; i++) {
scanf("%d", &numbers_to_sort[i]);
}
quick_sort(numbers_to_sort, 0, size_of_problem - 1);
for (int i = 0; i < size_of_problem; i++) {
printf("%d ", numbers_to_sort[i]);
}
printf("\n%d", global_count);
free(numbers_to_sort);
return 0;
}
|
the_stack_data/215767524.c
|
/*********************************************************************
* SEGGER Microcontroller GmbH & Co. KG *
* The Embedded Experts *
**********************************************************************
* *
* (c) 2014 - 2016 SEGGER Microcontroller GmbH & Co. KG *
* *
* www.segger.com Support: [email protected] *
* *
**********************************************************************
* *
* SEGGER RTT * Real Time Transfer for embedded targets *
* *
**********************************************************************
* *
* All rights reserved. *
* *
* SEGGER strongly recommends to not make any changes *
* to or modify the source code of this software in order to stay *
* compatible with the RTT protocol and J-Link. *
* *
* Redistribution and use in source and binary forms, with or *
* without modification, are permitted provided that the following *
* conditions are met: *
* *
* o Redistributions of source code must retain the above copyright *
* notice, this list of conditions and the following disclaimer. *
* *
* o Redistributions in binary form must reproduce the above *
* copyright notice, this list of conditions and the following *
* disclaimer in the documentation and/or other materials provided *
* with the distribution. *
* *
* o Neither the name of SEGGER Microcontroller GmbH & Co. KG *
* nor the names of its contributors may be used to endorse or *
* promote products derived from this software without specific *
* prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND *
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, *
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF *
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE *
* DISCLAIMED. IN NO EVENT SHALL SEGGER Microcontroller BE LIABLE FOR *
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR *
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT *
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; *
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT *
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE *
* USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH *
* DAMAGE. *
* *
**********************************************************************
* *
* RTT version: 6.10a *
* *
**********************************************************************
---------------------------END-OF-HEADER------------------------------
File : SEGGER_RTT_Syscalls_IAR.c
Purpose : Low-level functions for using printf() via RTT in IAR.
To use RTT for printf output, include this file in your
application and set the Library Configuration to Normal.
Revision: $Rev: 4351 $
----------------------------------------------------------------------
*/
#ifdef __IAR_SYSTEMS_ICC__
#include <yfuns.h>
#include "SEGGER_RTT.h"
#pragma module_name = "?__write"
/*********************************************************************
*
* Function prototypes
*
**********************************************************************
*/
size_t __write(int handle, const unsigned char * buffer, size_t size);
/*********************************************************************
*
* Global functions
*
**********************************************************************
*/
/*********************************************************************
*
* __write()
*
* Function description
* Low-level write function.
* Standard library subroutines will use this system routine
* for output to all files, including stdout.
* Write data via RTT.
*/
size_t __write(int handle, const unsigned char * buffer, size_t size) {
(void) handle; /* Not used, avoid warning */
SEGGER_RTT_Write(0, (const char*)buffer, size);
return size;
}
/*********************************************************************
*
* __write_buffered()
*
* Function description
* Low-level write function.
* Standard library subroutines will use this system routine
* for output to all files, including stdout.
* Write data via RTT.
*/
size_t __write_buffered(int handle, const unsigned char * buffer, size_t size) {
(void) handle; /* Not used, avoid warning */
SEGGER_RTT_Write(0, (const char*)buffer, size);
return size;
}
#endif
/****** End Of File *************************************************/
|
the_stack_data/75138588.c
|
/** @file
Lib to include if using floats
Copyright (C) Microsoft Corporation. All rights reserved..
SPDX-License-Identifier: BSD-2-Clause-Patent
**/
//You need to include this to let the compiler know we are going to use floating point
int _fltused = 0x9875;
|
the_stack_data/28261675.c
|
/*
* Challenge 875
* The minment speed to eat the banana
*
*/
#include <stdio.h>
int main(int argc, char const *argv[])
{
// Solution : binary search
// Construct function f(x) , x as the speed of eating banana ( x/hour)
// Time limition H is the target;
// x's ranges from 1 to 10^9 .
//
int f(int* piles, int pilesSize,int x) {
int hours = 0;
for (int i = 0; i < pilesSize; i++) {
hours += piles[i] / x;
if (piles[i] % x > 0) {
hours++;
}
}
return hours;
}
int minEatingSpeed(int* piles, int pilesSize, int h){
//Definite the left,right boundary
int left = 1;
int right = 1000000000+1;
while(left < right)
{
int mid = left+(right-left)/2;
if ( h == f(piles,pilesSize,mid))
{
right = mid;
}
else if ( f(piles,pilesSize,mid) < h )
{
right = mid;
}
else if ( f(piles,pilesSize,mid) > h )
{
left = mid+1;
}
}
return left;
}
// Test code
int array[] = {3,6,7,11};
printf("%d\n",minEatingSpeed(array,4,8) );
return 0;
}
|
the_stack_data/1203246.c
|
/**
* @file
* @brief Simple test to draw screen Linux-style via /dev/..
*
* @date Jun 21, 2017
* @author Anton Bondarev
*/
#include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <inttypes.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <sys/ioctl.h>
#include <linux/fb.h>
int main() {
int fbfd = 0;
struct fb_var_screeninfo vinfo;
struct fb_fix_screeninfo finfo;
long int screensize = 0;
char *fbp = 0;
int x = 0, y = 0;
long int location = 0;
/* Open the file for reading and writing */
fbfd = open("/dev/fb0", O_RDWR);
if (fbfd == -1) {
perror("Error: cannot open framebuffer device");
exit(1);
}
printf("The framebuffer device was opened successfully.\n");
/* Get fixed screen information */
if (ioctl(fbfd, FBIOGET_FSCREENINFO, &finfo) == -1) {
perror("Error reading fixed information");
exit(2);
}
/* Get variable screen information */
if (ioctl(fbfd, FBIOGET_VSCREENINFO, &vinfo) == -1) {
perror("Error reading variable information");
exit(3);
}
printf("%" PRId32 "x%" PRId32 ", %" PRId32 "bpp\n", vinfo.xres, vinfo.yres, vinfo.bits_per_pixel);
/* Figure out the size of the screen in bytes */
screensize = vinfo.xres * vinfo.yres * vinfo.bits_per_pixel / 8;
/* Map the device to memory */
fbp = (char *) mmap(0, screensize, PROT_READ | PROT_WRITE, MAP_SHARED, fbfd,
0);
if ((int) fbp == -1) {
perror("Error: failed to map framebuffer device to memory");
exit(4);
}
printf("The framebuffer device was mapped to memory successfully.\n");
x = 300;
y = 100; /* Where we are going to put the pixel */
/* Figure out where in memory to put the pixel */
for (y = 100; y < 300; y++)
for (x = 100; x < 300; x++) {
location = (x + vinfo.xoffset) * (vinfo.bits_per_pixel / 8)
+ (y + vinfo.yoffset) * finfo.line_length;
if (vinfo.bits_per_pixel == 32) {
*(fbp + location) = 100; /* Some blue */
*(fbp + location + 1) = 15 + (x - 100) / 2; /* A little green*/
*(fbp + location + 2) = 200 - (y - 100) / 5; /* A lot of red */
*(fbp + location + 3) = 0; /* No transparency */
} else { /* assume 16bpp */
int b = 10;
int g = (x - 100) / 6; /* A little green */
int r = 31 - (y - 100) / 16; /* A lot of red */
unsigned short int t = r << 11 | g << 5 | b;
*((unsigned short int*) (fbp + location)) = t;
}
}
munmap(fbp, screensize);
close(fbfd);
return 0;
}
|
the_stack_data/36076035.c
|
/***************************************************************************************
* FILE NAME: I_Love_Big_Numbers-10220.c
*
* PURPOSE: Solve of Uva problem.
*
* @author: Md. Arafat Hasan Jenin
* EMAIL: [email protected]
*
* DEVELOPMENT HISTORY:
* Date Change Version Description
* ------------------------------------------------------------------------
* 26 Sep 16 New 1.0 Completed,Accepted
**************************************************************************************/
#include<stdio.h>
int mul_s(int a,int b,int c);
int mul_c(int a,int b,int c);
int sum_s(int a,int b,int c);
int sum_c(int a,int b,int c);
void multi(void);
void str2int(int n, char* c);
char x[2700],y[1002],a[1000][2700];
int fact;
int main(){
int n,i, sum;
x[0]='1',x[1]='\0';
for(fact=1;fact<=1000;fact++){
str2int(fact,y);
multi();
}
while(scanf("%d",&n)==1){
sum = 0;
if(n<=0);
else{
for(i=0;;i++){
if(a[n][i]=='\0') break;
sum += a[n][i] - 48;
}
}
printf("%d\n", sum);
}
return 0;
}
/*
*str2int() function convert integer number to string
* Prototype void str2int(int n, char* c)
* n is the number to convert, c is pointer of the char
* array to store the string
* */
void str2int(int n, char* c) {
int reverse = 0, temp,i=0;
temp = n;
while( temp != 0 ) {
reverse = reverse * 10;
reverse = reverse + temp%10;
temp = temp/10;
}
temp=reverse;
while( temp != 0 ) {
c[i] = temp%10+48;
temp = temp/10;
i++;
}
if(n%10==0)
while(n!=0){
if(n%10==0)
c[i]='0';
i++;
n=n/10;
if(n%10)
break;
}
c[i]='\0';
}
void multi(void) {
int i,j,k,C,r,xi,yi,Cs,m;
char t[5000];
C=0,Cs=0;
for(i=0;; i++) if(x[i]=='\0') break;
xi=i-1;
for(i=0;; i++) if(y[i]=='\0') break;
yi=i-1;
for(i=0; i<5000; i++) t[i]='0';
for(j=0; yi>=0; yi--,j++) {
for(i=0,k=xi; k>=0; k--,i++) {
r=mul_s(x[k]-48,y[yi]-48,C);
C=mul_c(x[k]-48,y[yi]-48,C);
m=t[i+j];
t[i+j]=sum_s(r,m-48,Cs)+48;
Cs=sum_c(r,m-48,Cs);
}
t[i+j]=C+Cs+48;
C=0;
Cs=0;
}
for(k=i+j;k>0;k--){
if(t[k]!=48){
t[k+1]='\0';
break;
}
}
for(i=0; k>=0; k--,i++){
x[i]=t[k];
a[fact][i]=t[k];
}
a[fact][i]='\0';
x[i]='\0';
}
int mul_s(int a,int b,int c) {
if(a*b+c>9)return (a*b+c)%10;
return a*b+c;
}
int mul_c(int a,int b,int c) {
if(a*b+c>9) return (a*b+c)/10;
return 0;
}
int sum_s(int a,int b,int c) {
if(a+b+c>9) return (a+b+c)%10;
return a+b+c;
}
int sum_c(int a,int b,int c) {
if(a+b+c>9) return (a+b+c)/10;
return 0;
}
|
the_stack_data/200142367.c
|
/* -*- mode: C; tab-width:8; -*-
fxtris.c - 3Dfx VooDoo triangle functions
*/
/*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the Free
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
* See the file fxapi.c for more informations about authors
*
*/
#if defined(FX)
#include "fxdrv.h"
/************************************************************************/
/*********************** Triangle functions *****************************/
/************************************************************************/
#define GOURAUD(v) { \
fxMesa->gWin[(v)].r=(float) VB->Color[(v)][0]; \
fxMesa->gWin[(v)].g=(float) VB->Color[(v)][1]; \
fxMesa->gWin[(v)].b=(float) VB->Color[(v)][2]; \
fxMesa->gWin[(v)].a=(float) VB->Color[(v)][3]; \
}
/************************************************************************/
static void fxTriangleSmooth(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
static void fxTriangleSmoothTwoSide(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
struct vertex_buffer *VB=ctx->VB;
GOURAUD(v1);
GOURAUD(v2);
GOURAUD(v3);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
static void fxTriangleFlat(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
GLubyte *Color=ctx->VB->Color[pv];
grConstantColorValue(FXCOLOR(Color[0], Color[1], Color[2], Color[3]));
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
/************************************************************************/
static void fxTriangleSmoothFrontBack(GLcontext *ctx, GLuint v1,
GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
grDepthMask(FXFALSE);
grRenderBuffer(GR_BUFFER_BACKBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,fxMesa->haveAlphaBuffer ? FXTRUE : FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
if(ctx->Depth.Mask)
grDepthMask(FXTRUE);
grRenderBuffer(GR_BUFFER_FRONTBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
static void fxTriangleSmoothTwoSideFrontBack(GLcontext *ctx, GLuint v1,
GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
struct vertex_buffer *VB=ctx->VB;
GOURAUD(v1);
GOURAUD(v2);
GOURAUD(v3);
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
grDepthMask(FXFALSE);
grRenderBuffer(GR_BUFFER_BACKBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,fxMesa->haveAlphaBuffer ? FXTRUE : FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
if(ctx->Depth.Mask)
grDepthMask(FXTRUE);
grRenderBuffer(GR_BUFFER_FRONTBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
static void fxTriangleFlatFrontBack(GLcontext *ctx, GLuint v1,
GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
GLubyte *Color=ctx->VB->Color[pv];
grConstantColorValue(FXCOLOR(Color[0], Color[1], Color[2], Color[3]));
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
grDepthMask(FXFALSE);
grRenderBuffer(GR_BUFFER_BACKBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
if(ctx->Color.ColorMask)
grColorMask(FXTRUE,fxMesa->haveAlphaBuffer ? FXTRUE : FXFALSE);
else
grColorMask(FXFALSE,FXFALSE);
if(ctx->Depth.Mask)
grDepthMask(FXTRUE);
grRenderBuffer(GR_BUFFER_FRONTBUFFER);
grDrawTriangle(&fxMesa->gWin[v1], &fxMesa->gWin[v2], &fxMesa->gWin[v3]);
}
/************************************************************************/
static void fxAATriangleSmooth(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
grAADrawTriangle(&fxMesa->gWin[v1],&fxMesa->gWin[v2],&fxMesa->gWin[v3],
FXTRUE,FXTRUE,FXTRUE);
}
static void fxAATriangleSmoothTwoSide(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
struct vertex_buffer *VB=ctx->VB;
GOURAUD(v1);
GOURAUD(v2);
GOURAUD(v3);
grAADrawTriangle(&fxMesa->gWin[v1],&fxMesa->gWin[v2],&fxMesa->gWin[v3],
FXTRUE,FXTRUE,FXTRUE);
}
static void fxAATriangleFlat(GLcontext *ctx, GLuint v1, GLuint v2, GLuint v3, GLuint pv)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
GLubyte *Color=ctx->VB->Color[pv];
grConstantColorValue(FXCOLOR(Color[0],Color[1],
Color[2],Color[3]));
fxMesa->gWin[v1].a=fxMesa->gWin[v2].a=fxMesa->gWin[v3].a=(float)Color[3];
grAADrawTriangle(&fxMesa->gWin[v1],&fxMesa->gWin[v2],&fxMesa->gWin[v3],
FXTRUE,FXTRUE,FXTRUE);
}
/************************************************************************/
triangle_func fxDDChooseTriangleFunction(GLcontext *ctx)
{
fxMesaContext fxMesa=(fxMesaContext)ctx->DriverCtx;
if((ctx->Polygon.OffsetAny) || /* Not yet supported */
(ctx->Polygon.StippleFlag))
return NULL;
if(ctx->Polygon.SmoothFlag) {
if(ctx->Light.ShadeModel==GL_SMOOTH) {
if(ctx->Light.Model.TwoSide)
return fxAATriangleSmoothTwoSide;
return fxAATriangleSmooth;
}
return fxAATriangleFlat;
}
if(ctx->RasterMask & FRONT_AND_BACK_BIT) {
if(ctx->Light.ShadeModel==GL_SMOOTH) {
if(ctx->Light.Model.TwoSide)
return fxTriangleSmoothTwoSideFrontBack;
return fxTriangleSmoothFrontBack;
}
return fxTriangleFlatFrontBack;
}
if(ctx->Light.ShadeModel==GL_SMOOTH) {
if(ctx->Light.Model.TwoSide)
return fxTriangleSmoothTwoSide;
return fxTriangleSmooth;
}
return fxTriangleFlat;
}
#else
/*
* Need this to provide at least one external definition.
*/
int gl_fx_dummy_function_tris(void)
{
return 0;
}
#endif /* FX */
|
the_stack_data/45449057.c
|
#include <stdio.h>
#include <stdlib.h>
#define max_size 5
int top=-1;
int stack[100];
int data;
void push()
{
if(top==max_size-1)
{
printf("Overflow\n");
}
else
{
printf("Enter the data\n");
scanf("%d",&data);
top=top+1;
stack[top]=data;
}
}
void pop()
{
if(top==-1)
{
printf("Empty\n");
}
else
{
top=top-1;
}
}
void display()
{
int i;
if(top==-1)
{
printf("Empty\n");
}
else
{
i=top;
while(i>=0)
{
printf("%d\n",stack[i]);
i=i-1;
}
}
}
void main()
{
int ch;
do
{
printf("1.Insert\n2.Delete\n3.Display\n4.Exit\n");
printf("Enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1: push();break;
case 2: pop();break;
case 3: display();break;
case 4: exit(0);
}
}while(ch!=4);
}
|
the_stack_data/1043014.c
|
/*
* Title: Lab 5 Problem 7
* Programmer: Christopher Lawrence Date completed: 10/12/2016
* Instructor: Professor Joe Jupin Class: CIS1057
*
* Description of program:
*
*
*/
// preprocessor directives
#include <stdio.h>
// input can be used through batch processing or it can be
// used through scanf continously but the escape character is '0'
void temperatures();
int main() {
// value that breaks out of the loop
printf("0 is the sentinel value\n\n");
// call to temperatures
temperatures();
return 0;
}
void temperatures(){
// counter, hot days, pleasant days, cold days
int hd = 0, pd = 0, cd = 0;
// sum of all temperatures
double sum = 0;
// given temperature value
int n = 0;
do{
// printf scanf pair for n
printf("Enter a temperature: ");
scanf("%d", &n);
// increase in sum of temperatures
sum += n;
// if n is a hot day
if(n > 84){
printf("%d -> Hot day\n", n);
hd++;
}
// if n is pleasant day
else if(n > 59){
printf("%d -> pleasant day\n", n);
pd++;
}
// if n is a cold day
else if(n > 0 || n < 0){
printf("%d -> cold day\n", n);
cd++;
}
// 0 is the given sentinel value
}while(n != 0);
// total days
int td = cd + hd + pd;
if(td != 0){
// statistical overview
printf("%d hot days, %d pleasant days, %d cold days\n", hd, pd, cd);
// average temperature for the given data
double avg_temp = sum / (cd + pd + hd);
printf("Average temperature of the given data set: %.2lf degrees\n", avg_temp);
}
// no valid temperatures entered
else{
printf("Sentinel value entered before any valid data\nTry again\n");
// call to main for user to trie again
main();
}
}
|
the_stack_data/218892911.c
|
void putchar(void)
{
int count;
int i;
int j;
count = 0;
i = 1;
j = 1;
if(i == 1 && j ==1)
write(1, '*', 1);
}
|
the_stack_data/135038.c
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n,top=-1,m,rqc=0,buffc=0,q,pct=0,z;
int clk=-1,b=0;
int arr[20][10],buffer[2][1000];
int rq[2][1000],ioex[1000],allex[1000], flag[1000], buffx[1000];
typedef struct proc
{
int no;
int burst;
}p;
int getdata()
{
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=10;j++)
arr[i][j]=0;
for(i=1;i<=n;i++)
arr[i][0]=i;
printf("\nEnter the Arrival Times:\n");
for(i=1;i<=n;i++)
scanf("%d",&arr[i][1]);
printf("Enter the 1st CPU Burst Times:\n");
for(i=1;i<=n;i++)
scanf("%d",&arr[i][2]);
printf("Enter the I/O Burst Times:\n");
for(i=1;i<=n;i++)
scanf("%d",&arr[i][3]);
printf("Enter the 2nd CPU Burst Times:\n");
for(i=1;i<=n;i++)
scanf("%d",&arr[i][4]);
}
void sortrq()
{
int i,j;
for(i=1;i<=n-1 && b>1;i++)
{
for(j=1;j<=n-i-1;j++)
{
if(rq[j]<rq[j+1])
{
rq[0][j]^=rq[0][j+1]^=rq[0][j]^=rq[0][j+1];
rq[1][j]^=rq[1][j+1]^=rq[1][j]^=rq[1][j+1];
}
}
}
}
void push(int x,int y)
{
int i=0,j;
if(rq[0][1]==-1)
{
rq[0][1]=x;
rq[1][1]=y;
top=1;
}
else
{
for(j=rqc;j>=1;j--)
{
rq[0][j+1]=rq[0][j]; //for name in 0th row
rq[1][j+1]=rq[1][j]; //for burst in 1st row
}
rq[0][1]=x;
rq[1][1]=y;
top++;
}
rqc++;
sortrq();
}
int pop()
{
int i=0,x;
if(top>0)
{
x=rq[0][top];
z=rq[1][top];
top--;
}
else if(top<=0);
return x;
}
void pushbuff(int x)
{
int i=0,j;
buffc++;
buffx[buffc]=x;
if(x==buffer[0][b]);
if(b<=0)
{
buffer[0][1]=x;
buffer[1][1]=arr[x][3];
b=1;
}
else if(b>0)
{
b++;
for(j=b;j>=1;j--)
{
buffer[0][j+1]=buffer[0][j];
buffer[1][j+1]=buffer[1][j];
}
buffer[0][1]=x;
buffer[1][1]=arr[x][3];
}
for(i=1;i<=n-1 && b>1;i++)
{
for(j=1;j<=n-i-1;j++)
{
if(buffer[1][j]<buffer[1][j+1])
{
buffer[0][j]^=buffer[0][j+1]^=buffer[0][j]^=buffer[0][j+1];
buffer[1][j]^=buffer[1][j+1]^=buffer[1][j]^=buffer[1][j+1];
}
}
}
}
int popbuff()
{
int x;
if(b>0)
{
x=buffer[0][b];
b--;
}
else;
return x;
}
int max()
{
int i,m=0;
for(i=1;i<=n;i++)
m+=arr[i][2]+arr[i][3]+arr[i][4];
return m;
}
void avg()
{
float a=0,b=0;
int i;
for(i=1;i<=n;i++)
{
a+=arr[i][5];
b+=arr[i][6];
}
a=a/n;
b=b/n;
printf("Avg. WT = %.2f\nAvg. TAT = %.2f\n",a,b);
}
void flagging()
{
int i,j;
for(i=1;i<100;i++)
flag[i]=0;
for(i=1;i<=n;i++)
for(j=2;j<=4;j++)
if(arr[i][j]>0)
flag[i]+=1;
}
void display()
{
int i,j;
printf("\n");
for(i=0;i<=80;i++)
printf("-");
printf("\nThe output is:\n");
printf("Process\tAT\tBT-1\tI/OT\tBT-2\tWT\tTAT\tCT\n");
for(i=1;i<=n;i++)
{
printf("P-%d\t",arr[i][0]);
for(j=1;j<=7;j++)
printf("%d\t", arr[i][j]);
printf("\n");
}
printf("\n");
for(i=0;i<=80;i++)
printf("-");
printf("\n\nThe ready queue is:\n");
for(i=rqc;i>=1;i--)
if(rq[0][i]!=0 && rq[0][i]!=-1)
printf("P-%d:%d ",rq[0][i],rq[1][i]);
printf("\n\nThe execution array is:\n");
for(i=0;i<=1000;i++)
{
if(allex[i]>0 && allex[i]!=allex[i-1])
printf("%d P-%d ",i, allex[i]);
else if(allex[i]==-4 && allex[i]!=allex[i-1])
printf("%d -- ",i);
}
printf("\n\nThe buffer is:\n");
for(i=1;i<=buffc;i++)
if(buffx[i]!=-1)
printf("P-%d ", buffx[i]);
printf("\n");
avg();
}
int check()
{
int i;
for(i=0;i<=n;i++)
if(flag[i]>0)
return 1;
return 0;
}
void sjf_non()
{
int i,j,t,f,pc=0;
p pro;
m=max();
for(i=1;i<=m;i++)
{
rq[0][i]=-1;
rq[1][i]=-1;
buffer[0][i]=-1;
buffer[1][i]=-1;
buffx[i]=-1;
}
flagging();
push(arr[1][0],arr[1][2]);
clk=arr[1][1];
for(j=2;j<=n;j++)
if(arr[j][1]==clk)
push(arr[j][0],arr[j][2]);
pc++;
if(top>0)
{
pro.no=pop();
flag[pro.no]--;
pro.burst=z;
allex[clk]=pro.no;
}
clk++;
while(clk<=m+1)
{
for(j=2;j<=n;j++)
if(arr[j][1]==clk)
push(arr[j][0],arr[j][2]);
if(top>0)
for(i=1;i<=top;i++)
arr[rq[0][i]][5]++;
if(pro.burst>0)
{
pro.burst--;
allex[clk]=pro.no;
}
if(b>0)
{
for(i=b;i>=1;i--)
{
if(buffer[1][i]>0)
buffer[1][i]--;
if(buffer[1][i]==0)
{
f=popbuff();
push(f,arr[f][4]);
}
}
}
if(pro.burst==0)
{
int x=check();
if(top>0)
{
if(flag[pro.no]==2)
{
flag[pro.no]--;
pushbuff(pro.no);
}
if(flag[pro.no]==0)
{
arr[pro.no][7]=clk;
allex[clk]=pro.no;
}
if(flag[rq[0][top]]==3)
{
pro.no=pop();
flag[pro.no]--;
pro.burst=z;
allex[clk]=pro.no;
}
else if(flag[rq[0][top]]==1)
{
pro.no=pop();
if(arr[pro.no][4]==0)
pro.burst=arr[pro.no][2];
else
pro.burst=z;
flag[pro.no]--;
allex[clk]=pro.no;
}
if(x==0)
break;
}
else if(top<=0)
{
if(flag[pro.no]==2)
{
flag[pro.no]--;
pushbuff(pro.no);
allex[clk]=pro.no;
}
else if(flag[pro.no]==0)
{
arr[pro.no][7]=clk;
allex[clk]=pro.no;
}
else if(flag[pro.no]==1)
{
flag[pro.no]--;
allex[clk]=pro.no;
}
pro.no=0;
pro.burst=0;
allex[clk]=-4;
if(x==0)
break;
}
}
if(flag[rq[1]==0])
break;
clk++;
}
for(i=1;i<=n;i++)
arr[i][6]=arr[i][7]-arr[i][1];
display();
}
int main()
{
int i;
printf("\n");
for(i=0;i<=80;i++)
printf("-");
printf("\nEnter the number of processes: ");
scanf("%d",&n);
getdata();
sjf_non();
printf("\n");
for(i=0;i<=40;i++)
printf("-x");
printf("\n");
char key = getch();
if(key=='T' || key=='t')
exit(0);
return 0;
}
|
the_stack_data/182953171.c
|
#include <wchar.h>
int mbsinit(const mbstate_t *st)
{
return !st || !*(unsigned *)st;
}
|
the_stack_data/50138967.c
|
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
char str[1005];
while(scanf("%s",str)==1)
{
if(!strcmp(str,"0"))
break;
int lenth = strlen(str);
int numb = str[0]-'0',i;
if(lenth>1 && lenth % 2 == 0) numb = numb*10+str[1]-'0';
lenth = (lenth - 1)/2;
printf("%d",(int)sqrt(numb));
for(i=0;i<lenth;i++)
putchar('0');
puts("");
}
return 0;
}
|
the_stack_data/37637414.c
|
/*
* Copyright (C) 2015 Freie Universität Berlin
*
* This file is subject to the terms and conditions of the GNU Lesser
* General Public License v2.1. See the file LICENSE in the top level
* directory for more details.
*
*/
/*
* @ingroup sys_auto_init_saul
* @{
*
* @file
* @brief Auto initialization of GPIO pins directly mapped to SAUL reg
*
* @author Hauke Petersen <[email protected]>
*
* @}
*/
#ifdef MODULE_SAUL_GPIO
#include "log.h"
#include "saul_reg.h"
#include "saul/periph.h"
#include "gpio_params.h"
#include "periph/gpio.h"
#include "kernel_defines.h"
/**
* @brief Define the number of configured sensors
*/
#if defined(SAUL_GPIO_NUMOF) && !(SAUL_GPIO_NUMOF > 0)
void auto_init_gpio(void)
{
/* do nothing, no GPIO configured for SAUL */
LOG_DEBUG("[auto_init_saul] no SAUL GPIO configured!\n");
}
#else
#define SAUL_GPIO_NUMOF ARRAY_SIZE(saul_gpio_params)
/**
* @brief Memory for the registry entries
*/
static saul_reg_t saul_reg_entries[SAUL_GPIO_NUMOF];
/**
* @brief Reference the input mode driver struct
*/
extern saul_driver_t gpio_in_saul_driver;
/**
* @brief Reference to the output mode driver struct
*/
extern saul_driver_t gpio_out_saul_driver;
void auto_init_gpio(void)
{
for (unsigned int i = 0; i < SAUL_GPIO_NUMOF; i++) {
const saul_gpio_params_t *p = &saul_gpio_params[i];
LOG_DEBUG("[auto_init_saul] initializing GPIO #%u\n", i);
saul_reg_entries[i].dev = (void *)p;
saul_reg_entries[i].name = p->name;
if ((p->mode == GPIO_IN) || (p->mode == GPIO_IN_PD) ||
(p->mode == GPIO_IN_PU)) {
saul_reg_entries[i].driver = &gpio_in_saul_driver;
}
else {
saul_reg_entries[i].driver = &gpio_out_saul_driver;
}
/* initialize the GPIO pin */
gpio_init(p->pin, p->mode);
/* set initial pin state if configured */
if (p->flags & (SAUL_GPIO_INIT_CLEAR | SAUL_GPIO_INIT_SET)) {
phydat_t s;
s.val[0] = (p->flags & SAUL_GPIO_INIT_SET);
saul_reg_entries[i].driver->write(p, &s);
}
/* add to registry */
saul_reg_add(&(saul_reg_entries[i]));
}
}
#endif
#else
typedef int dont_be_pedantic;
#endif /* MODULE_SAUL_GPIO */
|
the_stack_data/198581082.c
|
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <stdio.h>
int main(void)
{
int t = 0;
for ((void)scanf("%d", &t); t > 0; --t) {
int ans = 0, n = 0, k = 0;
for ((void)scanf("%d", &n); n > 0; --n) {
(void)scanf("%d", &k);
ans ^= k;
}
printf("%d\n", ans);
}
return 0;
}
|
the_stack_data/283615.c
|
#include <unistd.h>
#include <stdio.h>
int main (void) {
pid_t p; /* fork returns type pid_t */
p = fork();
printf("fork returned %d\n", p);
while (1); // Infinite loop to keep the process alive
}
|
the_stack_data/92328116.c
|
#include <stdio.h>
int main(){
int n, i, resp;
scanf("%d", &n);
for(i=1; i<=10; i++){
resp = i * n;
printf("%d x %d = %d\n", i, n, resp);
}
return 0;
}
|
the_stack_data/181392041.c
|
//C program to display fibonacci series using function.
#include <stdio.h>
int fib(int n, int i);
int main()
{
int n1 = 0, n2 = 1, n, i, x;
printf("Enter no of terms:");
scanf("%d", &n);
printf("Fibonacci sequence is:");
printf("%d\t", n1);
printf("%d\t", n2);
x = fib(n, i);
printf("%d\t", x);
}
int fib(int n, int i)
{
int n1 = 0, n2 = 1, sum;
int t;
for (i = 1; i <= (n - 2); i++)
{
t = n1 + n2;
printf("%d\t", t);
n1 = n2;
n2 = t;
}
return t;
}
|
the_stack_data/179829884.c
|
/** @file
@ingroup test_src
@brief Hear the latency caused by big buffers.
Play a sine wave and change frequency based on letter input.
@author Phil Burk <[email protected]>, and Darren Gibbs
*/
/*
* $Id: patest_latency.c 1368 2008-03-01 00:38:27Z rossb $
*
* This program uses the PortAudio Portable Audio Library.
* For more information see: http://www.portaudio.com
* Copyright (c) 1999-2000 Ross Bencina and Phil Burk
*
* 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.
*/
/*
* The text above constitutes the entire PortAudio license; however,
* the PortAudio community also makes the following non-binding requests:
*
* Any person wishing to distribute modifications to the Software is
* requested to send the modifications to the original developer so that
* they can be incorporated into the canonical version. It is also
* requested that these non-binding requests be included along with the
* license above.
*/
#include <stdio.h>
#include <math.h>
#include "portaudio.h"
#define OUTPUT_DEVICE (Pa_GetDefaultOutputDevice())
#define SAMPLE_RATE (44100)
#define FRAMES_PER_BUFFER (64)
#define MIN_FREQ (100.0f)
#define CalcPhaseIncrement(freq) ((freq)/SAMPLE_RATE)
#ifndef M_PI
#define M_PI (3.14159265)
#endif
#define TABLE_SIZE (400)
typedef struct
{
float sine[TABLE_SIZE + 1]; /* add one for guard point for interpolation */
float phase_increment;
float left_phase;
float right_phase;
}
paTestData;
float LookupSine( paTestData *data, float phase );
/* Convert phase between and 1.0 to sine value
* using linear interpolation.
*/
float LookupSine( paTestData *data, float phase )
{
float fIndex = phase*TABLE_SIZE;
int index = (int) fIndex;
float fract = fIndex - index;
float lo = data->sine[index];
float hi = data->sine[index+1];
float val = lo + fract*(hi-lo);
return val;
}
/* This routine will be called by the PortAudio engine when audio is needed.
** It may called at interrupt level on some machines so don't do anything
** that could mess up the system like calling malloc() or free().
*/
static int patestCallback( const void *inputBuffer, void *outputBuffer,
unsigned long framesPerBuffer,
const PaStreamCallbackTimeInfo* timeInfo,
PaStreamCallbackFlags statusFlags,
void *userData )
{
paTestData *data = (paTestData*)userData;
float *out = (float*)outputBuffer;
int i;
(void) inputBuffer; /* Prevent unused variable warning. */
for( i=0; i<framesPerBuffer; i++ )
{
*out++ = LookupSine(data, data->left_phase); /* left */
*out++ = LookupSine(data, data->right_phase); /* right */
data->left_phase += data->phase_increment;
if( data->left_phase >= 1.0f ) data->left_phase -= 1.0f;
data->right_phase += (data->phase_increment * 1.5f); /* fifth above */
if( data->right_phase >= 1.0f ) data->right_phase -= 1.0f;
}
return 0;
}
/*******************************************************************/
int main(void);
int main(void)
{
PaStream *stream;
PaStreamParameters outputParameters;
PaError err;
paTestData data;
int i;
int done = 0;
printf("PortAudio Test: enter letter then hit ENTER.\n" );
/* initialise sinusoidal wavetable */
for( i=0; i<TABLE_SIZE; i++ )
{
data.sine[i] = 0.90f * (float) sin( ((double)i/(double)TABLE_SIZE) * M_PI * 2. );
}
data.sine[TABLE_SIZE] = data.sine[0]; /* set guard point. */
data.left_phase = data.right_phase = 0.0;
data.phase_increment = CalcPhaseIncrement(MIN_FREQ);
err = Pa_Initialize();
if( err != paNoError ) goto error;
printf("PortAudio Test: output device = %d\n", OUTPUT_DEVICE );
outputParameters.device = OUTPUT_DEVICE;
if (outputParameters.device == paNoDevice) {
fprintf(stderr,"Error: No default output device.\n");
goto error;
}
outputParameters.channelCount = 2; /* stereo output */
outputParameters.sampleFormat = paFloat32; /* 32 bit floating point output */
outputParameters.suggestedLatency = Pa_GetDeviceInfo( outputParameters.device )->defaultLowOutputLatency;
outputParameters.hostApiSpecificStreamInfo = NULL;
printf("Requested output latency = %.4f seconds.\n", outputParameters.suggestedLatency );
printf("%d frames per buffer.\n.", FRAMES_PER_BUFFER );
err = Pa_OpenStream(
&stream,
NULL, /* no input */
&outputParameters,
SAMPLE_RATE,
FRAMES_PER_BUFFER,
paClipOff|paDitherOff, /* we won't output out of range samples so don't bother clipping them */
patestCallback,
&data );
if( err != paNoError ) goto error;
err = Pa_StartStream( stream );
if( err != paNoError ) goto error;
printf("Play ASCII keyboard. Hit 'q' to stop. (Use RETURN key on Mac)\n");
fflush(stdout);
while ( !done )
{
float freq;
int index;
char c;
do
{
c = getchar();
}
while( c < ' '); /* Strip white space and control chars. */
if( c == 'q' ) done = 1;
index = c % 26;
freq = MIN_FREQ + (index * 40.0);
data.phase_increment = CalcPhaseIncrement(freq);
}
printf("Call Pa_StopStream()\n");
err = Pa_StopStream( stream );
if( err != paNoError ) goto error;
Pa_Terminate();
printf("Test finished.\n");
return err;
error:
Pa_Terminate();
fprintf( stderr, "An error occured while using the portaudio stream\n" );
fprintf( stderr, "Error number: %d\n", err );
fprintf( stderr, "Error message: %s\n", Pa_GetErrorText( err ) );
return err;
}
|
the_stack_data/11076251.c
|
#include <unistd.h>
int main()
{
int ret;
char c;
usleep(350 * 1000);
while ((ret = read(0, &c, 1)) > 0) {
usleep(35 * 1000);
if ((ret = write(1, &c, 1)) <= 0)
break;
}
return ret;
}
|
the_stack_data/20996.c
|
#include <stdio.h>
int f(int t)
{
int n = 0;
for (;;)
{
printf("%dつ目の整数を入力してください。＞", t);
scanf("%d", &n);
if (1 <= n && n <= 10)
{
return n;
}
else
{
scanf("%*[^\n]");
printf("1～10以外の数字が入力されました。\n");
}
}
return 0;
}
int main(void)
{
int n[2] = {};
printf("1～10までの整数を2つ入力してください。\n");
n[0] = f(1);
n[1] = f(2);
printf("和は「%d」です。\n", n[0] + n[1]);
printf("積は「%d」です。\n", n[0] * n[1]);
return 0;
}
|
the_stack_data/747293.c
|
/*
Operadores
*/
#include <stdio.h>
int dato = 5;
int main() {
printf("dato %i\n", dato);
printf("dato++ %i\n", dato ++);
printf("++dato %i\n", ++ dato);
printf("dato=dato+1%i\n", dato = dato + 1);
return 0;
}
|
the_stack_data/140665.c
|
int f(int a,int *y)
{
int x = a;
if (a==0)
return *y;
return f(a-1,&x);
}
int main(int argc,char **argv)
{
if (f (100, (int *) 0) != 1)
abort ();
exit (0);
}
|
the_stack_data/22013094.c
|
void io_hlt(void);
void write_mem8(int addr, int data);
void HariMain(void) {
int i;
char *p = (char *)0xa0000;
for (i = 0; i <= 0xaffff; i++) {
p[i] = i & 0x0f;
}
for (;;) {
// naskfunc.nas の _io_hlt() を実行
io_hlt();
}
}
|
the_stack_data/237644118.c
|
/*
Mehnaz Yunus, 22/02/18
*/
#include <stdio.h>
#include <limits.h>
#include <stdlib.h>
struct process {
int id;
int arrival;
int burst;
int comp;
int turn;
int rem;
int wait;
int priority;
};
int main(int argc, char const *argv[]) {
int i;
int n = atoi(argv[1]);
struct process p[n];
int k = 0;
for(i = 2; i <= argc-2; i += 4) {
p[k].id = atoi(argv[i]);
p[k].arrival = atoi(argv[i+1]);
p[k].burst = atoi(argv[i+2]);
p[k].priority = atoi(argv[i+3]);
k++;
}
for(i = 0; i < n; ++i)
p[i].rem = p[i].burst;
int done = 0;
int time = 0;
int minp = INT_MAX;
int cur = -1;
int found = 0;
while(done < n) {
for(i = 0; i < n; ++i)
if(p[i].rem && p[i].arrival <= time && i != cur)
p[i].priority--;
for(i = 0; i < n; ++i) {
if(p[i].arrival <= time && p[i].rem && p[i].priority < minp) {
minp = p[i].priority;
cur = i;
found = 1;
}
}
//if(cur != -1)
// printf("\nTime : %d Current : %d", time, p[cur].id);
if(!found) {
time++;
continue;
}
p[cur].rem--;
if(p[cur].rem == 0) {
p[cur].comp = time+1;
p[cur].turn = p[cur].comp - p[cur].arrival;
p[cur].wait = p[cur].turn - p[cur].burst;
done++;
minp = INT_MAX;
found = 0;
}
time++;
}
int tturn = 0, twait = 0;
for(i = 0; i < n; ++i) {
tturn += p[i].turn;
twait += p[i].wait;
printf("%d\t%d\t%d\t%d\t%d\t%d\n", p[i].id, p[i].burst, p[i].arrival, p[i].wait, p[i].turn, p[i].comp);
}
printf("%.2f\n%.2f", (float)twait/n, (float)tturn/n);
return 0;
}
|
the_stack_data/697222.c
|
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
//线程函数
void *test(void *ptr)
{
int i;
for(i=0;i<8;i++)
{
printf("the pthread running ,count: %d\n",i);
sleep(1);
}
}
int main(void)
{
pthread_t pId;
int i,ret;
//创建子线程，线程id为pId
ret = pthread_create(&pId,NULL,test,NULL);
if(ret != 0)
{
printf("create pthread error!\n");
exit(1);
}
for(i=0;i < 5;i++)
{
printf("main thread running ,count : %d\n",i);
sleep(1);
}
printf("main thread will exit when pthread is over\n");
//等待线程pId的完成
pthread_join(pId,NULL);
printf("main thread exit\n");
return 0;
}
|
the_stack_data/90098.c
|
#include<stdio.h>
#include<string.h>
#include<math.h>
int ninputs;
int dfa[100][2][100] = {0};
int state[10000] = {0};
char ch[10], str[1000];
int go[10000][2] = {0};
int arr[10000] = {0};
int main()
{
int st, fin, in;
int f[10];
int i,j=3,s=0,final=0,flag=0,curr1,curr2,k,l;
int c;
printf("\nFollow the one based indexing\n");
printf("\nEnter the number of states::");
scanf("%d",&st);
printf("\nGive state numbers from 0 to %d",st-1);
for(i=0;i<st;i++)
state[(int)(pow(2,i))] = 1;
printf("\nEnter number of final states\t");
scanf("%d",&fin);
printf("\nEnter final states::");
for(i=0;i<fin;i++)
{
scanf("%d",&f[i]);
}
int p,q,r,rel;
printf("\nEnter the number of rules according to NFA::");
scanf("%d",&rel);
printf("\n\nDefine transition rule as \"initial state<space>input symbol<space>final state\"\n");
for(i=0; i<rel; i++)
{
scanf("%d %d %d",&p,&q,&r);
dfa[p][q][r] = 1;
}
printf("\nEnter initial state::");
scanf("%d",&in);
in = pow(2,in);
i=0;
printf("\nSolving according to DFA");
int x=0;
for(i=0;i<st;i++)
{
for(j=0;j<2;j++)
{
int stf=0;
for(k=0;k<st;k++)
{
if(dfa[i][j][k]==1)
stf = stf + pow(2,k);
}
go[(int)(pow(2,i))][j] = stf;
printf("gp[%d][%d]-->%d\n",(int)(pow(2,i)),j,stf);
if(state[stf]==0)
arr[x++] = stf;
state[stf] = 1;
}
}
//for new states
for(i=0;i<x;i++)
{
// printf("for new state %d ---- ",arr[i]);
for(j=0;j<2;j++)
{
int new=0;
for(k=0;k<st;k++)
{
if(arr[i] & (1<<k))
{
int h = pow(2,k);
if(new==0)
new = go[h][j];
new = new | (go[h][j]);
go[arr[i]][j] = new;
}
}
if(state[new]==0)
{
arr[x++] = new;
state[new] = 1;
}
}
}
printf("\nThe total number of distinct states are::\n");
printf("STATE\t\t0\t1\n");
for(i=0;i<10000;i++)
{
int x =0;
if(state[i]==1)
{
int y=0;
if(i==0)
continue;
else
for(j=0;j<st;j++)
{
x = 1<<j;
if(i&x)
{
printf("q%d ",j);
y = y+pow(2,j);
}
}
printf("\t\t");
for(j=0;j<st;j++)
{
x = 1<<j;
if(x& (go[y ][0]))
{
printf("q%d ",j);
}
}
printf("\t");
for(j=0;j<st;j++)
{
x = 1<<j;
if(x& (go[y][1]))
{
printf("q%d ",j);
}
};
printf("\n");
}
}
return 0;
}
|
the_stack_data/100139729.c
|
/**
******************************************************************************
* @file stm32l0xx_ll_crs.h
* @author MCD Application Team
* @version V1.8.0
* @date 25-November-2016
* @brief CRS LL module driver.
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT(c) 2016 STMicroelectronics</center></h2>
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
*/
#if defined(USE_FULL_LL_DRIVER)
/* Includes ------------------------------------------------------------------*/
#include "stm32l0xx_ll_crs.h"
#include "stm32l0xx_ll_bus.h"
/** @addtogroup STM32L0xx_LL_Driver
* @{
*/
#if defined(CRS)
/** @defgroup CRS_LL CRS
* @{
*/
/* Private types -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private constants ---------------------------------------------------------*/
/* Private macros ------------------------------------------------------------*/
/* Private function prototypes -----------------------------------------------*/
/* Exported functions --------------------------------------------------------*/
/** @addtogroup CRS_LL_Exported_Functions
* @{
*/
/** @addtogroup CRS_LL_EF_Init
* @{
*/
/**
* @brief De-Initializes CRS peripheral registers to their default reset values.
* @retval An ErrorStatus enumeration value:
* - SUCCESS: CRS registers are de-initialized
* - ERROR: not applicable
*/
ErrorStatus LL_CRS_DeInit(void)
{
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_CRS);
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_CRS);
return SUCCESS;
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
#endif /* defined(CRS) */
/**
* @}
*/
#endif /* USE_FULL_LL_DRIVER */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
the_stack_data/71656.c
|
//make directory
#include<stdio.h>
#include<unistd.h>
#include<string.h>
#include<sys/stat.h>
#include<stdlib.h>
#include<fcntl.h>
#include<sys/types.h>
#include<sys/ioctl.h>
#include<dirent.h>
|
the_stack_data/56110.c
|
/*
* Operators in C.
*/
#include <stdio.h>
void arithmetic_operators() {
// Spaces are optional.
int a = 3 + 2;
int b = 3 - 2;
int c = 3*2;
int e = 3/2;
int f = 3 % 2;
}
void increment_decrement_operators() {
int a = 1;
int b = 2;
a++;
b--;
printf("%d\n", a);
printf("%d\n", b);
// Store value after the action by using the opereator after
// the variable, otherwise store value before the action by including it
// before the variable.
a = 9;
b = a++ + 5;
// => a=10 b=14
a = 3;
b = ++a +6;
// => a=4 b = 9
}
void relational_operators(){
// See:
// https://www.tutorialspoint.com/cprogramming/c_relational_operators.htm
// There is no boolean type in C, but true evaluates as 1 and false as 0.
int a = 21;
int b = 10;
int c;
if (a > b) {
c = 1;
}
else {
c = 0;
}
// Equivalent to above.
int d = (a > b);
// Ternary operator where true and false values can be defined.
int e = (a > b) ? 20 : 30;
// Check equal to.
if(a == b) {
printf("Line 1 - a is equal to b\n" );
} else {
printf("Line 1 - a is not equal to b\n" );
}
// Check not equal to.
if(a != b) {
printf("Line 1 - a is equal to b\n" );
} else {
printf("Line 1 - a is not equal to b\n" );
}
// Check less than.
if (a < b) {
printf("Line 2 - a is less than b\n" );
} else {
printf("Line 2 - a is not less than b\n" );
}
// Check greater than or equal to.
if (a >= b) {
printf("Line 3 - a is greater than b\n" );
} else {
printf("Line 3 - a is not greater than b\n" );
}
}
void logic_operators() {
int a = 21;
int b = 10;
// AND
if((a >= b) && (a == 21)) {
printf("Line 1 - a is greater b and a equal to 21\n" );
} else {
printf("Line 1 - a is not greater b or a not equal to 2\n" );
}
// OR
if((a >= b) || (a == 21)) {
printf("Line 1 - a is greater b or a is equal to 21\n" );
} else {
printf("Line 1 - a is not greater a or b is equal to 2\n" );
}
}
void casting_operators() {
int sum = 100;
(float) sum;
(int) sum;
}
void bitwise_operators() {
/*
* See:
* https://www.tutorialspoint.com/cprogramming/c_operators.htm
*
* ~ one's complement
* & bitwise AND
* | bitwise OR
* ^ bitwise XOR
* << left shift (binary multiply by 2)
* >> right shift (binary divide by 2)
*/
int A = ~2;
int B = 60 & 13;
int C = 60 | 13;
int D = 60 ^ 13;
int E = 60 << 13;
float F = 60 >> 13;
}
void assignment_operators() {
int assign = 1;
assign += 1;
assign -= 1;
assign *= 10;
assign /= 10;
assign %= 10;
assign >>= 1;
assign <<= 1;
assign &= 1;
assign |= 1;
assign ^= 1;
}
void main() {
arithmetic_operators();
increment_decrement_operators();
relational_operators();
logic_operators();
casting_operators();
bitwise_operators();
assignment_operators();
}
|
the_stack_data/1226853.c
|
/*
* Copyright (c) 2010, The Android Open Source Project
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google, Inc. nor the names of its contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <libgen.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <pwd.h>
#include <sys/stat.h>
#define BUF_MAX 1024
#define CMD_DISPLAY_MAX (9 + 1)
#define USER_DISPLAY_MAX (10 + 1)
struct pid_info_t {
pid_t pid;
char user[USER_DISPLAY_MAX];
char cmdline[CMD_DISPLAY_MAX];
char path[PATH_MAX];
ssize_t parent_length;
};
static void print_header()
{
printf("%-9s %5s %10s %4s %9s %18s %9s %10s %s\n",
"COMMAND",
"PID",
"USER",
"FD",
"TYPE",
"DEVICE",
"SIZE/OFF",
"NODE",
"NAME");
}
static void print_type(char *type, struct pid_info_t* info)
{
static ssize_t link_dest_size;
static char link_dest[PATH_MAX];
strlcat(info->path, type, sizeof(info->path));
if ((link_dest_size = readlink(info->path, link_dest, sizeof(link_dest)-1)) < 0) {
if (errno == ENOENT)
goto out;
snprintf(link_dest, sizeof(link_dest), "%s (readlink: %s)", info->path, strerror(errno));
} else {
link_dest[link_dest_size] = '\0';
}
// Things that are just the root filesystem are uninteresting (we already know)
if (!strcmp(link_dest, "/"))
goto out;
printf("%-9s %5d %10s %4s %9s %18s %9s %10s %s\n",
info->cmdline, info->pid, info->user, type,
"???", "???", "???", "???", link_dest);
out:
info->path[info->parent_length] = '\0';
}
// Prints out all file that have been memory mapped
static void print_maps(struct pid_info_t* info)
{
FILE *maps;
size_t offset;
char device[10];
long int inode;
char file[1024];
strlcat(info->path, "maps", sizeof(info->path));
maps = fopen(info->path, "r");
if (!maps)
goto out;
while (fscanf(maps, "%*x-%*x %*s %zx %5s %ld %1023s\n",
&offset, device, &inode, file) == 4) {
// We don't care about non-file maps
if (inode == 0 || !strcmp(device, "00:00"))
continue;
printf("%-9s %5d %10s %4s %9s %18s %9zd %10ld %s\n",
info->cmdline, info->pid, info->user, "mem",
"???", device, offset, inode, file);
}
fclose(maps);
out:
info->path[info->parent_length] = '\0';
}
// Prints out all open file descriptors
static void print_fds(struct pid_info_t* info)
{
static char* fd_path = "fd/";
strlcat(info->path, fd_path, sizeof(info->path));
int previous_length = info->parent_length;
info->parent_length += strlen(fd_path);
DIR *dir = opendir(info->path);
if (dir == NULL) {
char msg[BUF_MAX];
snprintf(msg, sizeof(msg), "%s (opendir: %s)", info->path, strerror(errno));
printf("%-9s %5d %10s %4s %9s %18s %9s %10s %s\n",
info->cmdline, info->pid, info->user, "FDS",
"", "", "", "", msg);
goto out;
}
struct dirent* de;
while ((de = readdir(dir))) {
if (!strcmp(de->d_name, ".") || !strcmp(de->d_name, ".."))
continue;
print_type(de->d_name, info);
}
closedir(dir);
out:
info->parent_length = previous_length;
info->path[info->parent_length] = '\0';
}
static void lsof_dumpinfo(pid_t pid)
{
int fd;
struct pid_info_t info;
struct stat pidstat;
struct passwd *pw;
info.pid = pid;
snprintf(info.path, sizeof(info.path), "/proc/%d/", pid);
info.parent_length = strlen(info.path);
// Get the UID by calling stat on the proc/pid directory.
if (!stat(info.path, &pidstat)) {
pw = getpwuid(pidstat.st_uid);
if (pw) {
strlcpy(info.user, pw->pw_name, sizeof(info.user));
} else {
snprintf(info.user, USER_DISPLAY_MAX, "%d", (int)pidstat.st_uid);
}
} else {
strcpy(info.user, "???");
}
// Read the command line information; each argument is terminated with NULL.
strlcat(info.path, "cmdline", sizeof(info.path));
fd = open(info.path, O_RDONLY);
if (fd < 0) {
fprintf(stderr, "Couldn't read %s\n", info.path);
return;
}
char cmdline[PATH_MAX];
int numRead = read(fd, cmdline, sizeof(cmdline) - 1);
close(fd);
if (numRead < 0) {
fprintf(stderr, "Error reading cmdline: %s: %s\n", info.path, strerror(errno));
return;
}
cmdline[numRead] = '\0';
// We only want the basename of the cmdline
strlcpy(info.cmdline, basename(cmdline), sizeof(info.cmdline));
// Read each of these symlinks
print_type("cwd", &info);
print_type("exe", &info);
print_type("root", &info);
print_fds(&info);
print_maps(&info);
}
int lsof_main(int argc, char *argv[])
{
long int pid = 0;
char* endptr;
if (argc == 2) {
pid = strtol(argv[1], &endptr, 10);
}
print_header();
if (pid) {
lsof_dumpinfo(pid);
} else {
DIR *dir = opendir("/proc");
if (dir == NULL) {
fprintf(stderr, "Couldn't open /proc\n");
return -1;
}
struct dirent* de;
while ((de = readdir(dir))) {
if (!strcmp(de->d_name, ".") || !strcmp(de->d_name, ".."))
continue;
// Only inspect directories that are PID numbers
pid = strtol(de->d_name, &endptr, 10);
if (*endptr != '\0')
continue;
lsof_dumpinfo(pid);
}
closedir(dir);
}
return 0;
}
|
the_stack_data/943780.c
|
/* $OpenBSD: ahc_eisa.c,v 1.8 1999/01/11 01:57:59 millert Exp $ */
/* $NetBSD: ahc_eisa.c,v 1.10 1996/10/21 22:30:58 thorpej Exp $ */
/*
* Product specific probe and attach routines for:
* 27/284X and aic7770 motherboard SCSI controllers
*
* Copyright (c) 1994, 1995, 1996 Justin T. Gibbs.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: ahc_eisa.c,v 1.8 1999/01/11 01:57:59 millert Exp $
*/
#if defined(__FreeBSD__)
#include <eisa.h>
#endif
#if NEISA > 0 || defined(__NetBSD__) || defined(__OpenBSD__)
#include <sys/param.h>
#include <sys/systm.h>
#if defined(__FreeBSD__)
#include <sys/devconf.h>
#endif
#include <sys/kernel.h>
#if defined(__NetBSD__) || defined(__OpenBSD__)
#include <sys/device.h>
#include <machine/bus.h>
#include <machine/intr.h>
#endif /* defined(__NetBSD__) || defined(__OpenBSD__) */
#include <scsi/scsi_all.h>
#include <scsi/scsiconf.h>
#if defined(__FreeBSD__)
#include <machine/clock.h>
#include <i386/eisa/eisaconf.h>
#include <i386/scsi/aic7xxx.h>
#include <dev/aic7xxx/aic7xxx_reg.h>
#define EISA_DEVICE_ID_ADAPTEC_AIC7770 0x04907770
#define EISA_DEVICE_ID_ADAPTEC_274x 0x04907771
#define EISA_DEVICE_ID_ADAPTEC_284xB 0x04907756 /* BIOS enabled */
#define EISA_DEVICE_ID_ADAPTEC_284x 0x04907757 /* BIOS disabled*/
#elif defined(__NetBSD__) || defined(__OpenBSD__)
#include <dev/eisa/eisareg.h>
#include <dev/eisa/eisavar.h>
#include <dev/eisa/eisadevs.h>
#include <dev/ic/aic7xxxreg.h>
#include <dev/ic/aic7xxxvar.h>
#endif /* defined(__NetBSD__) */
#define AHC_EISA_SLOT_OFFSET 0xc00
#define AHC_EISA_IOSIZE 0x100
#define INTDEF 0x5cul /* Interrupt Definition Register */
#if defined(__FreeBSD__)
static int aic7770probe __P((void));
static int aic7770_attach __P((struct eisa_device *e_dev));
static struct eisa_driver ahc_eisa_driver = {
"ahc",
aic7770probe,
aic7770_attach,
/*shutdown*/NULL,
&ahc_unit
};
DATA_SET (eisadriver_set, ahc_eisa_driver);
static struct kern_devconf kdc_aic7770 = {
0, 0, 0, /* filled in by dev_attach */
"ahc", 0, { MDDT_EISA, 0, "bio" },
eisa_generic_externalize, 0, 0, EISA_EXTERNALLEN,
&kdc_eisa0, /* parent */
0, /* parentdata */
DC_UNCONFIGURED, /* always start out here */
NULL,
DC_CLS_MISC /* host adapters aren't special */
};
static char *aic7770_match __P((eisa_id_t type));
static char*
aic7770_match(type)
eisa_id_t type;
{
switch(type) {
case EISA_DEVICE_ID_ADAPTEC_AIC7770:
return ("Adaptec aic7770 SCSI host adapter");
break;
case EISA_DEVICE_ID_ADAPTEC_274x:
return ("Adaptec 274X SCSI host adapter");
break;
case EISA_DEVICE_ID_ADAPTEC_284xB:
case EISA_DEVICE_ID_ADAPTEC_284x:
return ("Adaptec 284X SCSI host adapter");
break;
default:
break;
}
return (NULL);
}
static int
aic7770probe(void)
{
u_long iobase;
char intdef;
u_long irq;
struct eisa_device *e_dev = NULL;
int count;
count = 0;
while ((e_dev = eisa_match_dev(e_dev, aic7770_match))) {
iobase = (e_dev->ioconf.slot * EISA_SLOT_SIZE)
+ AHC_EISA_SLOT_OFFSET;
ahc_reset(iobase);
eisa_add_iospace(e_dev, iobase, AHC_EISA_IOSIZE, RESVADDR_NONE);
intdef = inb(INTDEF + iobase);
switch (intdef & 0xf) {
case 9:
irq = 9;
break;
case 10:
irq = 10;
break;
case 11:
irq = 11;
break;
case 12:
irq = 12;
break;
case 14:
irq = 14;
break;
case 15:
irq = 15;
break;
default:
printf("aic7770 at slot %d: illegal "
"irq setting %d\n", e_dev->ioconf.slot,
intdef);
continue;
}
eisa_add_intr(e_dev, irq);
eisa_registerdev(e_dev, &ahc_eisa_driver, &kdc_aic7770);
if(e_dev->id == EISA_DEVICE_ID_ADAPTEC_284xB
|| e_dev->id == EISA_DEVICE_ID_ADAPTEC_284x) {
/* Our real parent is the isa bus. Say so. */
e_dev->kdc->kdc_parent = &kdc_isa0;
}
count++;
}
return count;
}
#elif defined(__NetBSD__) || defined(__OpenBSD__)
/*
* Under normal circumstances, these messages are unnecessary
* and not terribly cosmetic.
*/
#ifdef DEBUG
#define bootverbose 1
#else
#define bootverbose 0
#endif
int ahc_eisa_irq __P((bus_space_tag_t, bus_space_handle_t));
int ahc_eisa_match __P((struct device *, void *, void *));
void ahc_eisa_attach __P((struct device *, struct device *, void *));
struct cfattach ahc_eisa_ca = {
sizeof(struct ahc_data), ahc_eisa_match, ahc_eisa_attach
};
/*
* Return irq setting of the board, otherwise -1.
*/
int
ahc_eisa_irq(iot, ioh)
bus_space_tag_t iot;
bus_space_handle_t ioh;
{
int irq;
u_char intdef;
ahc_reset("ahc_eisa", iot, ioh);
intdef = bus_space_read_1(iot, ioh, INTDEF);
switch (irq = (intdef & 0xf)) {
case 9:
case 10:
case 11:
case 12:
case 14:
case 15:
break;
default:
printf("ahc_eisa_irq: illegal irq setting %d\n", intdef);
return -1;
}
/* Note that we are going and return (to probe) */
return irq;
}
/*
* Check the slots looking for a board we recognise
* If we find one, note it's address (slot) and call
* the actual probe routine to check it out.
*/
int
ahc_eisa_match(parent, match, aux)
struct device *parent;
void *match, *aux;
{
struct eisa_attach_args *ea = aux;
bus_space_tag_t iot = ea->ea_iot;
bus_space_handle_t ioh;
int irq;
/* must match one of our known ID strings */
if (strcmp(ea->ea_idstring, "ADP7770") &&
strcmp(ea->ea_idstring, "ADP7771")
#if 0
&& strcmp(ea->ea_idstring, "ADP7756") /* not EISA, but VL */
&& strcmp(ea->ea_idstring, "ADP7757") /* not EISA, but VL */
#endif
)
return (0);
if (bus_space_map(iot, EISA_SLOT_ADDR(ea->ea_slot) +
AHC_EISA_SLOT_OFFSET, AHC_EISA_IOSIZE, 0, &ioh))
return (0);
irq = ahc_eisa_irq(iot, ioh);
bus_space_unmap(iot, ioh, AHC_EISA_IOSIZE);
return (irq >= 0);
}
#endif /* defined(__NetBSD__) */
#if defined(__FreeBSD__)
static int
aic7770_attach(e_dev)
struct eisa_device *e_dev;
#elif defined(__NetBSD__) || defined(__OpenBSD__)
void
ahc_eisa_attach(parent, self, aux)
struct device *parent, *self;
void *aux;
#endif
{
ahc_type type;
#if defined(__FreeBSD__)
struct ahc_data *ahc;
resvaddr_t *iospace;
int unit = e_dev->unit;
int irq = ffs(e_dev->ioconf.irq) - 1;
iospace = e_dev->ioconf.ioaddrs.lh_first;
if(!iospace)
return -1;
switch(e_dev->id) {
case EISA_DEVICE_ID_ADAPTEC_AIC7770:
type = AHC_AIC7770;
break;
case EISA_DEVICE_ID_ADAPTEC_274x:
type = AHC_274;
break;
case EISA_DEVICE_ID_ADAPTEC_284xB:
case EISA_DEVICE_ID_ADAPTEC_284x:
type = AHC_284;
break;
default:
printf("aic7770_attach: Unknown device type!\n");
return -1;
break;
}
if(!(ahc = ahc_alloc(unit, iospace->addr, type, AHC_FNONE)))
return -1;
eisa_reg_start(e_dev);
if(eisa_reg_iospace(e_dev, iospace)) {
ahc_free(ahc);
return -1;
}
/*
* The IRQMS bit enables level sensitive interrupts. Only allow
* IRQ sharing if it's set.
*/
if(eisa_reg_intr(e_dev, irq, ahc_intr, (void *)ahc, &bio_imask,
/*shared ==*/ahc->pause & IRQMS)) {
ahc_free(ahc);
return -1;
}
eisa_reg_end(e_dev);
#elif defined(__NetBSD__) || defined(__OpenBSD__)
struct ahc_data *ahc = (void *)self;
struct eisa_attach_args *ea = aux;
bus_space_tag_t iot = ea->ea_iot;
bus_space_handle_t ioh;
int irq;
eisa_chipset_tag_t ec = ea->ea_ec;
eisa_intr_handle_t ih;
const char *model, *intrstr;
if (bus_space_map(iot, EISA_SLOT_ADDR(ea->ea_slot) +
AHC_EISA_SLOT_OFFSET, AHC_EISA_IOSIZE, 0, &ioh))
panic("ahc_eisa_attach: could not map I/O addresses");
if ((irq = ahc_eisa_irq(iot, ioh)) < 0)
panic("ahc_eisa_attach: ahc_eisa_irq failed!");
if (strcmp(ea->ea_idstring, "ADP7770") == 0) {
model = EISA_PRODUCT_ADP7770;
type = AHC_AIC7770;
} else if (strcmp(ea->ea_idstring, "ADP7771") == 0) {
model = EISA_PRODUCT_ADP7771;
type = AHC_274;
#if 0
} else if (strcmp(ea->ea_idstring, "ADP7756") == 0) {
model = EISA_PRODUCT_ADP7756;
type = AHC_284;
} else if (strcmp(ea->ea_idstring, "ADP7757") == 0) {
model = EISA_PRODUCT_ADP7757;
type = AHC_284;
#endif
} else {
panic("ahc_eisa_attach: Unknown device type %s",
ea->ea_idstring);
}
printf(": %s\n", model);
ahc_construct(ahc, iot, ioh, type, AHC_FNONE);
if (eisa_intr_map(ec, irq, &ih)) {
printf("%s: couldn't map interrupt (%d)\n",
ahc->sc_dev.dv_xname, irq);
return;
}
#endif /* defined(__NetBSD__) */
/*
* Tell the user what type of interrupts we're using.
* usefull for debugging irq problems
*/
if(bootverbose) {
printf("%s: Using %s Interrupts\n",
ahc_name(ahc),
ahc->pause & IRQMS ? "Level Sensitive" : "Edge Triggered");
}
/*
* Now that we know we own the resources we need, do the
* card initialization.
*
* First, the aic7770 card specific setup.
*/
switch( ahc->type ) {
case AHC_AIC7770:
case AHC_274:
{
u_char biosctrl = AHC_INB(ahc, HA_274_BIOSCTRL);
/* Get the primary channel information */
ahc->flags |= (biosctrl & CHANNEL_B_PRIMARY);
if((biosctrl & BIOSMODE) == BIOSDISABLED)
ahc->flags |= AHC_USEDEFAULTS;
break;
}
case AHC_284:
{
/* XXX
* All values are automagically intialized at
* POST for these cards, so we can always rely
* on the Scratch Ram values. However, we should
* read the SEEPROM here (Dan has the code to do
* it) so we can say what kind of translation the
* BIOS is using. Printing out the geometry could
* save a lot of users the grief of failed installs.
*/
break;
}
default:
break;
}
/*
* See if we have a Rev E or higher aic7770. Anything below a
* Rev E will have a R/O autoflush disable configuration bit.
* It's still not clear exactly what is differenent about the Rev E.
* We think it allows 8 bit entries in the QOUTFIFO to support
* "paging" SCBs so you can have more than 4 commands active at
* once.
*/
{
char *id_string;
u_char sblkctl;
u_char sblkctl_orig;
sblkctl_orig = AHC_INB(ahc, SBLKCTL);
sblkctl = sblkctl_orig ^ AUTOFLUSHDIS;
AHC_OUTB(ahc, SBLKCTL, sblkctl);
sblkctl = AHC_INB(ahc, SBLKCTL);
if(sblkctl != sblkctl_orig)
{
id_string = "aic7770 >= Rev E, ";
/*
* Ensure autoflush is enabled
*/
sblkctl &= ~AUTOFLUSHDIS;
AHC_OUTB(ahc, SBLKCTL, sblkctl);
/* Allow paging on this adapter */
ahc->flags |= AHC_PAGESCBS;
}
else
id_string = "aic7770 <= Rev C, ";
printf("%s: %s", ahc_name(ahc), id_string);
}
/* Setup the FIFO threshold and the bus off time */
{
u_char hostconf = AHC_INB(ahc, HOSTCONF);
AHC_OUTB(ahc, BUSSPD, hostconf & DFTHRSH);
AHC_OUTB(ahc, BUSTIME, (hostconf << 2) & BOFF);
}
/*
* Generic aic7xxx initialization.
*/
if(ahc_init(ahc)){
#if defined(__FreeBSD__)
ahc_free(ahc);
/*
* The board's IRQ line is not yet enabled so it's safe
* to release the irq.
*/
eisa_release_intr(e_dev, irq, ahc_intr);
return -1;
#elif defined(__NetBSD__) || defined(__OpenBSD__)
ahc_free(ahc);
return;
#endif
}
/*
* Enable the board's BUS drivers
*/
AHC_OUTB(ahc, BCTL, ENABLE);
#if defined(__FreeBSD__)
/*
* Enable our interrupt handler.
*/
if(eisa_enable_intr(e_dev, irq)) {
ahc_free(ahc);
eisa_release_intr(e_dev, irq, ahc_intr);
return -1;
}
e_dev->kdc->kdc_state = DC_BUSY; /* host adapters always busy */
#elif defined(__NetBSD__) || defined(__OpenBSD__)
intrstr = eisa_intr_string(ec, ih);
/*
* The IRQMS bit enables level sensitive interrupts only allow
* IRQ sharing if its set.
*/
ahc->sc_ih = eisa_intr_establish(ec, ih,
ahc->pause & IRQMS ? IST_LEVEL : IST_EDGE, IPL_BIO, ahc_intr, ahc
#ifdef __OpenBSD__
, ahc->sc_dev.dv_xname
#endif
);
if (ahc->sc_ih == NULL) {
printf("%s: couldn't establish interrupt",
ahc->sc_dev.dv_xname);
if (intrstr != NULL)
printf(" at %s", intrstr);
printf("\n");
ahc_free(ahc);
return;
}
if (intrstr != NULL)
printf("%s: interrupting at %s\n", ahc->sc_dev.dv_xname,
intrstr);
#endif /* defined(__NetBSD__) */
/* Attach sub-devices - always succeeds */
ahc_attach(ahc);
#if defined(__FreeBSD__)
return 0;
#endif
}
#endif /* NEISA > 0 */
|
the_stack_data/57298.c
|
/* Taxonomy Classification: 0000000100000152000210 */
/*
* WRITE/READ 0 write
* WHICH BOUND 0 upper
* DATA TYPE 0 char
* MEMORY LOCATION 0 stack
* SCOPE 0 same
* CONTAINER 0 no
* POINTER 0 no
* INDEX COMPLEXITY 1 variable
* ADDRESS COMPLEXITY 0 constant
* LENGTH COMPLEXITY 0 N/A
* ADDRESS ALIAS 0 none
* INDEX ALIAS 0 none
* LOCAL CONTROL FLOW 0 none
* SECONDARY CONTROL FLOW 1 if
* LOOP STRUCTURE 5 non-standard do-while
* LOOP COMPLEXITY 2 one
* ASYNCHRONY 0 no
* TAINT 0 no
* RUNTIME ENV. DEPENDENCE 0 no
* MAGNITUDE 2 8 bytes
* CONTINUOUS/DISCRETE 1 continuous
* SIGNEDNESS 0 no
*/
/*
Copyright 2005 Massachusetts Institute of Technology
All rights reserved.
Redistribution and use of software in source and binary forms, with or without
modification, are permitted provided that the following conditions are met.
- Redistributions of source code must retain the above copyright notice,
this set of conditions and the disclaimer below.
- Redistributions in binary form must reproduce the copyright notice, this
set of conditions, and the disclaimer below in the documentation and/or
other materials provided with the distribution.
- Neither the name of the Massachusetts Institute of Technology nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS".
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
int main(int argc, char *argv[])
{
int test_value;
int loop_counter;
char buf[10];
test_value = 17;
loop_counter = 0;
do
{
/* BAD */
buf[loop_counter] = 'A';
loop_counter++;
if (loop_counter > test_value) break;
}
while(1);
return 0;
}
|
the_stack_data/91310.c
|
#include <stdlib.h>
/*@ requires \valid(x);
@ requires *x >= 0;
@ ensures \result == *x + 1;
@
*/
int add(int * x)
{
return *x + 1;
}
/*@ requires \valid(x + (0 .. 2));
@ requires x[1] >= 0;
@ ensures x[1] == \result - 1;
@ ensures \valid(x + (0 .. 2));
@*/
int incr(int * x)
{
int * y;
int ret;
y = (int*)malloc(sizeof(int));
*y = x[1];
ret = add(&x[1]);
free(y);
return ret;
}
int main() {
incr((void *)-1);
return 0;
}
|
the_stack_data/98574899.c
|
/*******************************************************************************
*
* Produce an ASCII conversion table (printable characters only, tabs &
* newlines ommitted, from 32 onward).
*
******************************************************************************/
#include <stdio.h>
int main(void) {
printf("This is an ASCII table, the decimal value is on the left, the \
character is on the right.\n");
for (int i = 32; i < 127; i++) { // i will be 127 at the end
printf("%3d: ", i);
putchar(i);
putchar('\n');
}
}
|
the_stack_data/206393156.c
|
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define N 50
typedef struct{
int top;
char vet[N];
} stack;
typedef struct{
int head;
int tail;
char vet[N];
} queue;
void newQueue(queue *q);
void enqueue(queue *q, char value);
char dequeue(queue *q);
int isEmpty(queue *q);
int isFull(queue *q);
void showQueue(queue *q);
void inverte(queue *q);
void newStack(stack *s);
int isStackEmpty(stack *s);
int isStackFull(stack *s);
void push(stack *s, char value);
char pop(stack *s);
char top(stack *s);
int main(){
int i;
queue q;
stack s;
char texto[N], aux;
newStack(&s);
newQueue(&q);
printf("Informe a sequencia: ");
scanf("%s", texto);
for (i=0; i < strlen(texto); i++){
aux = texto[i];
if (aux >= '0' && aux <= '9'){
push(&s, aux);
aux = '9';
}
enqueue(&q, aux);
}
printf("\n\n%s -> ", texto);
while (!isEmpty(&q)){
aux = dequeue(&q);
if (aux == '9') {
printf("%c", pop(&s));
} else {
printf("%c", aux);
}
}
printf("\n");
}
void newStack(stack *s){
s->top = 0;
}
int isStackEmpty(stack *s){
return s->top == 0;
}
int isStackFull(stack *s){
return s->top == N;
}
void push(stack *s, char value){
if (isStackFull(s)) {
printf("Stack overflow!\n");
exit(1);
}
s->vet[s->top++] = value;
}
char pop(stack *s) {
if (isStackEmpty(s)) {
printf("Stack underflow!\n");
exit(1);
}
s->top--;
return s->vet[s->top];
}
char top(stack *s) {
if (isStackEmpty(s)) {
printf("Stack underflow!\n");
exit(1);
}
return s->vet[s->top - 1];
}
void newQueue(queue *q) {
q->head = 0;
q->tail = 0;
}
int isEmpty(queue *q) {
return q->head == q->tail;
}
int isFull(queue *q) {
return q->tail - q->head == N;
}
void enqueue(queue *q, char value) {
if (isFull(q)) {
printf("Queue overflow!\n");
exit(1);
}
q->vet[q->tail++ % N] = value;
}
char dequeue(queue *q) {
if (isEmpty(q)) {
printf("Queue underflow!\n");
exit(1);
}
return q->vet[q->head++ % N];
}
void showQueue(queue *q) {
int i;
printf("Queue: ");
for (i=q->head; i<q->tail; i++) {
printf("%d ", q->vet[i%N]);
}
printf("\n");
}
|
the_stack_data/1266541.c
|
/* Generated by CIL v. 1.7.0 */
/* print_CIL_Input is false */
struct _IO_FILE;
struct timeval;
extern float strtof(char const *str , char const *endptr ) ;
extern void signal(int sig , void *func ) ;
typedef struct _IO_FILE FILE;
extern int atoi(char const *s ) ;
extern double strtod(char const *str , char const *endptr ) ;
extern int fclose(void *stream ) ;
extern void *fopen(char const *filename , char const *mode ) ;
extern void abort() ;
extern void exit(int status ) ;
extern int raise(int sig ) ;
extern int fprintf(struct _IO_FILE *stream , char const *format , ...) ;
extern int strcmp(char const *a , char const *b ) ;
extern int rand() ;
extern unsigned long strtoul(char const *str , char const *endptr , int base ) ;
void RandomFunc(unsigned short input[1] , unsigned short output[1] ) ;
extern int strncmp(char const *s1 , char const *s2 , unsigned long maxlen ) ;
extern int gettimeofday(struct timeval *tv , void *tz , ...) ;
extern int printf(char const *format , ...) ;
int main(int argc , char *argv[] ) ;
void megaInit(void) ;
extern unsigned long strlen(char const *s ) ;
extern long strtol(char const *str , char const *endptr , int base ) ;
extern unsigned long strnlen(char const *s , unsigned long maxlen ) ;
extern void *memcpy(void *s1 , void const *s2 , unsigned long size ) ;
struct timeval {
long tv_sec ;
long tv_usec ;
};
extern void *malloc(unsigned long size ) ;
extern int scanf(char const *format , ...) ;
void megaInit(void)
{
{
}
}
int main(int argc , char *argv[] )
{
unsigned short input[1] ;
unsigned short output[1] ;
int randomFuns_i5 ;
unsigned short randomFuns_value6 ;
int randomFuns_main_i7 ;
{
megaInit();
if (argc != 2) {
printf("Call this program with %i arguments\n", 1);
exit(-1);
} else {
}
randomFuns_i5 = 0;
while (randomFuns_i5 < 1) {
randomFuns_value6 = (unsigned short )strtoul(argv[randomFuns_i5 + 1], 0, 10);
input[randomFuns_i5] = randomFuns_value6;
randomFuns_i5 ++;
}
RandomFunc(input, output);
if (output[0] == (unsigned short)31026) {
printf("You win!\n");
} else {
}
randomFuns_main_i7 = 0;
while (randomFuns_main_i7 < 1) {
printf("%u\n", output[randomFuns_main_i7]);
randomFuns_main_i7 ++;
}
}
}
void RandomFunc(unsigned short input[1] , unsigned short output[1] )
{
unsigned short state[1] ;
unsigned short local2 ;
unsigned short local1 ;
{
state[0UL] = (input[0UL] | 51238316UL) >> (unsigned short)3;
local1 = 0UL;
while (local1 < (unsigned short)0) {
local2 = 0UL;
while (local2 < (unsigned short)0) {
if (state[0UL] > (local2 & local1)) {
state[local1] = state[local2] >> ((state[local2] & (unsigned short)7) | 1UL);
}
local2 += 2UL;
}
local1 += 2UL;
}
output[0UL] = state[0UL] << (unsigned short)1;
}
}
|
the_stack_data/59106.c
|
/* Includes */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <signal.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/termios.h>
#include <sys/mman.h>
/* Registers */
enum {
R_R0 = 0,
R_R1,
R_R2,
R_R3,
R_R4,
R_R5,
R_R6,
R_R7,
R_PC, /* program counter */
R_COND,
R_COUNT
};
/* Opcodes */
enum {
OP_BR = 0, /* branch */
OP_ADD, /* add */
OP_LD, /* load */
OP_ST, /* store */
OP_JSR, /* jump register */
OP_AND, /* bitwise and */
OP_LDR, /* load register */
OP_STR, /* store register */
OP_RTI, /* unused */
OP_NOT, /* bitwise not */
OP_LDI, /* load indirect */
OP_STI, /* store indirect */
OP_JMP, /* jump */
OP_RES, /* reserved (unused) */
OP_LEA, /* load effective address */
OP_TRAP /* execute trap */
};
/* Condition Flags */
enum {
FL_POS = 1 << 0, /* P */
FL_ZRO = 1 << 1, /* Z */
FL_NEG = 1 << 2, /* N */
};
/* Memory Mapped Registers */
enum {
MR_KBSR = 0xFE00, /* keyboard status */
MR_KBDR = 0xFE02 /* keyboard data */
};
/* TRAP Codes */
enum {
TRAP_GETC = 0x20, /* get character from keyboard, not echoed onto the terminal */
TRAP_OUT = 0x21, /* output a character */
TRAP_PUTS = 0x22, /* output a word string */
TRAP_IN = 0x23, /* get character from keyboard, echoed onto the terminal */
TRAP_PUTSP = 0x24, /* output a byte string */
TRAP_HALT = 0x25 /* halt the program */
};
/* Memory Storage */
/* 65536 locations */
uint16_t memory[UINT16_MAX];
/* Register Storage */
uint16_t reg[R_COUNT];
/* Functions */
/* Sign Extend */
uint16_t sign_extend(uint16_t x, int bit_count) {
if ((x >> bit_count) & 0x1) {
return x | (0xFFFF << bit_count);
}
return x;
}
/* Swap */
uint16_t swap16(uint16_t x) {
return (x << 8) | (x >> 8);
}
/* Update Flags */
void update_flags(uint16_t r) {
if (reg[r]) {
reg[R_COND] = FL_ZRO;
} else if (reg[r] >> 15) {
reg[R_COND] = FL_NEG;
} else {
reg[R_COND] = FL_POS;
}
}
/* Read Image File */
void read_image_file(FILE* file) {
uint16_t origin; /* where in memory to place the image */
fread(&origin, sizeof(origin), 1, file);
origin = swap16(origin);
/* we know the maximum file size so we only need one fread */
uint16_t max_read = UINT16_MAX - origin;
uint16_t *p = memory + origin;
size_t read = fread(p, sizeof(uint16_t), max_read, file);
/* swap to little endian */
while (read--) {
*p = swap16(*p);
++p;
}
}
/* Read Image */
int read_image(const char* image_path) {
FILE *f = fopen(image_path, "rb");
if (!f) {
return 1;
}
read_image_file(f);
fclose(f);
return 0;
}
/* Check Key */
uint16_t check_key() {
fd_set readfds;
FD_ZERO(&readfds);
FD_SET(STDIN_FILENO, &readfds);
struct timeval timeout;
timeout.tv_sec = 0;
timeout.tv_usec = 0;
return select(1, &readfds, NULL, NULL, &timeout) != 0;
}
/* Memory Access */
void mem_write(uint16_t address, uint16_t val) {
memory[address] = val;
}
uint16_t mem_read(uint16_t address) {
if (address == MR_KBSR) {
if (check_key()) {
memory[MR_KBSR] = (1 << 15);
memory[MR_KBSR] = getchar();
} else {
memory[MR_KBSR] = 0;
}
}
return memory[address];
}
/* Input Buffering */
struct termios original_tio;
void disable_input_buffering() {
tcgetattr(STDIN_FILENO, &original_tio);
struct termios new_tio = original_tio;
new_tio.c_lflag &= ~ICANON & ~ECHO;
tcsetattr(STDIN_FILENO, TCSANOW, &new_tio);
}
void restore_input_buffering() {
tcsetattr(STDIN_FILENO, TCSANOW, &original_tio);
}
/* Handle Interrupt */
void handle_interrupt(int signal) {
restore_input_buffering();
printf("\n");
exit(-2);
}
/* Main Loop */
int main(int argc, const char* argv[]) {
/* Load Arguments */
if (argc < 2) {
printf("lc3 [image-file1] ...\n");
exit(2);
}
for (int j = 1; j < argc; ++j) {
if (read_image(argv[j])) {
printf("failed to load image: %s\n", argv[j]);
exit(1);
}
}
/* Setup */
signal(SIGINT, handle_interrupt);
disable_input_buffering();
/* set the PC starting position */
/* 0x3000 is the default */
enum { PC_START = 0x3000 };
reg[R_PC] = PC_START;
int running = 1;
uint16_t instr, op, r0, r1, r2, imm_flag, imm5, pc_offset;
while (running) {
/* FETCH */
instr = mem_read(reg[R_PC]++);
op = instr >> 12;
switch (op) {
case OP_ADD: { /* ADD */
r0 = (instr >> 9) & 0x7; /* destination register (DR) */
r1 = (instr >> 6) & 0x7; /* first operand (SR1) */
imm_flag = (instr >> 5) & 0x1; /* immediate mode */
if (imm_flag) {
imm5 = sign_extend(instr & 0x1F, 5);
reg[r0] = reg[r1] + imm5;
} else {
r2 = instr & 0x7;
reg[r0] = reg[r1] + reg[r2];
}
update_flags(r0);
}
break;
case OP_AND: { /* AND */
r0 = (instr >> 9) & 0x7;
r1 = (instr >> 6) & 0x7;
imm_flag = (instr >> 5) & 0x1;
if (imm_flag) {
imm5 = sign_extend(instr & 0x1F, 5);
reg[r0] = reg[r1] & imm5;
} else {
r2 = instr & 0x7;
reg[r0] = reg[r1] & reg[r2];
}
update_flags(r0);
}
break;
case OP_NOT: { /* NOT */
r0 = (instr >> 9) & 0x7;
r1 = (instr >> 6) & 0x7;
reg[r0] = ~reg[r1];
update_flags(r0);
}
break;
case OP_BR: { /* BR */
pc_offset = sign_extend((instr) & 0x1ff, 9);
uint16_t cond_flag = (instr >> 9) & 0x7;
if (cond_flag & reg[R_COND]) {
reg[R_PC] += pc_offset;
}
}
break;
case OP_JMP: { /* JMP */
/* Also handles RET */
r1 = (instr >> 6) & 0x7;
reg[R_PC] = reg[r1];
}
break;
case OP_JSR: { /* JSR */
r1 = (instr >> 6) & 0x7;
uint16_t long_pc_offset = sign_extend(instr & 0x7ff, 11);
uint16_t long_flag = (instr >> 11) & 1;
reg[R_R7] = reg[R_PC];
if (long_flag) {
reg[R_PC] += long_pc_offset; /* JSR */
} else {
reg[R_PC] = reg[r1]; /* JSRR */
}
break;
}
break;
case OP_LD: { /* LD */
r0 = (instr >> 9) & 0x7;
pc_offset = sign_extend(instr & 0x1ff, 9);
reg[r0] = mem_read(reg[R_PC] + pc_offset);
update_flags(r0);
}
break;
case OP_LDI: { /* LDI */
r0 = (instr >> 9) & 0x7; /* destination register (DR) */
pc_offset = sign_extend(instr & 0x1ff, 9); /* PCoffset 9*/
/* add pc_offset to the current PC, look at that memory location to get the final address */
reg[r0] = mem_read(mem_read(reg[R_PC] + pc_offset));
update_flags(r0);
}
break;
case OP_LDR: { /* LDR */
r0 = (instr >> 9) & 0x7;
r1 = (instr >> 6) & 0x7;
uint16_t offset = sign_extend(instr & 0x3F, 6);
reg[r0] = mem_read(reg[r1] + offset);
update_flags(r0);
}
break;
case OP_LEA: { /* LEA */
r0 = (instr >> 9) & 0x7;
pc_offset = sign_extend(instr & 0x1ff, 9);
reg[r0] = reg[R_PC] + pc_offset;
update_flags(r0);
}
break;
case OP_ST: { /* ST */
r0 = (instr >> 9) & 0x7;
pc_offset = sign_extend(instr & 0x1ff, 9);
mem_write(reg[R_PC] + pc_offset, reg[r0]);
}
break;
case OP_STI: { /* STI */
r0 = (instr >> 9) & 0x7;
pc_offset = sign_extend(instr & 0x1ff, 9);
mem_write(mem_read(reg[R_PC] + pc_offset), reg[r0]);
}
break;
case OP_STR: { /* STR */
uint16_t r0 = (instr >> 9) & 0x7;
uint16_t r1 = (instr >> 6) & 0x7;
uint16_t offset = sign_extend(instr & 0x3F, 6);
mem_write(reg[r1] + offset, reg[r0]);
}
break;
case OP_TRAP: /* TRAP */
switch (instr & 0xFF) {
case TRAP_GETC: /* TRAP GETC */
reg[R_R0] = (uint16_t)getchar(); /* read a single ASCII char */
break;
case TRAP_OUT: /* TRAP OUT */
putc((char)reg[R_R0], stdout);
fflush(stdout);
break;
case TRAP_PUTS: { /* TRAP PUTS */
/* one char per word */
uint16_t* c = memory + reg[R_R0];
while (*c) {
putc((char)*c, stdout);
++c;
}
fflush(stdout);
}
break;
case TRAP_IN: /* TRAP IN */
printf("Enter a character: ");
char c = getchar();
putc(c, stdout);
reg[R_R0] = (uint16_t)c;
break;
case TRAP_PUTSP: { /* TRAP PUTSP */
/* one char per byte (two bytes per word)
here we need to swap back to big endian format */
uint16_t* c = memory + reg[R_R0];
while (*c) {
char char1 = (*c) & 0xFF;
putc(char1, stdout);
char char2 = (*c) >> 8;
if (char2) putc(char2, stdout);
++c;
}
fflush(stdout);
}
break;
case TRAP_HALT: /* TRAP HALT */
puts("HALT");
fflush(stdout);
running = 0;
break;
}
break;
case OP_RES:
case OP_RTI:
default: /* BAD OPCODE */
abort();
break;
}
}
/* Shutdown */
restore_input_buffering();
}
|
the_stack_data/1001.c
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int createSuper(char str[][100], const int n);
void creating(char str[][100], const int n, int counter, char super[], int* length);
int main()
{
int n, i;
scanf("%d", &n);
char str[n][100];
for (i = 0; i < n; i++) {
scanf("%s", str[i]);
}
printf("%d\n", createSuper(str, n));
return 0;
}
int createSuper(char str[][100], const int n)
{
int length = 100;
char *super = (char *)malloc(100);
strcpy(super, str[0]);
creating(str, n, 1, super, &length);
return length;
}
void creating(char str[][100], const int n, int counter, char super[], int* length)
{
int i, j;
for (i = 0; i < (int)strlen(str[counter]); i++) {
int flag = 1;
for (j = 0; j < (int)strlen(str[counter]) - i; j++) {
if (str[counter][i + j] != super[j]) flag = 0;
}
if (flag) {
char* temp = (char *)malloc(100);
for (j = 0; j < i; j++)
temp[j] = str[counter][j];
temp[i] = '\0';
strcat(temp, super);
creating(str, n, counter + 1, temp, length);
}
flag = 1;
for (j = 0; j < (int)strlen(str[counter]) - i; j++) {
if (str[counter][j] != super[strlen(super) - strlen(str[counter]) + i + j]) flag = 0;
}
if (flag) {
char* temper = (char *)malloc(100);
temper[0] = '\0';
strcpy(temper, super);
int x = strlen(temper);
for (j = 0; j < i; j++)
temper[x + j] = str[counter][strlen(str[counter]) - i + j];
temper[x + i] = '\0';
creating(str, n, counter + 1, temper, length);
}
}
if (counter < n) {
char* a = (char *)malloc(100);
char* b = (char *)malloc(100);
a[0] = '\0';
b[0] = '\0';
strcpy(a, super);
strcpy(b, str[counter]);
strcat(b, super);
strcat(a, str[counter]);
creating(str, n, counter + 1, a, length);
creating(str, n, counter + 1, b, length);
}
if (counter == n) {
if ((*length) > (int)strlen(super)) (*length) = (int)strlen(super);
free(super);
return;
}
free(super);
}
|
the_stack_data/125140356.c
|
#ifdef COMPILE_FOR_TEST
#include <assert.h>
#define assume(cond) assert(cond)
#endif
void main(int argc, char* argv[]) {
int x_0_0;//sh_buf.outcnt
int x_0_1;//sh_buf.outcnt
int x_0_2;//sh_buf.outcnt
int x_0_3;//sh_buf.outcnt
int x_0_4;//sh_buf.outcnt
int x_0_5;//sh_buf.outcnt
int x_1_0;//sh_buf.outbuf[0]
int x_1_1;//sh_buf.outbuf[0]
int x_2_0;//sh_buf.outbuf[1]
int x_2_1;//sh_buf.outbuf[1]
int x_3_0;//sh_buf.outbuf[2]
int x_3_1;//sh_buf.outbuf[2]
int x_4_0;//sh_buf.outbuf[3]
int x_4_1;//sh_buf.outbuf[3]
int x_5_0;//sh_buf.outbuf[4]
int x_5_1;//sh_buf.outbuf[4]
int x_6_0;//sh_buf.outbuf[5]
int x_7_0;//sh_buf.outbuf[6]
int x_8_0;//sh_buf.outbuf[7]
int x_9_0;//sh_buf.outbuf[8]
int x_10_0;//sh_buf.outbuf[9]
int x_11_0;//LOG_BUFSIZE
int x_11_1;//LOG_BUFSIZE
int x_12_0;//CREST_scheduler::lock_0
int x_12_1;//CREST_scheduler::lock_0
int x_12_2;//CREST_scheduler::lock_0
int x_12_3;//CREST_scheduler::lock_0
int x_12_4;//CREST_scheduler::lock_0
int x_13_0;//t3 T0
int x_14_0;//t2 T0
int x_15_0;//arg T0
int x_16_0;//functioncall::param T0
int x_16_1;//functioncall::param T0
int x_17_0;//buffered T0
int x_18_0;//functioncall::param T0
int x_18_1;//functioncall::param T0
int x_19_0;//functioncall::param T0
int x_19_1;//functioncall::param T0
int x_20_0;//functioncall::param T0
int x_20_1;//functioncall::param T0
int x_20_2;//functioncall::param T0
int x_20_3;//functioncall::param T0
int x_21_0;//functioncall::param T0
int x_21_1;//functioncall::param T0
int x_22_0;//direction T0
int x_23_0;//functioncall::param T0
int x_23_1;//functioncall::param T0
int x_24_0;//functioncall::param T0
int x_24_1;//functioncall::param T0
int x_25_0;//functioncall::param T0
int x_25_1;//functioncall::param T0
int x_26_0;//functioncall::param T0
int x_26_1;//functioncall::param T0
int x_27_0;//functioncall::param T0
int x_27_1;//functioncall::param T0
int x_28_0;//functioncall::param T0
int x_28_1;//functioncall::param T0
int x_29_0;//functioncall::param T0
int x_29_1;//functioncall::param T0
int x_30_0;//functioncall::param T0
int x_30_1;//functioncall::param T0
int x_31_0;//functioncall::param T0
int x_31_1;//functioncall::param T0
int x_32_0;//functioncall::param T0
int x_32_1;//functioncall::param T0
int x_33_0;//functioncall::param T0
int x_33_1;//functioncall::param T0
int x_34_0;//functioncall::param T0
int x_34_1;//functioncall::param T0
int x_35_0;//functioncall::param T1
int x_35_1;//functioncall::param T1
int x_36_0;//functioncall::param T1
int x_36_1;//functioncall::param T1
int x_37_0;//i T1
int x_37_1;//i T1
int x_37_2;//i T1
int x_38_0;//rv T1
int x_39_0;//rv T1
int x_40_0;//blocksize T1
int x_40_1;//blocksize T1
int x_41_0;//functioncall::param T1
int x_41_1;//functioncall::param T1
int x_41_2;//functioncall::param T1
int x_42_0;//apr_thread_mutex_lock::rv T1
int x_42_1;//apr_thread_mutex_lock::rv T1
int x_43_0;//functioncall::param T1
int x_43_1;//functioncall::param T1
int x_44_0;//status T1
int x_44_1;//status T1
int x_45_0;//functioncall::param T1
int x_45_1;//functioncall::param T1
int x_46_0;//functioncall::param T1
int x_46_1;//functioncall::param T1
int x_47_0;//functioncall::param T1
int x_47_1;//functioncall::param T1
int x_48_0;//functioncall::param T1
int x_48_1;//functioncall::param T1
int x_49_0;//functioncall::param T1
int x_49_1;//functioncall::param T1
int x_50_0;//functioncall::param T1
int x_50_1;//functioncall::param T1
int x_51_0;//functioncall::param T2
int x_51_1;//functioncall::param T2
int x_52_0;//functioncall::param T2
int x_52_1;//functioncall::param T2
int x_53_0;//i T2
int x_53_1;//i T2
int x_53_2;//i T2
int x_53_3;//i T2
int x_54_0;//rv T2
int x_55_0;//rv T2
int x_56_0;//blocksize T2
int x_56_1;//blocksize T2
int x_57_0;//functioncall::param T2
int x_57_1;//functioncall::param T2
int x_57_2;//functioncall::param T2
int x_58_0;//apr_thread_mutex_lock::rv T2
int x_58_1;//apr_thread_mutex_lock::rv T2
int x_59_0;//functioncall::param T2
int x_59_1;//functioncall::param T2
int x_60_0;//status T2
int x_60_1;//status T2
int x_61_0;//functioncall::param T2
int x_61_1;//functioncall::param T2
int x_62_0;//functioncall::param T2
int x_62_1;//functioncall::param T2
int x_63_0;//functioncall::param T2
int x_63_1;//functioncall::param T2
int x_64_0;//functioncall::param T2
int x_64_1;//functioncall::param T2
int x_65_0;//functioncall::param T2
int x_65_1;//functioncall::param T2
int x_65_2;//functioncall::param T2
int x_66_0;//functioncall::param T2
int x_66_1;//functioncall::param T2
int x_67_0;//functioncall::param T2
int x_67_1;//functioncall::param T2
int x_68_0;//functioncall::param T2
int x_68_1;//functioncall::param T2
T_0_0_0: x_0_0 = 0;
T_0_1_0: x_1_0 = 0;
T_0_2_0: x_2_0 = 0;
T_0_3_0: x_3_0 = 0;
T_0_4_0: x_4_0 = 0;
T_0_5_0: x_5_0 = 0;
T_0_6_0: x_6_0 = 0;
T_0_7_0: x_7_0 = 0;
T_0_8_0: x_8_0 = 0;
T_0_9_0: x_9_0 = 0;
T_0_10_0: x_10_0 = 0;
T_0_11_0: x_11_0 = 0;
T_0_12_0: x_13_0 = 1566602496;
T_0_13_0: x_14_0 = 3479548512;
T_0_14_0: x_15_0 = 0;
T_0_15_0: x_16_0 = 504054661;
T_0_16_0: x_16_1 = -1;
T_0_17_0: x_17_0 = 0;
T_0_18_0: x_18_0 = 1324395724;
T_0_19_0: x_18_1 = x_17_0;
T_0_20_0: x_19_0 = 83552824;
T_0_21_0: x_19_1 = 97;
T_0_22_0: x_20_0 = 131670329;
T_0_23_0: x_20_1 = 0;
T_0_24_0: x_21_0 = 362285287;
T_0_25_0: x_21_1 = 0;
T_0_26_0: x_22_0 = -815423424;
T_0_27_0: x_23_0 = 1824607547;
T_0_28_0: x_23_1 = x_22_0;
T_0_29_0: x_24_0 = 1831218889;
T_0_30_0: x_24_1 = 0;
T_0_31_0: x_12_0 = -1;
T_0_32_0: x_0_1 = 5;
T_0_33_0: x_1_1 = 72;
T_0_34_0: x_2_1 = 69;
T_0_35_0: x_3_1 = 76;
T_0_36_0: x_4_1 = 76;
T_0_37_0: x_5_1 = 79;
T_0_38_0: x_25_0 = 1849539999;
T_0_39_0: x_25_1 = 83;
T_0_40_0: x_26_0 = 328065671;
T_0_41_0: x_26_1 = 1;
T_0_42_0: x_27_0 = 323383952;
T_0_43_0: x_27_1 = 1;
T_0_44_0: x_28_0 = 429504103;
T_0_45_0: x_28_1 = 1;
T_0_46_0: x_29_0 = 529863626;
T_0_47_0: x_29_1 = 82;
T_0_48_0: x_30_0 = 548390857;
T_0_49_0: x_30_1 = 90;
T_0_50_0: x_31_0 = 2102420006;
T_0_51_0: x_31_1 = 1;
T_0_52_0: x_32_0 = 1717712340;
T_0_53_0: x_32_1 = 1;
T_0_54_0: x_33_0 = 1266322565;
T_0_55_0: x_33_1 = 2;
T_0_56_0: x_34_0 = 926089290;
T_0_57_0: x_34_1 = 2;
T_0_58_0: x_11_1 = 5;
T_1_59_1: x_35_0 = 90005020;
T_1_60_1: x_35_1 = x_27_1;
T_1_61_1: x_36_0 = 281982893;
T_1_62_1: x_36_1 = x_28_1;
T_1_63_1: x_37_0 = 0;
T_1_64_1: x_38_0 = 766861825;
T_2_65_2: x_51_0 = 256700140;
T_2_66_2: x_51_1 = x_33_1;
T_2_67_2: x_52_0 = 1368873373;
T_2_68_2: x_52_1 = x_34_1;
T_2_69_2: x_53_0 = 0;
T_2_70_2: x_54_0 = 764760577;
T_1_71_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_39_0 = -808355920;
T_1_72_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_40_0 = 11111;
T_2_73_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_55_0 = 0;
T_2_74_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_56_0 = 0;
T_2_75_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_41_0 = 1510509523;
T_2_76_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_41_1 = x_0_1;
T_1_77_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1) x_42_0 = 0;
T_1_78_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1 && 0 == x_12_0 + 1) x_12_1 = 1;
T_1_79_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1 && 1 == x_12_1) x_42_1 = 0;
T_1_80_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 1 == x_12_1) x_43_0 = 125205542;
T_1_81_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 1 == x_12_1) x_43_1 = 0;
T_1_82_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_1) x_40_1 = x_41_1;
T_1_83_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_1) x_20_2 = x_20_1 + x_40_1;
T_1_84_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_1) x_41_2 = -1*x_40_1 + x_41_1;
T_1_85_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0 && 1 == x_12_1) x_44_0 = 0;
T_1_86_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0 && 1 == x_12_1) x_12_2 = -1;
T_1_87_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_57_0 = 879855414;
T_1_88_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_57_1 = x_0_1;
T_1_89_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1) x_58_0 = 0;
T_1_90_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1 && 0 == x_12_2 + 1) x_12_3 = 2;
T_2_91_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1 && 2 == x_12_3) x_58_1 = 0;
T_2_92_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_3) x_59_0 = 985254010;
T_2_93_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_3) x_59_1 = 0;
T_2_94_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_3) x_56_1 = x_57_1;
T_2_95_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_3) x_20_3 = x_20_2 + x_56_1;
T_2_96_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_3) x_57_2 = -1*x_56_1 + x_57_1;
T_2_97_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0 && 2 == x_12_3) x_60_0 = 0;
T_2_98_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0 && 2 == x_12_3) x_12_4 = -1;
T_2_99_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0) x_60_1 = 0;
T_2_100_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_61_0 = 732114060;
T_2_101_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_61_1 = x_59_1;
T_2_102_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_62_0 = 76734538;
T_2_103_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_62_1 = x_61_1;
T_2_104_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_0_2 = 0;
T_2_105_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0) x_44_1 = 0;
T_2_106_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_45_0 = 929447199;
T_2_107_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_45_1 = x_43_1;
T_2_108_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_46_0 = 133451481;
T_2_109_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_46_1 = x_45_1;
T_2_110_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_0_3 = 0;
T_1_111_1: if (x_52_1 < x_11_1) x_63_0 = 1967249574;
T_1_112_1: if (x_52_1 < x_11_1) x_63_1 = 47724911834880;
T_1_113_1: if (x_36_1 < x_11_1) x_47_0 = 1041046742;
T_1_114_1: if (x_36_1 < x_11_1) x_47_1 = 47724909733632;
T_2_115_2: if (x_52_1 < x_11_1) x_64_0 = 637506142;
T_2_116_2: if (x_52_1 < x_11_1) x_64_1 = x_0_3 + x_52_1;
T_2_117_2: if (x_52_1 < x_11_1) x_53_1 = 0;
T_1_118_1: if (x_52_1 < x_11_1 && x_53_1 < x_51_1) x_65_0 = 1144161650;
T_1_119_1: if (x_52_1 < x_11_1 && x_53_1 < x_51_1) x_65_1 = 47724911834880;
T_2_120_2: if (x_52_1 < x_11_1) x_53_2 = 1 + x_53_1;
T_2_121_2: if (x_52_1 < x_11_1 && x_53_2 < x_51_1) x_65_2 = 47724911834880;
T_2_122_2: if (x_52_1 < x_11_1) x_53_3 = 1 + x_53_2;
T_2_123_2: if (x_52_1 < x_11_1) x_66_0 = 1124599566;
T_2_124_2: if (x_52_1 < x_11_1) x_66_1 = 47724911834880;
T_2_125_2: if (x_36_1 < x_11_1) x_48_0 = 769176471;
T_2_126_2: if (x_36_1 < x_11_1) x_48_1 = x_0_3 + x_36_1;
T_2_127_2: if (x_36_1 < x_11_1) x_37_1 = 0;
T_2_128_2: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_49_0 = 1506446938;
T_2_129_2: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_49_1 = 47724909733632;
T_1_130_1: if (x_36_1 < x_11_1) x_37_2 = 1 + x_37_1;
T_1_131_1: if (x_36_1 < x_11_1) x_50_0 = 801723466;
T_1_132_1: if (x_36_1 < x_11_1) x_50_1 = 47724909733632;
T_1_133_1: if (x_52_1 < x_11_1) x_0_4 = x_0_3 + x_52_1;
T_1_134_1: if (x_36_1 < x_11_1) x_0_5 = x_0_3 + x_36_1;
T_1_135_1: if (x_52_1 < x_11_1) x_67_0 = 452911712;
T_1_136_1: if (x_52_1 < x_11_1) x_67_1 = 47724911834880;
T_1_137_1: if (x_52_1 < x_11_1) x_68_0 = 1208503289;
T_1_138_1: if (x_52_1 < x_11_1) x_68_1 = 47724911834880;
T_2_139_2: if (x_52_1 < x_11_1) assert(x_0_5 == x_64_1);
}
|
the_stack_data/215768479.c
|
#define N 100000000
#define MAX 4
int a[N],b[N],ind[N];
long long s=0;
main()
{
int i;
/* inicialitzacio, no en paral.lel */
for(i=0;i<N;i++)
{
a[i]=1;
b[i]=2;
ind[i]=i%MAX;
}
#pragma omp parallel for schedule(static,1)
//#pragma omp parallel for
for (i=0;i<N;i++)
b[ind[i]] += a[i];
for (i=0;i<MAX;i++)
{
printf("Valor %d, de b %d \n",i,b[i]);
s+=b[i];
}
printf("Suma total de b: %ld\n",s);
}
|
the_stack_data/18886649.c
|
/* Copyright (C) 2002 Free Software Foundation, Inc. */
/* { dg-do preprocess } */
/* { dg-options "-dD -M" } */
/* Test -dD -M does not fail. It should print just
the Makefile rule with dependencies. */
#define foo bar
#define funlike(like) fun like
int variable;
/* { dg-final { if ![file exists cmdlne-dD-M.i] { return } } }
{ dg-final { if { [grep cmdlne-dD-M.i "^#define foo bar$"] != "" } { fail "cmdlne-dD-M.c: #define line printed" } } }
{ dg-final { if { [grep cmdlne-dD-M.i "variable"] != "" } { fail "cmdlne-dD-M.c: non-#define line printed" } } }
{ dg-final { if { [grep cmdlne-dD-M.i "^cmdlne-dD-M.*:.*cmdlne-dD-M.c"] == "" } { xfail "cmdlne-dD-M.c: dependency rule not printed" } } }
{ dg-final { return } } */
|
the_stack_data/29826554.c
|
#include<stdio.h>
#define N 100
struct Comst{
int id;//客户序号
int T;//预计对客户的服务时间
int D;//客户希望的服务结束时间
}comst[N];
int n;//输入客户总数量
int f[N];//记录每个客户的开始时间
//划分函数
int Partition(struct Comst r[],int low,int high){
int i=low,j=high,pivot=r[low].D;
while(i<j){
while(i<j&&r[j].D>pivot){//向左扫描
j--;
}
if(i<j){
struct Comst temp=r[i];
r[i]=r[j];
r[j]=temp;
}
while(i<j&&r[i].D<=pivot){//向右扫描
i++;
}
if(i<j){
struct Comst temp=r[i];
r[i]=r[j];
r[j]=temp;
}
}
return i;
}
//快速排序递归算法
void QuickSort(struct Comst R[],int low,int high){
int mid;
if(low<high){
mid=Partition(R,low,high);//基准位置
QuickSort(R,low,mid-1);//左区间快排
QuickSort(R,mid+1,high);//右区间快排
}
}
void printT_D(){
printf("T[]:\n");
for(int i=0;i<n;i++){
printf("%d ",comst[i].T);
}
printf("\nD[]:\n");
for(int i=0;i<n;i++){
printf("%d ",comst[i].D);
}
printf("\n");
}
//贪心法求解
void Result(){
f[0]=0;
for(int i=1;i<n;i++){
f[i]=f[i-1]+comst[i-1].T;
}
}
int main(void){
printf("请输入客户的数量n\n");
scanf("%d",&n);
if(n>=N){
printf("n过大\n");
return -1;
}
printf("请输入每位客户的预计服务时长与客户希望服务结束的时间中间用空格隔开\n");
for(int i=0;i<n;i++){
comst[i].id=i;
scanf("%d",&comst[i].T);
scanf("%d",&comst[i].D);
}
//输出T[] 与 D[]
printf("T[]:\n");
for(int i=0;i<n;i++){
printf("%d ",comst[i].T);
}
printf("\nD[]:\n");
for(int i=0;i<n;i++){
printf("%d ",comst[i].D);
}
printf("\n");
printT_D();
//排序使得D[0]<=D[1]<=D[2]<=...<=D[n-1],同时T[]跟随D[]排序
//输出排序后的
QuickSort(comst,0,n-1);
printT_D();
//贪心法求解
Result();
//输出解序列
printf("\n\n\n贪心法求解为:\n");
for(int i=0;i<n;i++){
printf("%d-执行事件id:%d-开始执行时刻-%d\n",i,comst[i].id,f[i]);
}
return 0;
}
|
the_stack_data/995752.c
|
/*
Newsgroups: mod.std.unix
Subject: public domain AT&T getopt source
Date: 3 Nov 85 19:34:15 GMT
Here's something you've all been waiting for: the AT&T public domain
source for getopt(3). It is the code which was given out at the 1985
UNIFORUM conference in Dallas. I obtained it by electronic mail
directly from AT&T. The people there assure me that it is indeed
in the public domain.
*/
/*LINTLIBRARY*/
#define NULL 0
#define EOF (-1)
#define ERR(s, c) if(opterr){\
extern int strlen(), write();\
char errbuf[2];\
errbuf[0] = c; errbuf[1] = '\n';\
(void) write(2, argv[0], (unsigned)strlen(argv[0]));\
(void) write(2, s, (unsigned)strlen(s));\
(void) write(2, errbuf, 2);}
extern int strcmp();
extern char *strchr();
int opterr = 1;
int optind = 1;
int optopt;
char *optarg;
int
getopt(argc, argv, opts)
int argc;
char **argv, *opts;
{
static int sp = 1;
register int c;
register char *cp;
if(sp == 1)
if(optind >= argc ||
argv[optind][0] != '-' || argv[optind][1] == '\0')
return(EOF);
else if(strcmp(argv[optind], "--") == NULL) {
optind++;
return(EOF);
}
optopt = c = argv[optind][sp];
if(c == ':' || (cp=strchr(opts, c)) == NULL) {
ERR(": illegal option -- ", c);
if(argv[optind][++sp] == '\0') {
optind++;
sp = 1;
}
return('?');
}
if(*++cp == ':') {
if(argv[optind][sp+1] != '\0')
optarg = &argv[optind++][sp+1];
else if(++optind >= argc) {
ERR(": option requires an argument -- ", c);
sp = 1;
return('?');
} else
optarg = argv[optind++];
sp = 1;
} else {
if(argv[optind][++sp] == '\0') {
sp = 1;
optind++;
}
optarg = NULL;
}
return(c);
}
|
the_stack_data/232956857.c
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int num , factorial =1 ;
printf("enter a number : ");
scanf("%d", &num);
num++;
if (num>0)
{
for (int i = num ; num > 1 ; num--)
{
factorial *= (num-1);
}
printf("the factorial is : %d",factorial );
}
else if (num == 0 )
{
printf("the factorial is 1");
}
else
printf("you entered an incorrect number ");
return 0;
}
|
the_stack_data/60484.c
|
double sum(unsigned n, double tab[n]) {
double s = 0.0;
if (n > 0) {
unsigned i;
for(i=0; i<n; i++) {
s += tab[i];
}
}
return s;
}
|
the_stack_data/126702727.c
|
#include<stdio.h>
#include<stdlib.h>
struct Node{
int data;
struct Node *left;
struct Node *right;
};
struct Node * create_node(int data){
struct Node *node = (struct Node*) malloc(sizeof(struct Node)); //creating a node pointer
node->data = data;
node->left = NULL;
node->right = NULL;
return node;
}
void inorder(struct Node* root){
if(root!=NULL){
inorder(root->left);
printf("%d ", root->data);
inorder(root->right);
}
}
int main()
{
struct Node *p = create_node(4);
struct Node *p1 = create_node(1);
struct Node *p2 = create_node(6);
struct Node *p3 = create_node(5);
struct Node *p4 = create_node(2);
p->left = p1;
p->right = p2;
p1->left = p3;
p1->right = p4;
// Finally The tree looks like this:
// 4
// / \
// 1 6
// / \
// 5 2
printf("In Order Travarsal\n");
inorder(p);
return 0;
}
|
the_stack_data/122015248.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char const *argv[])
{
char *char_ptr;
int *int_ptr;
int mem_size;
if (argc < 2)
mem_size = 50;
else
mem_size = atoi(argv[1]);
printf("\t[+] allocating %d bytes of memory on the heap for char_ptr\n", mem_size);
char_ptr = (char *) malloc(mem_size);
if (char_ptr == NULL)
{
fprintf(stderr, "Error: could not allocate heap memory.\n");
exit(-1);
}
strcpy(char_ptr, "This is memory located on the heap");
printf("char_ptr (%p) --> '%s'\n", char_ptr, char_ptr);
printf("\t[+] allocating 12 bytes of memory on the heap for int_ptr\n");
int_ptr = (int *) malloc(12);
if (int_ptr == NULL)
{
fprintf(stderr, "Error: could not allocate heap memory.\n");
exit(-1);
}
*int_ptr = 31337;
printf("int_ptr (%p) --> %d\n", int_ptr, *int_ptr);
printf("\t[-] freeing char_ptr's heap_memory...\n");
free(char_ptr);
printf("\t[+] allocating another 15 bytes for char_ptr\n");
char_ptr = (char *) malloc(15);
if (char_ptr == NULL)
{
fprintf(stderr, "Error: could not allocate heap memory.\n");
exit(-1);
}
strcpy(char_ptr, "new memory");
printf("char_ptr (%p) --> '%s'\n", char_ptr, char_ptr);
printf("\t[-] freeing int_ptr's heap_memory...\n");
free(int_ptr);
printf("\t[-] freeing char_ptr's heap_memory...\n");
free(char_ptr);
return 0;
}
|
the_stack_data/468968.c
|
#define _GNU_SOURCE
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/mount.h>
#include <stdio.h>
#include <sched.h>
#include <signal.h>
#include <unistd.h>
#define STACK_SIZE (1024 * 1024)
static char container_stack[STACK_SIZE];
char* const container_args[] = {
"/bin/bash",
"-l",
NULL
};
int container_main(void* arg)
{
printf("Container [%5d] - inside the container!\n", getpid());
//set hostname
sethostname("container",10);
//remount "/proc" to make sure the "top" and "ps" show container's information
if (mount("proc", "rootfs/proc", "proc", 0, NULL) !=0 ) {
perror("proc");
}
if (mount("sysfs", "rootfs/sys", "sysfs", 0, NULL)!=0) {
perror("sys");
}
if (mount("none", "rootfs/tmp", "tmpfs", 0, NULL)!=0) {
perror("tmp");
}
if (mount("udev", "rootfs/dev", "devtmpfs", 0, NULL)!=0) {
perror("dev");
}
if (mount("devpts", "rootfs/dev/pts", "devpts", 0, NULL)!=0) {
perror("dev/pts");
}
if (mount("shm", "rootfs/dev/shm", "tmpfs", 0, NULL)!=0) {
perror("dev/shm");
}
if (mount("tmpfs", "rootfs/run", "tmpfs", 0, NULL)!=0) {
perror("run");
}
if (mount("conf/hosts", "rootfs/etc/hosts", "none", MS_BIND, NULL)!=0 ||
mount("conf/hostname", "rootfs/etc/hostname", "none", MS_BIND, NULL)!=0 ||
mount("conf/resolv.conf", "rootfs/etc/resolv.conf", "none", MS_BIND, NULL)!=0 ) {
perror("conf");
}
/*
if (mount("/tmp/t1", "rootfs/mnt", "none", MS_BIND, NULL)!=0) {
perror("mnt");
}
*/
if ( chdir("./rootfs") != 0 || chroot("./") != 0 ){
perror("chdir/chroot");
}
execv(container_args[0], container_args);
perror("exec");
printf("Something's wrong!\n");
return 1;
}
int main()
{
printf("Parent [%5d] - start a container!\n", getpid());
int container_pid = clone(container_main, container_stack+STACK_SIZE,
CLONE_NEWUTS | CLONE_NEWIPC | CLONE_NEWPID | CLONE_NEWNS | SIGCHLD, NULL);
waitpid(container_pid, NULL, 0);
printf("Parent - container stopped!\n");
return 0;
}
|
the_stack_data/154831450.c
|
/* Copyright Statement:
*
* This software/firmware and related documentation ("MediaTek Software") are
* protected under relevant copyright laws. The information contained herein
* is confidential and proprietary to MediaTek Inc. and/or its licensors.
* Without the prior written permission of MediaTek inc. and/or its licensors,
* any reproduction, modification, use or disclosure of MediaTek Software,
* and information contained herein, in whole or in part, shall be strictly prohibited.
*/
/* MediaTek Inc. (C) 2010. All rights reserved.
*
* BY OPENING THIS FILE, RECEIVER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES
* THAT THE SOFTWARE/FIRMWARE AND ITS DOCUMENTATIONS ("MEDIATEK SOFTWARE")
* RECEIVED FROM MEDIATEK AND/OR ITS REPRESENTATIVES ARE PROVIDED TO RECEIVER ON
* AN "AS-IS" BASIS ONLY. MEDIATEK EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT.
* NEITHER DOES MEDIATEK PROVIDE ANY WARRANTY WHATSOEVER WITH RESPECT TO THE
* SOFTWARE OF ANY THIRD PARTY WHICH MAY BE USED BY, INCORPORATED IN, OR
* SUPPLIED WITH THE MEDIATEK SOFTWARE, AND RECEIVER AGREES TO LOOK ONLY TO SUCH
* THIRD PARTY FOR ANY WARRANTY CLAIM RELATING THERETO. RECEIVER EXPRESSLY ACKNOWLEDGES
* THAT IT IS RECEIVER'S SOLE RESPONSIBILITY TO OBTAIN FROM ANY THIRD PARTY ALL PROPER LICENSES
* CONTAINED IN MEDIATEK SOFTWARE. MEDIATEK SHALL ALSO NOT BE RESPONSIBLE FOR ANY MEDIATEK
* SOFTWARE RELEASES MADE TO RECEIVER'S SPECIFICATION OR TO CONFORM TO A PARTICULAR
* STANDARD OR OPEN FORUM. RECEIVER'S SOLE AND EXCLUSIVE REMEDY AND MEDIATEK'S ENTIRE AND
* CUMULATIVE LIABILITY WITH RESPECT TO THE MEDIATEK SOFTWARE RELEASED HEREUNDER WILL BE,
* AT MEDIATEK'S OPTION, TO REVISE OR REPLACE THE MEDIATEK SOFTWARE AT ISSUE,
* OR REFUND ANY SOFTWARE LICENSE FEES OR SERVICE CHARGE PAID BY RECEIVER TO
* MEDIATEK FOR SUCH MEDIATEK SOFTWARE AT ISSUE.
*
* The following software/firmware and/or related documentation ("MediaTek Software")
* have been modified by MediaTek Inc. All revisions are subject to any receiver's
* applicable license agreements with MediaTek Inc.
*/
/* //device/system/reference-ril/misc.c
**
** Copyright 2006, The Android Open Source Project
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless required by applicable law or agreed to in writing, software
** distributed under the License is distributed on an "AS IS" BASIS,
** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
** See the License for the specific language governing permissions and
** limitations under the License.
*/
/** returns 1 if line starts with prefix, 0 if it does not */
int strStartsWith(const char *line, const char *prefix)
{
for ( ; *line != '\0' && *prefix != '\0' ; line++, prefix++) {
if (*line != *prefix) {
return 0;
}
}
return *prefix == '\0';
}
|
the_stack_data/211081694.c
|
/*
* Copyright (c) 2020, Shenzhen Academy of Aerospace Technology
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2020-10-16 Dystopia the first version
*/
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
printf("hello rt-thread\n");
return 0;
}
|
the_stack_data/93886704.c
|
//lab_1 -> Exercise_01
//Write a C program to print the process ID of the process and it’s parent process ID.
//process ID -> each any every process in unix has its own identifier
//to get process ID -> getpid()
//to get parent process ID -> getppid()
#include<stdio.h>
int main()
{
printf("pid : %d\n",getpid());
printf("ppid : %d\n",getppid());
}
|
the_stack_data/583108.c
|
#include <getopt.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct hash_t hash_t;
typedef struct entry_t entry_t;
struct entry_t {
char *key;
size_t keysz;
char **values;
size_t nb_values;
entry_t *next;
};
struct hash_t {
entry_t **buckets;
uint32_t nb_buckets;
uint32_t hashmask;
};
struct hashjoin_cfg_t {
hash_t *hash;
int field1, field2, fixed, negate;
char separator1, separator2;
size_t size;
};
typedef struct hashjoin_cfg_t hashjoin_cfg_t;
static inline hash_t *hash_make(register uint32_t v)
{
hash_t *result;
/* quick computation of closest bigger power of 2. */
v--;
v |= v >> 1;
v |= v >> 2;
v |= v >> 4;
v |= v >> 8;
v |= v >> 16;
v++;
result = malloc(sizeof(struct hash_t));
if (NULL != result) {
result->buckets = calloc(v, sizeof(entry_t *));
if (NULL == result->buckets) {
free(result);
fprintf(stderr, "allocation error inon_obj_make\n");
return NULL;
}
result->nb_buckets = v;
result->hashmask = v - 1;
} else {
fprintf(stderr, "allocation error inon_obj_make\n");
}
return result;
}
static inline void hash_destroy(hash_t *hash)
{
size_t i, j;
for (i = 0; i < hash->nb_buckets; i++) {
entry_t *tmp_entry, *next_entry;
tmp_entry = hash->buckets[i];
if (tmp_entry) {
do {
next_entry = tmp_entry->next;
free(tmp_entry->key);
for (j = 0; j < tmp_entry->nb_values; j++) {
free(tmp_entry->values[j]);
}
free(tmp_entry->values);
free(tmp_entry);
tmp_entry = next_entry;
} while (NULL != next_entry);
}
}
free(hash->buckets);
free(hash);
}
static inline uint32_t str_hash(const char *key, uint32_t len, uint32_t seed) {
static const uint32_t c1 = 0xcc9e2d51;
static const uint32_t c2 = 0x1b873593;
static const uint32_t r1 = 15;
static const uint32_t r2 = 13;
static const uint32_t m = 5;
static const uint32_t n = 0xe6546b64;
uint32_t hash = seed;
const int nblocks = len / 4;
const uint32_t *blocks = (const uint32_t *) key;
int i;
for (i = 0; i < nblocks; i++) {
uint32_t k = blocks[i];
k *= c1;
k = (k << r1) | (k >> (32 - r1));
k *= c2;
hash ^= k;
hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
}
const uint8_t *tail = (const uint8_t *) (key + nblocks * 4);
uint32_t k1 = 0;
switch (len & 3) {
case 3:
k1 ^= tail[2] << 16;
case 2:
k1 ^= tail[1] << 8;
case 1:
k1 ^= tail[0];
k1 *= c1;
k1 = (k1 << r1) | (k1 >> (32 - r1));
k1 *= c2;
hash ^= k1;
}
hash ^= len;
hash ^= (hash >> 16);
hash *= 0x85ebca6b;
hash ^= (hash >> 13);
hash *= 0xc2b2ae35;
hash ^= (hash >> 16);
return hash;
}
static inline entry_t *entry_make(const char *key, size_t keysz, const char *value) {
entry_t *result;
result = malloc(sizeof(struct entry_t));
if (NULL != result) {
result->nb_values = 1;
result->values = malloc(result->nb_values * sizeof(char *));
if (NULL != result->values) {
result->key = malloc(keysz * sizeof(char));
if (NULL == result->key) {
fprintf(stderr, "allocation error key in entry_make\n");
free(result);
free(result->values);
result = NULL;
} else {
memcpy(result->key, key, keysz);
result->keysz = keysz;
*(result->values) = strdup(value);
if (NULL == *(result->values)) {
fprintf(stderr, "allocation error values content in entry_make\n");
free(result->key);
free(result->values);
free(result);
result = NULL;
} else {
result->next = NULL;
}
}
} else {
fprintf(stderr, "allocation error for values in entry_make\n");
free(result);
result = NULL;
}
} else {
fprintf(stderr, "allocation error in entry_make\n");
}
return result;
}
static inline int hash_add(hash_t *hash, const char *key, size_t keysz, const char *value)
{
entry_t *tmp_entry;
uint32_t bucket;
bucket = str_hash(key, keysz, 0xdeadbeef) & hash->hashmask;
tmp_entry = hash->buckets[bucket];
while((NULL != tmp_entry) && ((keysz != tmp_entry->keysz) || (0 != memcmp(tmp_entry->key, key, keysz))))
tmp_entry = tmp_entry->next;
if (NULL != tmp_entry) {
char **tmp_values;
tmp_entry->nb_values += 1;
tmp_values = realloc(tmp_entry->values, tmp_entry->nb_values * sizeof(char *));
if (NULL != tmp_values) {
tmp_entry->values = tmp_values;
} else {
fprintf(stderr, "reallocation error in hash_add\n");
return -1;
}
tmp_entry->values[tmp_entry->nb_values - 1] = strdup(value);
} else {
if (NULL != hash->buckets[bucket]) {
tmp_entry = entry_make(key, keysz, value);
tmp_entry->next = hash->buckets[bucket];
hash->buckets[bucket] = tmp_entry;
} else {
hash->buckets[bucket] = entry_make(key, keysz, value);
}
if (NULL == hash->buckets[bucket]) {
fprintf(stderr, "an error occurred while calling entry_make\n");
return -1;
}
}
return 0;
}
static inline char **hash_get(hash_t *hash, const char *key, size_t keysz, size_t *nb_values)
{
entry_t *tmp_entry;
uint32_t bucket;
bucket = str_hash(key, keysz, 0xdeadbeef) & hash->hashmask;
tmp_entry = hash->buckets[bucket];
while((NULL != tmp_entry) && ((keysz != tmp_entry->keysz) || (0 != memcmp(tmp_entry->key, key, keysz))))
tmp_entry = tmp_entry->next;
if (NULL != tmp_entry) {
*nb_values = tmp_entry->nb_values;
return tmp_entry->values;
}
*nb_values = 0;
return NULL;
}
#define SKIP_SEPARATOR(c, end, ptr, line, tmp, skipped_tag, error) { \
end = memchr(ptr, c, sizeof(line) - (ptr - line)); \
if (NULL == end) { \
fprintf(stderr, "missing %ith %c in %s\n", skipped_tag, c, tmp); \
error = 1; \
} else { \
ptr = end + 1; \
} \
}
static inline int read_file(const char *fname, hashjoin_cfg_t *conf)
{
char line[4096], key[4096], cspn[2];
FILE *fd;
char *tmp, *ptr, *end;
size_t line_len, keysz;
int i, rv, error;
cspn[0] = conf->separator1;
cspn[1] = '\0';
fd = fopen(fname, "r");
if (NULL == fd) {
fprintf(stderr, "an error occurred calling fopen: %s\n", fname);
return -1;
}
do {
error = 0;
tmp = fgets(line, sizeof(line), fd);
if (NULL != tmp) {
ptr = tmp;
line_len = strlen(ptr);
if('\n' == ptr[line_len - 1]) {
line_len--;
ptr[line_len] = '\0';
}
for (i = 0; (i < conf->field1) && (0 == error); i++) {
SKIP_SEPARATOR(conf->separator1, end, ptr, line, tmp, i, error);
}
if (0 != error) {
continue;
}
keysz = strcspn(ptr, cspn);
memcpy(key, ptr, keysz);
if (0 == conf->negate) {
tmp = line;
} else {
tmp = "a";
}
if (0 != conf->fixed) {
if (keysz > conf->fixed)
keysz = conf->fixed;
}
rv = hash_add(conf->hash, key, keysz, tmp);
if (0 != rv) {
fprintf(stderr, "an error occurred while calling hash_add (%s:%s)\n", fname, line);
return rv;
}
}
} while(0 == feof(fd));
return 0;
}
static inline int process_file(const char *fname, hashjoin_cfg_t *conf)
{
char line[4096], key[4096], cspn[2];
FILE *fd;
char *tmp, *ptr, *end, **values;
size_t line_len, keysz, nb_values;
int i, error;
cspn[0] = conf->separator2;
cspn[1] = '\0';
fd = fopen(fname, "r");
if (NULL == fd) {
fprintf(stderr, "an error occurred calling fopen: %s\n", fname);
return -1;
}
do {
error = 0;
tmp = fgets(line, sizeof(line), fd);
if (NULL != tmp) {
ptr = tmp;
line_len = strlen(ptr);
if('\n' == ptr[line_len - 1]) {
line_len--;
ptr[line_len] = '\0';
}
for (i = 0; (i < conf->field2) && (0 == error); i++) {
SKIP_SEPARATOR(conf->separator2, end, ptr, line, tmp, i, error);
}
if (0 != error) {
continue;
}
keysz = strcspn(ptr, cspn);
memcpy(key, ptr, keysz);
if (0 != conf->fixed) {
if (keysz > conf->fixed)
keysz = conf->fixed;
}
values = hash_get(conf->hash, key, keysz, &nb_values);
if (NULL != values) {
if (0 == conf->negate) {
size_t j;
for (j = 0; j < nb_values; j++) {
fprintf(stdout, "%s", line);
fprintf(stdout, "%c", conf->separator2);
for (i = 0; values[j][i] != '\0'; i++)
if(values[j][i] == conf->separator1)
values[j][i] = conf->separator2;
fprintf(stdout, "%s", values[j]);
fprintf(stdout, "\n");
}
}
} else {
if (0 != conf->negate) {
fprintf(stdout, "%s\n", line);
}
}
}
} while(0 == feof(fd));
return 0;
}
/* load first file field in a hash, then, matches it in second file field then append 1 to 2. */
/* -n negate the match: If field in file 2 doesn't match any in file 1, display line */
int main(int argc, char * const *argv)
{
/* options descriptor */
static struct option longopts[] = {
{ "field1", required_argument, NULL, '1' },
{ "field2", required_argument, NULL, '2' },
{ "size", required_argument, NULL, 'S' },
{ "fixed", required_argument, NULL, 'f' },
{ "negate", no_argument, NULL, 'n' },
{ "sep1", required_argument, NULL, 'x' },
{ "sep2", required_argument, NULL, 'y' },
{ NULL, 0, NULL, 0 }
};
hashjoin_cfg_t conf;
// size_t expected_size = 100; /* TODO add heuristic to guess that number avg line size / byte sz */
int ch, rv;
conf.hash = NULL;
conf.field1 = 0;
conf.field2 = 0;
conf.fixed = 0;
conf.negate = 0;
conf.separator1 = ',';
conf.separator2 = ',';
conf.size = 8000000;
while ((ch = getopt_long(argc, argv, "1:2:S:f:nx:y:", longopts, NULL)) != -1)
switch (ch) {
case '1':
conf.field1 = atoi(optarg) - 1;
break;
case '2':
conf.field2 = atoi(optarg) - 1;
break;
case 'S':
conf.size = atoi(optarg);
break;
case 'f':
conf.fixed = atoi(optarg);
break;
case 'n':
conf.negate = 1;
break;
case 'x':
conf.separator1 = *optarg;
break;
case 'y':
conf.separator2 = *optarg;
break;
default:
fprintf(stderr, "getopt not happy\n");
}
conf.hash = hash_make(conf.size);
argc -= optind;
argv += optind;
if (argc < 2) {
fprintf(stderr, "missing files?\n");
return -1;
}
rv = read_file(argv[0], &conf);
if (0 != rv) {
fprintf(stderr, "an error occurred while calling read_file(%s)\n", argv[1]);
return -1;
}
rv = process_file(argv[1], &conf);
if (0 != rv) {
fprintf(stderr, "an error occurred while calling process_file(%s)\n", argv[2]);
return -1;
}
hash_destroy(conf.hash);
return 0;
}
|
the_stack_data/204907.c
|
// KASAN: use-after-free Read in relay_switch_subbuf
// https://syzkaller.appspot.com/bug?id=13849f0d9b1b818b087341691be6cc3ac6a6bfb7
// status:open
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <arpa/inet.h>
#include <dirent.h>
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <net/if.h>
#include <net/if_arp.h>
#include <netinet/in.h>
#include <sched.h>
#include <setjmp.h>
#include <signal.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ioctl.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/resource.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>
#include <linux/capability.h>
#include <linux/genetlink.h>
#include <linux/if_addr.h>
#include <linux/if_ether.h>
#include <linux/if_link.h>
#include <linux/if_tun.h>
#include <linux/in6.h>
#include <linux/ip.h>
#include <linux/neighbour.h>
#include <linux/net.h>
#include <linux/netlink.h>
#include <linux/rtnetlink.h>
#include <linux/tcp.h>
#include <linux/veth.h>
unsigned long long procid;
static __thread int skip_segv;
static __thread jmp_buf segv_env;
static void segv_handler(int sig, siginfo_t* info, void* ctx)
{
uintptr_t addr = (uintptr_t)info->si_addr;
const uintptr_t prog_start = 1 << 20;
const uintptr_t prog_end = 100 << 20;
if (__atomic_load_n(&skip_segv, __ATOMIC_RELAXED) &&
(addr < prog_start || addr > prog_end)) {
_longjmp(segv_env, 1);
}
exit(sig);
}
static void install_segv_handler(void)
{
struct sigaction sa;
memset(&sa, 0, sizeof(sa));
sa.sa_handler = SIG_IGN;
syscall(SYS_rt_sigaction, 0x20, &sa, NULL, 8);
syscall(SYS_rt_sigaction, 0x21, &sa, NULL, 8);
memset(&sa, 0, sizeof(sa));
sa.sa_sigaction = segv_handler;
sa.sa_flags = SA_NODEFER | SA_SIGINFO;
sigaction(SIGSEGV, &sa, NULL);
sigaction(SIGBUS, &sa, NULL);
}
#define NONFAILING(...) \
{ \
__atomic_fetch_add(&skip_segv, 1, __ATOMIC_SEQ_CST); \
if (_setjmp(segv_env) == 0) { \
__VA_ARGS__; \
} \
__atomic_fetch_sub(&skip_segv, 1, __ATOMIC_SEQ_CST); \
}
static void sleep_ms(uint64_t ms)
{
usleep(ms * 1000);
}
static uint64_t current_time_ms(void)
{
struct timespec ts;
if (clock_gettime(CLOCK_MONOTONIC, &ts))
exit(1);
return (uint64_t)ts.tv_sec * 1000 + (uint64_t)ts.tv_nsec / 1000000;
}
static void use_temporary_dir(void)
{
char tmpdir_template[] = "./syzkaller.XXXXXX";
char* tmpdir = mkdtemp(tmpdir_template);
if (!tmpdir)
exit(1);
if (chmod(tmpdir, 0777))
exit(1);
if (chdir(tmpdir))
exit(1);
}
static bool write_file(const char* file, const char* what, ...)
{
char buf[1024];
va_list args;
va_start(args, what);
vsnprintf(buf, sizeof(buf), what, args);
va_end(args);
buf[sizeof(buf) - 1] = 0;
int len = strlen(buf);
int fd = open(file, O_WRONLY | O_CLOEXEC);
if (fd == -1)
return false;
if (write(fd, buf, len) != len) {
int err = errno;
close(fd);
errno = err;
return false;
}
close(fd);
return true;
}
static struct {
char* pos;
int nesting;
struct nlattr* nested[8];
char buf[1024];
} nlmsg;
static void netlink_init(int typ, int flags, const void* data, int size)
{
memset(&nlmsg, 0, sizeof(nlmsg));
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg.buf;
hdr->nlmsg_type = typ;
hdr->nlmsg_flags = NLM_F_REQUEST | NLM_F_ACK | flags;
memcpy(hdr + 1, data, size);
nlmsg.pos = (char*)(hdr + 1) + NLMSG_ALIGN(size);
}
static void netlink_attr(int typ, const void* data, int size)
{
struct nlattr* attr = (struct nlattr*)nlmsg.pos;
attr->nla_len = sizeof(*attr) + size;
attr->nla_type = typ;
memcpy(attr + 1, data, size);
nlmsg.pos += NLMSG_ALIGN(attr->nla_len);
}
static int netlink_send_ext(int sock, uint16_t reply_type, int* reply_len)
{
if (nlmsg.pos > nlmsg.buf + sizeof(nlmsg.buf) || nlmsg.nesting)
exit(1);
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg.buf;
hdr->nlmsg_len = nlmsg.pos - nlmsg.buf;
struct sockaddr_nl addr;
memset(&addr, 0, sizeof(addr));
addr.nl_family = AF_NETLINK;
unsigned n = sendto(sock, nlmsg.buf, hdr->nlmsg_len, 0,
(struct sockaddr*)&addr, sizeof(addr));
if (n != hdr->nlmsg_len)
exit(1);
n = recv(sock, nlmsg.buf, sizeof(nlmsg.buf), 0);
if (n < sizeof(struct nlmsghdr))
exit(1);
if (reply_len && hdr->nlmsg_type == reply_type) {
*reply_len = n;
return 0;
}
if (n < sizeof(struct nlmsghdr) + sizeof(struct nlmsgerr))
exit(1);
if (hdr->nlmsg_type != NLMSG_ERROR)
exit(1);
return -((struct nlmsgerr*)(hdr + 1))->error;
}
static int netlink_send(int sock)
{
return netlink_send_ext(sock, 0, NULL);
}
static void netlink_device_change(int sock, const char* name, bool up,
const char* master, const void* mac,
int macsize)
{
struct ifinfomsg hdr;
memset(&hdr, 0, sizeof(hdr));
if (up)
hdr.ifi_flags = hdr.ifi_change = IFF_UP;
netlink_init(RTM_NEWLINK, 0, &hdr, sizeof(hdr));
netlink_attr(IFLA_IFNAME, name, strlen(name));
if (master) {
int ifindex = if_nametoindex(master);
netlink_attr(IFLA_MASTER, &ifindex, sizeof(ifindex));
}
if (macsize)
netlink_attr(IFLA_ADDRESS, mac, macsize);
int err = netlink_send(sock);
(void)err;
}
static int netlink_add_addr(int sock, const char* dev, const void* addr,
int addrsize)
{
struct ifaddrmsg hdr;
memset(&hdr, 0, sizeof(hdr));
hdr.ifa_family = addrsize == 4 ? AF_INET : AF_INET6;
hdr.ifa_prefixlen = addrsize == 4 ? 24 : 120;
hdr.ifa_scope = RT_SCOPE_UNIVERSE;
hdr.ifa_index = if_nametoindex(dev);
netlink_init(RTM_NEWADDR, NLM_F_CREATE | NLM_F_REPLACE, &hdr, sizeof(hdr));
netlink_attr(IFA_LOCAL, addr, addrsize);
netlink_attr(IFA_ADDRESS, addr, addrsize);
return netlink_send(sock);
}
static void netlink_add_addr4(int sock, const char* dev, const char* addr)
{
struct in_addr in_addr;
inet_pton(AF_INET, addr, &in_addr);
int err = netlink_add_addr(sock, dev, &in_addr, sizeof(in_addr));
(void)err;
}
static void netlink_add_addr6(int sock, const char* dev, const char* addr)
{
struct in6_addr in6_addr;
inet_pton(AF_INET6, addr, &in6_addr);
int err = netlink_add_addr(sock, dev, &in6_addr, sizeof(in6_addr));
(void)err;
}
static void netlink_add_neigh(int sock, const char* name, const void* addr,
int addrsize, const void* mac, int macsize)
{
struct ndmsg hdr;
memset(&hdr, 0, sizeof(hdr));
hdr.ndm_family = addrsize == 4 ? AF_INET : AF_INET6;
hdr.ndm_ifindex = if_nametoindex(name);
hdr.ndm_state = NUD_PERMANENT;
netlink_init(RTM_NEWNEIGH, NLM_F_EXCL | NLM_F_CREATE, &hdr, sizeof(hdr));
netlink_attr(NDA_DST, addr, addrsize);
netlink_attr(NDA_LLADDR, mac, macsize);
int err = netlink_send(sock);
(void)err;
}
static int tunfd = -1;
static int tun_frags_enabled;
#define SYZ_TUN_MAX_PACKET_SIZE 1000
#define TUN_IFACE "syz_tun"
#define LOCAL_MAC 0xaaaaaaaaaaaa
#define REMOTE_MAC 0xaaaaaaaaaabb
#define LOCAL_IPV4 "172.20.20.170"
#define REMOTE_IPV4 "172.20.20.187"
#define LOCAL_IPV6 "fe80::aa"
#define REMOTE_IPV6 "fe80::bb"
#define IFF_NAPI 0x0010
#define IFF_NAPI_FRAGS 0x0020
static void initialize_tun(void)
{
tunfd = open("/dev/net/tun", O_RDWR | O_NONBLOCK);
if (tunfd == -1) {
printf("tun: can't open /dev/net/tun: please enable CONFIG_TUN=y\n");
printf("otherwise fuzzing or reproducing might not work as intended\n");
return;
}
const int kTunFd = 240;
if (dup2(tunfd, kTunFd) < 0)
exit(1);
close(tunfd);
tunfd = kTunFd;
struct ifreq ifr;
memset(&ifr, 0, sizeof(ifr));
strncpy(ifr.ifr_name, TUN_IFACE, IFNAMSIZ);
ifr.ifr_flags = IFF_TAP | IFF_NO_PI | IFF_NAPI | IFF_NAPI_FRAGS;
if (ioctl(tunfd, TUNSETIFF, (void*)&ifr) < 0) {
ifr.ifr_flags = IFF_TAP | IFF_NO_PI;
if (ioctl(tunfd, TUNSETIFF, (void*)&ifr) < 0)
exit(1);
}
if (ioctl(tunfd, TUNGETIFF, (void*)&ifr) < 0)
exit(1);
tun_frags_enabled = (ifr.ifr_flags & IFF_NAPI_FRAGS) != 0;
char sysctl[64];
sprintf(sysctl, "/proc/sys/net/ipv6/conf/%s/accept_dad", TUN_IFACE);
write_file(sysctl, "0");
sprintf(sysctl, "/proc/sys/net/ipv6/conf/%s/router_solicitations", TUN_IFACE);
write_file(sysctl, "0");
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
netlink_add_addr4(sock, TUN_IFACE, LOCAL_IPV4);
netlink_add_addr6(sock, TUN_IFACE, LOCAL_IPV6);
uint64_t macaddr = REMOTE_MAC;
struct in_addr in_addr;
inet_pton(AF_INET, REMOTE_IPV4, &in_addr);
netlink_add_neigh(sock, TUN_IFACE, &in_addr, sizeof(in_addr), &macaddr,
ETH_ALEN);
struct in6_addr in6_addr;
inet_pton(AF_INET6, REMOTE_IPV6, &in6_addr);
netlink_add_neigh(sock, TUN_IFACE, &in6_addr, sizeof(in6_addr), &macaddr,
ETH_ALEN);
macaddr = LOCAL_MAC;
netlink_device_change(sock, TUN_IFACE, true, 0, &macaddr, ETH_ALEN);
close(sock);
}
const int kInitNetNsFd = 239;
#define DEVLINK_FAMILY_NAME "devlink"
#define DEVLINK_CMD_RELOAD 37
#define DEVLINK_ATTR_BUS_NAME 1
#define DEVLINK_ATTR_DEV_NAME 2
#define DEVLINK_ATTR_NETNS_FD 137
static void netlink_devlink_netns_move(const char* bus_name,
const char* dev_name, int netns_fd)
{
struct genlmsghdr genlhdr;
struct nlattr* attr;
int sock, err, n;
uint16_t id = 0;
sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_GENERIC);
if (sock == -1)
exit(1);
memset(&genlhdr, 0, sizeof(genlhdr));
genlhdr.cmd = CTRL_CMD_GETFAMILY;
netlink_init(GENL_ID_CTRL, 0, &genlhdr, sizeof(genlhdr));
netlink_attr(CTRL_ATTR_FAMILY_NAME, DEVLINK_FAMILY_NAME,
strlen(DEVLINK_FAMILY_NAME) + 1);
err = netlink_send_ext(sock, GENL_ID_CTRL, &n);
if (err) {
goto error;
}
attr =
(struct nlattr*)(nlmsg.buf + NLMSG_HDRLEN + NLMSG_ALIGN(sizeof(genlhdr)));
for (; (char*)attr < nlmsg.buf + n;
attr = (struct nlattr*)((char*)attr + NLMSG_ALIGN(attr->nla_len))) {
if (attr->nla_type == CTRL_ATTR_FAMILY_ID) {
id = *(uint16_t*)(attr + 1);
break;
}
}
if (!id) {
goto error;
}
recv(sock, nlmsg.buf, sizeof(nlmsg.buf), 0); /* recv ack */
memset(&genlhdr, 0, sizeof(genlhdr));
genlhdr.cmd = DEVLINK_CMD_RELOAD;
netlink_init(id, 0, &genlhdr, sizeof(genlhdr));
netlink_attr(DEVLINK_ATTR_BUS_NAME, bus_name, strlen(bus_name) + 1);
netlink_attr(DEVLINK_ATTR_DEV_NAME, dev_name, strlen(dev_name) + 1);
netlink_attr(DEVLINK_ATTR_NETNS_FD, &netns_fd, sizeof(netns_fd));
netlink_send(sock);
error:
close(sock);
}
static void initialize_devlink_pci(void)
{
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
exit(1);
int ret = setns(kInitNetNsFd, 0);
if (ret == -1)
exit(1);
netlink_devlink_netns_move("pci", "0000:00:10.0", netns);
ret = setns(netns, 0);
if (ret == -1)
exit(1);
close(netns);
}
static int read_tun(char* data, int size)
{
if (tunfd < 0)
return -1;
int rv = read(tunfd, data, size);
if (rv < 0) {
if (errno == EAGAIN)
return -1;
if (errno == EBADFD)
return -1;
exit(1);
}
return rv;
}
static void flush_tun()
{
char data[SYZ_TUN_MAX_PACKET_SIZE];
while (read_tun(&data[0], sizeof(data)) != -1) {
}
}
#define MAX_FDS 30
static long syz_open_dev(volatile long a0, volatile long a1, volatile long a2)
{
if (a0 == 0xc || a0 == 0xb) {
char buf[128];
sprintf(buf, "/dev/%s/%d:%d", a0 == 0xc ? "char" : "block", (uint8_t)a1,
(uint8_t)a2);
return open(buf, O_RDWR, 0);
} else {
char buf[1024];
char* hash;
NONFAILING(strncpy(buf, (char*)a0, sizeof(buf) - 1));
buf[sizeof(buf) - 1] = 0;
while ((hash = strchr(buf, '#'))) {
*hash = '0' + (char)(a1 % 10);
a1 /= 10;
}
return open(buf, a2, 0);
}
}
#define XT_TABLE_SIZE 1536
#define XT_MAX_ENTRIES 10
struct xt_counters {
uint64_t pcnt, bcnt;
};
struct ipt_getinfo {
char name[32];
unsigned int valid_hooks;
unsigned int hook_entry[5];
unsigned int underflow[5];
unsigned int num_entries;
unsigned int size;
};
struct ipt_get_entries {
char name[32];
unsigned int size;
void* entrytable[XT_TABLE_SIZE / sizeof(void*)];
};
struct ipt_replace {
char name[32];
unsigned int valid_hooks;
unsigned int num_entries;
unsigned int size;
unsigned int hook_entry[5];
unsigned int underflow[5];
unsigned int num_counters;
struct xt_counters* counters;
char entrytable[XT_TABLE_SIZE];
};
struct ipt_table_desc {
const char* name;
struct ipt_getinfo info;
struct ipt_replace replace;
};
static struct ipt_table_desc ipv4_tables[] = {
{.name = "filter"}, {.name = "nat"}, {.name = "mangle"},
{.name = "raw"}, {.name = "security"},
};
static struct ipt_table_desc ipv6_tables[] = {
{.name = "filter"}, {.name = "nat"}, {.name = "mangle"},
{.name = "raw"}, {.name = "security"},
};
#define IPT_BASE_CTL 64
#define IPT_SO_SET_REPLACE (IPT_BASE_CTL)
#define IPT_SO_GET_INFO (IPT_BASE_CTL)
#define IPT_SO_GET_ENTRIES (IPT_BASE_CTL + 1)
struct arpt_getinfo {
char name[32];
unsigned int valid_hooks;
unsigned int hook_entry[3];
unsigned int underflow[3];
unsigned int num_entries;
unsigned int size;
};
struct arpt_get_entries {
char name[32];
unsigned int size;
void* entrytable[XT_TABLE_SIZE / sizeof(void*)];
};
struct arpt_replace {
char name[32];
unsigned int valid_hooks;
unsigned int num_entries;
unsigned int size;
unsigned int hook_entry[3];
unsigned int underflow[3];
unsigned int num_counters;
struct xt_counters* counters;
char entrytable[XT_TABLE_SIZE];
};
struct arpt_table_desc {
const char* name;
struct arpt_getinfo info;
struct arpt_replace replace;
};
static struct arpt_table_desc arpt_tables[] = {
{.name = "filter"},
};
#define ARPT_BASE_CTL 96
#define ARPT_SO_SET_REPLACE (ARPT_BASE_CTL)
#define ARPT_SO_GET_INFO (ARPT_BASE_CTL)
#define ARPT_SO_GET_ENTRIES (ARPT_BASE_CTL + 1)
static void checkpoint_iptables(struct ipt_table_desc* tables, int num_tables,
int family, int level)
{
struct ipt_get_entries entries;
socklen_t optlen;
int fd, i;
fd = socket(family, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < num_tables; i++) {
struct ipt_table_desc* table = &tables[i];
strcpy(table->info.name, table->name);
strcpy(table->replace.name, table->name);
optlen = sizeof(table->info);
if (getsockopt(fd, level, IPT_SO_GET_INFO, &table->info, &optlen)) {
switch (errno) {
case EPERM:
case ENOENT:
case ENOPROTOOPT:
continue;
}
exit(1);
}
if (table->info.size > sizeof(table->replace.entrytable))
exit(1);
if (table->info.num_entries > XT_MAX_ENTRIES)
exit(1);
memset(&entries, 0, sizeof(entries));
strcpy(entries.name, table->name);
entries.size = table->info.size;
optlen = sizeof(entries) - sizeof(entries.entrytable) + table->info.size;
if (getsockopt(fd, level, IPT_SO_GET_ENTRIES, &entries, &optlen))
exit(1);
table->replace.valid_hooks = table->info.valid_hooks;
table->replace.num_entries = table->info.num_entries;
table->replace.size = table->info.size;
memcpy(table->replace.hook_entry, table->info.hook_entry,
sizeof(table->replace.hook_entry));
memcpy(table->replace.underflow, table->info.underflow,
sizeof(table->replace.underflow));
memcpy(table->replace.entrytable, entries.entrytable, table->info.size);
}
close(fd);
}
static void reset_iptables(struct ipt_table_desc* tables, int num_tables,
int family, int level)
{
struct xt_counters counters[XT_MAX_ENTRIES];
struct ipt_get_entries entries;
struct ipt_getinfo info;
socklen_t optlen;
int fd, i;
fd = socket(family, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < num_tables; i++) {
struct ipt_table_desc* table = &tables[i];
if (table->info.valid_hooks == 0)
continue;
memset(&info, 0, sizeof(info));
strcpy(info.name, table->name);
optlen = sizeof(info);
if (getsockopt(fd, level, IPT_SO_GET_INFO, &info, &optlen))
exit(1);
if (memcmp(&table->info, &info, sizeof(table->info)) == 0) {
memset(&entries, 0, sizeof(entries));
strcpy(entries.name, table->name);
entries.size = table->info.size;
optlen = sizeof(entries) - sizeof(entries.entrytable) + entries.size;
if (getsockopt(fd, level, IPT_SO_GET_ENTRIES, &entries, &optlen))
exit(1);
if (memcmp(table->replace.entrytable, entries.entrytable,
table->info.size) == 0)
continue;
}
table->replace.num_counters = info.num_entries;
table->replace.counters = counters;
optlen = sizeof(table->replace) - sizeof(table->replace.entrytable) +
table->replace.size;
if (setsockopt(fd, level, IPT_SO_SET_REPLACE, &table->replace, optlen))
exit(1);
}
close(fd);
}
static void checkpoint_arptables(void)
{
struct arpt_get_entries entries;
socklen_t optlen;
unsigned i;
int fd;
fd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < sizeof(arpt_tables) / sizeof(arpt_tables[0]); i++) {
struct arpt_table_desc* table = &arpt_tables[i];
strcpy(table->info.name, table->name);
strcpy(table->replace.name, table->name);
optlen = sizeof(table->info);
if (getsockopt(fd, SOL_IP, ARPT_SO_GET_INFO, &table->info, &optlen)) {
switch (errno) {
case EPERM:
case ENOENT:
case ENOPROTOOPT:
continue;
}
exit(1);
}
if (table->info.size > sizeof(table->replace.entrytable))
exit(1);
if (table->info.num_entries > XT_MAX_ENTRIES)
exit(1);
memset(&entries, 0, sizeof(entries));
strcpy(entries.name, table->name);
entries.size = table->info.size;
optlen = sizeof(entries) - sizeof(entries.entrytable) + table->info.size;
if (getsockopt(fd, SOL_IP, ARPT_SO_GET_ENTRIES, &entries, &optlen))
exit(1);
table->replace.valid_hooks = table->info.valid_hooks;
table->replace.num_entries = table->info.num_entries;
table->replace.size = table->info.size;
memcpy(table->replace.hook_entry, table->info.hook_entry,
sizeof(table->replace.hook_entry));
memcpy(table->replace.underflow, table->info.underflow,
sizeof(table->replace.underflow));
memcpy(table->replace.entrytable, entries.entrytable, table->info.size);
}
close(fd);
}
static void reset_arptables()
{
struct xt_counters counters[XT_MAX_ENTRIES];
struct arpt_get_entries entries;
struct arpt_getinfo info;
socklen_t optlen;
unsigned i;
int fd;
fd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < sizeof(arpt_tables) / sizeof(arpt_tables[0]); i++) {
struct arpt_table_desc* table = &arpt_tables[i];
if (table->info.valid_hooks == 0)
continue;
memset(&info, 0, sizeof(info));
strcpy(info.name, table->name);
optlen = sizeof(info);
if (getsockopt(fd, SOL_IP, ARPT_SO_GET_INFO, &info, &optlen))
exit(1);
if (memcmp(&table->info, &info, sizeof(table->info)) == 0) {
memset(&entries, 0, sizeof(entries));
strcpy(entries.name, table->name);
entries.size = table->info.size;
optlen = sizeof(entries) - sizeof(entries.entrytable) + entries.size;
if (getsockopt(fd, SOL_IP, ARPT_SO_GET_ENTRIES, &entries, &optlen))
exit(1);
if (memcmp(table->replace.entrytable, entries.entrytable,
table->info.size) == 0)
continue;
} else {
}
table->replace.num_counters = info.num_entries;
table->replace.counters = counters;
optlen = sizeof(table->replace) - sizeof(table->replace.entrytable) +
table->replace.size;
if (setsockopt(fd, SOL_IP, ARPT_SO_SET_REPLACE, &table->replace, optlen))
exit(1);
}
close(fd);
}
#define NF_BR_NUMHOOKS 6
#define EBT_TABLE_MAXNAMELEN 32
#define EBT_CHAIN_MAXNAMELEN 32
#define EBT_BASE_CTL 128
#define EBT_SO_SET_ENTRIES (EBT_BASE_CTL)
#define EBT_SO_GET_INFO (EBT_BASE_CTL)
#define EBT_SO_GET_ENTRIES (EBT_SO_GET_INFO + 1)
#define EBT_SO_GET_INIT_INFO (EBT_SO_GET_ENTRIES + 1)
#define EBT_SO_GET_INIT_ENTRIES (EBT_SO_GET_INIT_INFO + 1)
struct ebt_replace {
char name[EBT_TABLE_MAXNAMELEN];
unsigned int valid_hooks;
unsigned int nentries;
unsigned int entries_size;
struct ebt_entries* hook_entry[NF_BR_NUMHOOKS];
unsigned int num_counters;
struct ebt_counter* counters;
char* entries;
};
struct ebt_entries {
unsigned int distinguisher;
char name[EBT_CHAIN_MAXNAMELEN];
unsigned int counter_offset;
int policy;
unsigned int nentries;
char data[0] __attribute__((aligned(__alignof__(struct ebt_replace))));
};
struct ebt_table_desc {
const char* name;
struct ebt_replace replace;
char entrytable[XT_TABLE_SIZE];
};
static struct ebt_table_desc ebt_tables[] = {
{.name = "filter"}, {.name = "nat"}, {.name = "broute"},
};
static void checkpoint_ebtables(void)
{
socklen_t optlen;
unsigned i;
int fd;
fd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < sizeof(ebt_tables) / sizeof(ebt_tables[0]); i++) {
struct ebt_table_desc* table = &ebt_tables[i];
strcpy(table->replace.name, table->name);
optlen = sizeof(table->replace);
if (getsockopt(fd, SOL_IP, EBT_SO_GET_INIT_INFO, &table->replace,
&optlen)) {
switch (errno) {
case EPERM:
case ENOENT:
case ENOPROTOOPT:
continue;
}
exit(1);
}
if (table->replace.entries_size > sizeof(table->entrytable))
exit(1);
table->replace.num_counters = 0;
table->replace.entries = table->entrytable;
optlen = sizeof(table->replace) + table->replace.entries_size;
if (getsockopt(fd, SOL_IP, EBT_SO_GET_INIT_ENTRIES, &table->replace,
&optlen))
exit(1);
}
close(fd);
}
static void reset_ebtables()
{
struct ebt_replace replace;
char entrytable[XT_TABLE_SIZE];
socklen_t optlen;
unsigned i, j, h;
int fd;
fd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (fd == -1) {
switch (errno) {
case EAFNOSUPPORT:
case ENOPROTOOPT:
return;
}
exit(1);
}
for (i = 0; i < sizeof(ebt_tables) / sizeof(ebt_tables[0]); i++) {
struct ebt_table_desc* table = &ebt_tables[i];
if (table->replace.valid_hooks == 0)
continue;
memset(&replace, 0, sizeof(replace));
strcpy(replace.name, table->name);
optlen = sizeof(replace);
if (getsockopt(fd, SOL_IP, EBT_SO_GET_INFO, &replace, &optlen))
exit(1);
replace.num_counters = 0;
table->replace.entries = 0;
for (h = 0; h < NF_BR_NUMHOOKS; h++)
table->replace.hook_entry[h] = 0;
if (memcmp(&table->replace, &replace, sizeof(table->replace)) == 0) {
memset(&entrytable, 0, sizeof(entrytable));
replace.entries = entrytable;
optlen = sizeof(replace) + replace.entries_size;
if (getsockopt(fd, SOL_IP, EBT_SO_GET_ENTRIES, &replace, &optlen))
exit(1);
if (memcmp(table->entrytable, entrytable, replace.entries_size) == 0)
continue;
}
for (j = 0, h = 0; h < NF_BR_NUMHOOKS; h++) {
if (table->replace.valid_hooks & (1 << h)) {
table->replace.hook_entry[h] =
(struct ebt_entries*)table->entrytable + j;
j++;
}
}
table->replace.entries = table->entrytable;
optlen = sizeof(table->replace) + table->replace.entries_size;
if (setsockopt(fd, SOL_IP, EBT_SO_SET_ENTRIES, &table->replace, optlen))
exit(1);
}
close(fd);
}
static void checkpoint_net_namespace(void)
{
checkpoint_ebtables();
checkpoint_arptables();
checkpoint_iptables(ipv4_tables, sizeof(ipv4_tables) / sizeof(ipv4_tables[0]),
AF_INET, SOL_IP);
checkpoint_iptables(ipv6_tables, sizeof(ipv6_tables) / sizeof(ipv6_tables[0]),
AF_INET6, SOL_IPV6);
}
static void reset_net_namespace(void)
{
reset_ebtables();
reset_arptables();
reset_iptables(ipv4_tables, sizeof(ipv4_tables) / sizeof(ipv4_tables[0]),
AF_INET, SOL_IP);
reset_iptables(ipv6_tables, sizeof(ipv6_tables) / sizeof(ipv6_tables[0]),
AF_INET6, SOL_IPV6);
}
static void setup_cgroups()
{
if (mkdir("/syzcgroup", 0777)) {
}
if (mkdir("/syzcgroup/unified", 0777)) {
}
if (mount("none", "/syzcgroup/unified", "cgroup2", 0, NULL)) {
}
if (chmod("/syzcgroup/unified", 0777)) {
}
write_file("/syzcgroup/unified/cgroup.subtree_control",
"+cpu +memory +io +pids +rdma");
if (mkdir("/syzcgroup/cpu", 0777)) {
}
if (mount("none", "/syzcgroup/cpu", "cgroup", 0,
"cpuset,cpuacct,perf_event,hugetlb")) {
}
write_file("/syzcgroup/cpu/cgroup.clone_children", "1");
if (chmod("/syzcgroup/cpu", 0777)) {
}
if (mkdir("/syzcgroup/net", 0777)) {
}
if (mount("none", "/syzcgroup/net", "cgroup", 0,
"net_cls,net_prio,devices,freezer")) {
}
if (chmod("/syzcgroup/net", 0777)) {
}
}
static void setup_cgroups_loop()
{
int pid = getpid();
char file[128];
char cgroupdir[64];
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/unified/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/pids.max", cgroupdir);
write_file(file, "32");
snprintf(file, sizeof(file), "%s/memory.low", cgroupdir);
write_file(file, "%d", 298 << 20);
snprintf(file, sizeof(file), "%s/memory.high", cgroupdir);
write_file(file, "%d", 299 << 20);
snprintf(file, sizeof(file), "%s/memory.max", cgroupdir);
write_file(file, "%d", 300 << 20);
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/cpu/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/net/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
}
static void setup_cgroups_test()
{
char cgroupdir[64];
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/unified/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup")) {
}
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/cpu/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup.cpu")) {
}
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/net/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup.net")) {
}
}
static void setup_common()
{
if (mount(0, "/sys/fs/fuse/connections", "fusectl", 0, 0)) {
}
setup_cgroups();
}
static void loop();
static void sandbox_common()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setsid();
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
exit(1);
if (dup2(netns, kInitNetNsFd) < 0)
exit(1);
close(netns);
struct rlimit rlim;
rlim.rlim_cur = rlim.rlim_max = (200 << 20);
setrlimit(RLIMIT_AS, &rlim);
rlim.rlim_cur = rlim.rlim_max = 32 << 20;
setrlimit(RLIMIT_MEMLOCK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 136 << 20;
setrlimit(RLIMIT_FSIZE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 1 << 20;
setrlimit(RLIMIT_STACK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 0;
setrlimit(RLIMIT_CORE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 256;
setrlimit(RLIMIT_NOFILE, &rlim);
if (unshare(CLONE_NEWNS)) {
}
if (unshare(CLONE_NEWIPC)) {
}
if (unshare(0x02000000)) {
}
if (unshare(CLONE_NEWUTS)) {
}
if (unshare(CLONE_SYSVSEM)) {
}
typedef struct {
const char* name;
const char* value;
} sysctl_t;
static const sysctl_t sysctls[] = {
{"/proc/sys/kernel/shmmax", "16777216"},
{"/proc/sys/kernel/shmall", "536870912"},
{"/proc/sys/kernel/shmmni", "1024"},
{"/proc/sys/kernel/msgmax", "8192"},
{"/proc/sys/kernel/msgmni", "1024"},
{"/proc/sys/kernel/msgmnb", "1024"},
{"/proc/sys/kernel/sem", "1024 1048576 500 1024"},
};
unsigned i;
for (i = 0; i < sizeof(sysctls) / sizeof(sysctls[0]); i++)
write_file(sysctls[i].name, sysctls[i].value);
}
int wait_for_loop(int pid)
{
if (pid < 0)
exit(1);
int status = 0;
while (waitpid(-1, &status, __WALL) != pid) {
}
return WEXITSTATUS(status);
}
static void drop_caps(void)
{
struct __user_cap_header_struct cap_hdr = {};
struct __user_cap_data_struct cap_data[2] = {};
cap_hdr.version = _LINUX_CAPABILITY_VERSION_3;
cap_hdr.pid = getpid();
if (syscall(SYS_capget, &cap_hdr, &cap_data))
exit(1);
const int drop = (1 << CAP_SYS_PTRACE) | (1 << CAP_SYS_NICE);
cap_data[0].effective &= ~drop;
cap_data[0].permitted &= ~drop;
cap_data[0].inheritable &= ~drop;
if (syscall(SYS_capset, &cap_hdr, &cap_data))
exit(1);
}
static int do_sandbox_none(void)
{
if (unshare(CLONE_NEWPID)) {
}
int pid = fork();
if (pid != 0)
return wait_for_loop(pid);
setup_common();
sandbox_common();
drop_caps();
if (unshare(CLONE_NEWNET)) {
}
initialize_devlink_pci();
initialize_tun();
loop();
exit(1);
}
#define FS_IOC_SETFLAGS _IOW('f', 2, long)
static void remove_dir(const char* dir)
{
DIR* dp;
struct dirent* ep;
int iter = 0;
retry:
while (umount2(dir, MNT_DETACH) == 0) {
}
dp = opendir(dir);
if (dp == NULL) {
if (errno == EMFILE) {
exit(1);
}
exit(1);
}
while ((ep = readdir(dp))) {
if (strcmp(ep->d_name, ".") == 0 || strcmp(ep->d_name, "..") == 0)
continue;
char filename[FILENAME_MAX];
snprintf(filename, sizeof(filename), "%s/%s", dir, ep->d_name);
while (umount2(filename, MNT_DETACH) == 0) {
}
struct stat st;
if (lstat(filename, &st))
exit(1);
if (S_ISDIR(st.st_mode)) {
remove_dir(filename);
continue;
}
int i;
for (i = 0;; i++) {
if (unlink(filename) == 0)
break;
if (errno == EPERM) {
int fd = open(filename, O_RDONLY);
if (fd != -1) {
long flags = 0;
if (ioctl(fd, FS_IOC_SETFLAGS, &flags) == 0)
close(fd);
continue;
}
}
if (errno == EROFS) {
break;
}
if (errno != EBUSY || i > 100)
exit(1);
if (umount2(filename, MNT_DETACH))
exit(1);
}
}
closedir(dp);
int i;
for (i = 0;; i++) {
if (rmdir(dir) == 0)
break;
if (i < 100) {
if (errno == EPERM) {
int fd = open(dir, O_RDONLY);
if (fd != -1) {
long flags = 0;
if (ioctl(fd, FS_IOC_SETFLAGS, &flags) == 0)
close(fd);
continue;
}
}
if (errno == EROFS) {
break;
}
if (errno == EBUSY) {
if (umount2(dir, MNT_DETACH))
exit(1);
continue;
}
if (errno == ENOTEMPTY) {
if (iter < 100) {
iter++;
goto retry;
}
}
}
exit(1);
}
}
static void kill_and_wait(int pid, int* status)
{
kill(-pid, SIGKILL);
kill(pid, SIGKILL);
int i;
for (i = 0; i < 100; i++) {
if (waitpid(-1, status, WNOHANG | __WALL) == pid)
return;
usleep(1000);
}
DIR* dir = opendir("/sys/fs/fuse/connections");
if (dir) {
for (;;) {
struct dirent* ent = readdir(dir);
if (!ent)
break;
if (strcmp(ent->d_name, ".") == 0 || strcmp(ent->d_name, "..") == 0)
continue;
char abort[300];
snprintf(abort, sizeof(abort), "/sys/fs/fuse/connections/%s/abort",
ent->d_name);
int fd = open(abort, O_WRONLY);
if (fd == -1) {
continue;
}
if (write(fd, abort, 1) < 0) {
}
close(fd);
}
closedir(dir);
} else {
}
while (waitpid(-1, status, __WALL) != pid) {
}
}
static void setup_loop()
{
setup_cgroups_loop();
checkpoint_net_namespace();
}
static void reset_loop()
{
reset_net_namespace();
}
static void setup_test()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setup_cgroups_test();
write_file("/proc/self/oom_score_adj", "1000");
flush_tun();
}
static void close_fds()
{
int fd;
for (fd = 3; fd < MAX_FDS; fd++)
close(fd);
}
static void setup_binfmt_misc()
{
if (mount(0, "/proc/sys/fs/binfmt_misc", "binfmt_misc", 0, 0)) {
}
write_file("/proc/sys/fs/binfmt_misc/register", ":syz0:M:0:\x01::./file0:");
write_file("/proc/sys/fs/binfmt_misc/register",
":syz1:M:1:\x02::./file0:POC");
}
static void execute_one(void);
#define WAIT_FLAGS __WALL
static void loop(void)
{
setup_loop();
int iter;
for (iter = 0;; iter++) {
char cwdbuf[32];
sprintf(cwdbuf, "./%d", iter);
if (mkdir(cwdbuf, 0777))
exit(1);
reset_loop();
int pid = fork();
if (pid < 0)
exit(1);
if (pid == 0) {
if (chdir(cwdbuf))
exit(1);
setup_test();
execute_one();
close_fds();
exit(0);
}
int status = 0;
uint64_t start = current_time_ms();
for (;;) {
if (waitpid(-1, &status, WNOHANG | WAIT_FLAGS) == pid)
break;
sleep_ms(1);
if (current_time_ms() - start < 5 * 1000)
continue;
kill_and_wait(pid, &status);
break;
}
remove_dir(cwdbuf);
}
}
uint64_t r[4] = {0x0, 0xffffffffffffffff, 0x0, 0xffffffffffffffff};
void execute_one(void)
{
intptr_t res = 0;
NONFAILING(memcpy((void*)0x20000300, "./file0\000", 8));
syscall(__NR_creat, 0x20000300, 0);
syscall(__NR_clone, 0x2000100, 0, 0x9999999999999999, 0, -1);
NONFAILING(memcpy((void*)0x20000140, "./file0\000", 8));
NONFAILING(memcpy((void*)0x20000180, "devpts\000", 7));
NONFAILING(memcpy((void*)0x20000200, "devpts\000", 7));
syscall(__NR_mount, 0, 0x20000140, 0x20000180, 0, 0x20000200);
res = syscall(__NR_gettid);
if (res != -1)
r[0] = res;
syscall(__NR_tkill, r[0], 0x3c);
syscall(__NR_getpid);
syscall(__NR_write, -1, 0, 0);
NONFAILING(memcpy((void*)0x200009c0, "/dev/loop-control\000", 18));
res = syscall(__NR_openat, 0xffffffffffffff9c, 0x200009c0, 0, 0);
if (res != -1)
r[1] = res;
res = syscall(__NR_ioctl, r[1], 0x4c82, 0);
if (res != -1)
r[2] = res;
syscall(__NR_ioctl, r[1], 0x4c81, r[2]);
syscall(__NR_ioctl, -1, 0x4c80, r[2]);
NONFAILING(memcpy((void*)0x200001c0, "/dev/loop#\000", 11));
res = syz_open_dev(0x200001c0, 0, 0);
if (res != -1)
r[3] = res;
NONFAILING(*(uint8_t*)0x20000040 = 0);
NONFAILING(*(uint8_t*)0x20000041 = 0);
NONFAILING(*(uint8_t*)0x20000042 = 0);
NONFAILING(*(uint8_t*)0x20000043 = 0);
NONFAILING(*(uint8_t*)0x20000044 = 0);
NONFAILING(*(uint8_t*)0x20000045 = 0);
NONFAILING(*(uint8_t*)0x20000046 = 0);
NONFAILING(*(uint8_t*)0x20000047 = 0);
NONFAILING(*(uint8_t*)0x20000048 = 0);
NONFAILING(*(uint8_t*)0x20000049 = 0);
NONFAILING(*(uint8_t*)0x2000004a = 0);
NONFAILING(*(uint8_t*)0x2000004b = 0);
NONFAILING(*(uint8_t*)0x2000004c = 0);
NONFAILING(*(uint8_t*)0x2000004d = 0);
NONFAILING(*(uint8_t*)0x2000004e = 0);
NONFAILING(*(uint8_t*)0x2000004f = 0);
NONFAILING(*(uint8_t*)0x20000050 = 0);
NONFAILING(*(uint8_t*)0x20000051 = 0);
NONFAILING(*(uint8_t*)0x20000052 = 0);
NONFAILING(*(uint8_t*)0x20000053 = 0);
NONFAILING(*(uint8_t*)0x20000054 = 0);
NONFAILING(*(uint8_t*)0x20000055 = 0);
NONFAILING(*(uint8_t*)0x20000056 = 0);
NONFAILING(*(uint8_t*)0x20000057 = 0);
NONFAILING(*(uint8_t*)0x20000058 = 0);
NONFAILING(*(uint8_t*)0x20000059 = 0);
NONFAILING(*(uint8_t*)0x2000005a = 0);
NONFAILING(*(uint8_t*)0x2000005b = 0);
NONFAILING(*(uint8_t*)0x2000005c = 0);
NONFAILING(*(uint8_t*)0x2000005d = 0);
NONFAILING(*(uint8_t*)0x2000005e = 0);
NONFAILING(*(uint8_t*)0x2000005f = 0);
NONFAILING(*(uint16_t*)0x20000060 = 0);
NONFAILING(*(uint32_t*)0x20000064 = 9);
NONFAILING(*(uint32_t*)0x20000068 = 0x200);
NONFAILING(*(uint64_t*)0x20000070 = 0);
NONFAILING(*(uint64_t*)0x20000078 = 0);
NONFAILING(*(uint32_t*)0x20000080 = 0);
syscall(__NR_ioctl, r[3], 0xc0481273, 0x20000040);
syscall(__NR_ioctl, r[3], 0x1274, 0);
}
int main(void)
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
setup_binfmt_misc();
install_segv_handler();
use_temporary_dir();
do_sandbox_none();
return 0;
}
|
the_stack_data/1212094.c
|
#include <stdio.h>
typedef short int16_t;
static int16_t a;
static int16_t b;
static int16_t c[2][2];
static int16_t i;
int main(void) {
a = 2;
b = a + 1;
c[0][0] = a;
c[0][1] = b;
c[1][0] = a;
c[1][1] = b;
printf("[ ");
for (i = 0; i < 2; i++) {
if (i != 0)
printf(", ");
printf("[ %d, %d ]", c[i][0], c[i][1]);
}
printf(" ]\n");
return 0;
}
|
the_stack_data/92327100.c
|
#ifdef __STDC__
#include <stdlib.h>
#endif
#include <stdio.h>
#include <math.h>
#include <ctype.h>
#define PI 3.141592653589792434
#define MAXSOUND 1000000 /* 1M should be enough */
int CurrentSoundStart = 0, Length;
int MaxSamples = -1;
float InputGain = 1.0;
float SamplingRate = 22254.5454545454;
float Output[MAXSOUND];
main(argc, argv)
int argc;
char **argv;
{
register int i, j;
float *Buffer;
for (i=1;i<argc;i++){
if (strncmp(argv[i],"-bee",4) == 0){
fprintf(stderr,"Adding a 0.25 second beep.\n");
for (j=0;j<SamplingRate/4.0;j++)
Output[CurrentSoundStart++] =
0.25*sin(j/SamplingRate*400*2*PI);
}
else if (strncmp(argv[i],"-sil",4) == 0){
float Length = 1.0;
if (isdigit(argv[i+1][0])){
Length = atof(argv[++i]);
}
fprintf(stderr, "Adding %g seconds of silence.\n",
Length);
CurrentSoundStart += Length*SamplingRate;
}
else {
extern float *ReadInputFile();
fprintf(stderr,"Reading %s ", argv[i]);
fflush(stderr);
Buffer = ReadInputFile(argv[i], &SamplingRate, &Length);
fprintf(stderr, "(%g seconds at %g samples/sec.)\n",
Length/SamplingRate, SamplingRate);
for (j=0;j<Length;j++)
Output[CurrentSoundStart++] = Buffer[j];
free(Buffer);
}
}
WriteAiffFile("-",SamplingRate, CurrentSoundStart, Output, 1);
/*
WriteADCFile("-", SamplingRate, CurrentSoundStart, Output);
WriteByteFile("-", CurrentSoundStart, Output);
*/
}
float *
NewFloatArray(size,usage)
int size;
char *usage;
{
float *p;
p = (float *)calloc(sizeof(*p),size);
if (!p){
fprintf(stderr,"%s: Can't allocate %ld floats.\n", size);
exit(1);
}
return p;
}
|
the_stack_data/232954504.c
|
/* Taxonomy Classification: 0000000000000043000000 */
/*
* WRITE/READ 0 write
* WHICH BOUND 0 upper
* DATA TYPE 0 char
* MEMORY LOCATION 0 stack
* SCOPE 0 same
* CONTAINER 0 no
* POINTER 0 no
* INDEX COMPLEXITY 0 constant
* ADDRESS COMPLEXITY 0 constant
* LENGTH COMPLEXITY 0 N/A
* ADDRESS ALIAS 0 none
* INDEX ALIAS 0 none
* LOCAL CONTROL FLOW 0 none
* SECONDARY CONTROL FLOW 0 none
* LOOP STRUCTURE 4 non-standard for
* LOOP COMPLEXITY 3 two
* ASYNCHRONY 0 no
* TAINT 0 no
* RUNTIME ENV. DEPENDENCE 0 no
* MAGNITUDE 0 no overflow
* CONTINUOUS/DISCRETE 0 discrete
* SIGNEDNESS 0 no
*/
/*
Copyright 2005 Massachusetts Institute of Technology
All rights reserved.
Redistribution and use of software in source and binary forms, with or without
modification, are permitted provided that the following conditions are met.
- Redistributions of source code must retain the above copyright notice,
this set of conditions and the disclaimer below.
- Redistributions in binary form must reproduce the copyright notice, this
set of conditions, and the disclaimer below in the documentation and/or
other materials provided with the distribution.
- Neither the name of the Massachusetts Institute of Technology nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS".
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
int main(int argc, char *argv[])
{
int init_value;
int inc_value;
int loop_counter;
char buf[10];
init_value = 0;
inc_value = 9 - (9 - 1);
for(loop_counter = init_value; loop_counter <= 9; )
{
/* OK */
buf[9] = 'A';
loop_counter += inc_value;
}
return 0;
}
|
the_stack_data/50137971.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_2__ TYPE_1__ ;
/* Type definitions */
typedef int uint32_t ;
struct msk_txdesc {int /*<<< orphan*/ * tx_m; int /*<<< orphan*/ tx_dmamap; } ;
struct msk_softc {int msk_intrmask; int msk_intrhwemask; } ;
struct msk_rxdesc {int /*<<< orphan*/ * rx_m; int /*<<< orphan*/ rx_dmamap; } ;
struct TYPE_2__ {int /*<<< orphan*/ msk_tx_tag; struct msk_txdesc* msk_txdesc; int /*<<< orphan*/ msk_jumbo_rx_tag; struct msk_rxdesc* msk_jumbo_rxdesc; int /*<<< orphan*/ msk_rx_tag; struct msk_rxdesc* msk_rxdesc; } ;
struct msk_if_softc {scalar_t__ msk_port; int /*<<< orphan*/ msk_flags; TYPE_1__ msk_cdata; int /*<<< orphan*/ msk_rxq; int /*<<< orphan*/ msk_if_dev; int /*<<< orphan*/ msk_txq; scalar_t__ msk_watchdog_timer; int /*<<< orphan*/ msk_tick_ch; struct ifnet* msk_ifp; struct msk_softc* msk_softc; } ;
struct ifnet {int if_drv_flags; } ;
/* Variables and functions */
int /*<<< orphan*/ B0_HWE_IMSK ;
int /*<<< orphan*/ B0_IMSK ;
int BMU_FIFO_RST ;
int BMU_IDLE ;
int BMU_RST_SET ;
int BMU_STOP ;
int /*<<< orphan*/ BUS_DMASYNC_POSTREAD ;
int /*<<< orphan*/ BUS_DMASYNC_POSTWRITE ;
scalar_t__ CSR_READ_1 (struct msk_softc*,int /*<<< orphan*/ ) ;
int CSR_READ_4 (struct msk_softc*,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ CSR_WRITE_1 (struct msk_softc*,int /*<<< orphan*/ ,int) ;
int /*<<< orphan*/ CSR_WRITE_4 (struct msk_softc*,int /*<<< orphan*/ ,int) ;
int /*<<< orphan*/ DELAY (int) ;
int /*<<< orphan*/ GMAC_CTRL ;
int /*<<< orphan*/ GMAC_IRQ_MSK ;
int GMAC_READ_2 (struct msk_softc*,scalar_t__,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ GMAC_WRITE_2 (struct msk_softc*,scalar_t__,int /*<<< orphan*/ ,int) ;
int GMC_PAUSE_OFF ;
int GMF_RST_SET ;
int GM_GPCR_RX_ENA ;
int GM_GPCR_TX_ENA ;
int /*<<< orphan*/ GM_GP_CTRL ;
int IFF_DRV_OACTIVE ;
int IFF_DRV_RUNNING ;
int /*<<< orphan*/ MR_ADDR (scalar_t__,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ MSK_FLAG_LINK ;
int /*<<< orphan*/ MSK_IF_LOCK_ASSERT (struct msk_if_softc*) ;
int MSK_JUMBO_RX_RING_CNT ;
scalar_t__ MSK_PORT_A ;
int MSK_RX_RING_CNT ;
int MSK_TIMEOUT ;
int MSK_TX_RING_CNT ;
int /*<<< orphan*/ PHY_ADDR_MARV ;
int /*<<< orphan*/ PHY_MARV_INT_MASK ;
int /*<<< orphan*/ PREF_UNIT_CTRL_REG ;
int PREF_UNIT_RST_SET ;
int /*<<< orphan*/ Q_ADDR (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ Q_CSR ;
int /*<<< orphan*/ Q_RL ;
int /*<<< orphan*/ Q_RSL ;
int /*<<< orphan*/ RB_ADDR (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ RB_CTRL ;
int RB_DIS_OP_MD ;
int RB_RST_SET ;
int /*<<< orphan*/ RX_GMF_CTRL_T ;
int /*<<< orphan*/ TXA_CTRL ;
int TXA_DIS_ARB ;
int /*<<< orphan*/ TX_GMF_CTRL_T ;
int Y2_HWE_L1_MASK ;
int Y2_HWE_L2_MASK ;
int Y2_IS_PORT_A ;
int Y2_IS_PORT_B ;
int /*<<< orphan*/ Y2_PREF_Q_ADDR (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ bus_dmamap_sync (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ bus_dmamap_unload (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ callout_stop (int /*<<< orphan*/ *) ;
int /*<<< orphan*/ device_printf (int /*<<< orphan*/ ,char*) ;
int /*<<< orphan*/ m_freem (int /*<<< orphan*/ *) ;
int /*<<< orphan*/ msk_phy_writereg (struct msk_if_softc*,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ msk_stats_update (struct msk_if_softc*) ;
__attribute__((used)) static void
msk_stop(struct msk_if_softc *sc_if)
{
struct msk_softc *sc;
struct msk_txdesc *txd;
struct msk_rxdesc *rxd;
struct msk_rxdesc *jrxd;
struct ifnet *ifp;
uint32_t val;
int i;
MSK_IF_LOCK_ASSERT(sc_if);
sc = sc_if->msk_softc;
ifp = sc_if->msk_ifp;
callout_stop(&sc_if->msk_tick_ch);
sc_if->msk_watchdog_timer = 0;
/* Disable interrupts. */
if (sc_if->msk_port == MSK_PORT_A) {
sc->msk_intrmask &= ~Y2_IS_PORT_A;
sc->msk_intrhwemask &= ~Y2_HWE_L1_MASK;
} else {
sc->msk_intrmask &= ~Y2_IS_PORT_B;
sc->msk_intrhwemask &= ~Y2_HWE_L2_MASK;
}
CSR_WRITE_4(sc, B0_HWE_IMSK, sc->msk_intrhwemask);
CSR_READ_4(sc, B0_HWE_IMSK);
CSR_WRITE_4(sc, B0_IMSK, sc->msk_intrmask);
CSR_READ_4(sc, B0_IMSK);
/* Disable Tx/Rx MAC. */
val = GMAC_READ_2(sc, sc_if->msk_port, GM_GP_CTRL);
val &= ~(GM_GPCR_RX_ENA | GM_GPCR_TX_ENA);
GMAC_WRITE_2(sc, sc_if->msk_port, GM_GP_CTRL, val);
/* Read again to ensure writing. */
GMAC_READ_2(sc, sc_if->msk_port, GM_GP_CTRL);
/* Update stats and clear counters. */
msk_stats_update(sc_if);
/* Stop Tx BMU. */
CSR_WRITE_4(sc, Q_ADDR(sc_if->msk_txq, Q_CSR), BMU_STOP);
val = CSR_READ_4(sc, Q_ADDR(sc_if->msk_txq, Q_CSR));
for (i = 0; i < MSK_TIMEOUT; i++) {
if ((val & (BMU_STOP | BMU_IDLE)) == 0) {
CSR_WRITE_4(sc, Q_ADDR(sc_if->msk_txq, Q_CSR),
BMU_STOP);
val = CSR_READ_4(sc, Q_ADDR(sc_if->msk_txq, Q_CSR));
} else
break;
DELAY(1);
}
if (i == MSK_TIMEOUT)
device_printf(sc_if->msk_if_dev, "Tx BMU stop failed\n");
CSR_WRITE_1(sc, RB_ADDR(sc_if->msk_txq, RB_CTRL),
RB_RST_SET | RB_DIS_OP_MD);
/* Disable all GMAC interrupt. */
CSR_WRITE_1(sc, MR_ADDR(sc_if->msk_port, GMAC_IRQ_MSK), 0);
/* Disable PHY interrupt. */
msk_phy_writereg(sc_if, PHY_ADDR_MARV, PHY_MARV_INT_MASK, 0);
/* Disable the RAM Interface Arbiter. */
CSR_WRITE_1(sc, MR_ADDR(sc_if->msk_port, TXA_CTRL), TXA_DIS_ARB);
/* Reset the PCI FIFO of the async Tx queue */
CSR_WRITE_4(sc, Q_ADDR(sc_if->msk_txq, Q_CSR),
BMU_RST_SET | BMU_FIFO_RST);
/* Reset the Tx prefetch units. */
CSR_WRITE_4(sc, Y2_PREF_Q_ADDR(sc_if->msk_txq, PREF_UNIT_CTRL_REG),
PREF_UNIT_RST_SET);
/* Reset the RAM Buffer async Tx queue. */
CSR_WRITE_1(sc, RB_ADDR(sc_if->msk_txq, RB_CTRL), RB_RST_SET);
/* Reset Tx MAC FIFO. */
CSR_WRITE_4(sc, MR_ADDR(sc_if->msk_port, TX_GMF_CTRL_T), GMF_RST_SET);
/* Set Pause Off. */
CSR_WRITE_4(sc, MR_ADDR(sc_if->msk_port, GMAC_CTRL), GMC_PAUSE_OFF);
/*
* The Rx Stop command will not work for Yukon-2 if the BMU does not
* reach the end of packet and since we can't make sure that we have
* incoming data, we must reset the BMU while it is not during a DMA
* transfer. Since it is possible that the Rx path is still active,
* the Rx RAM buffer will be stopped first, so any possible incoming
* data will not trigger a DMA. After the RAM buffer is stopped, the
* BMU is polled until any DMA in progress is ended and only then it
* will be reset.
*/
/* Disable the RAM Buffer receive queue. */
CSR_WRITE_1(sc, RB_ADDR(sc_if->msk_rxq, RB_CTRL), RB_DIS_OP_MD);
for (i = 0; i < MSK_TIMEOUT; i++) {
if (CSR_READ_1(sc, RB_ADDR(sc_if->msk_rxq, Q_RSL)) ==
CSR_READ_1(sc, RB_ADDR(sc_if->msk_rxq, Q_RL)))
break;
DELAY(1);
}
if (i == MSK_TIMEOUT)
device_printf(sc_if->msk_if_dev, "Rx BMU stop failed\n");
CSR_WRITE_4(sc, Q_ADDR(sc_if->msk_rxq, Q_CSR),
BMU_RST_SET | BMU_FIFO_RST);
/* Reset the Rx prefetch unit. */
CSR_WRITE_4(sc, Y2_PREF_Q_ADDR(sc_if->msk_rxq, PREF_UNIT_CTRL_REG),
PREF_UNIT_RST_SET);
/* Reset the RAM Buffer receive queue. */
CSR_WRITE_1(sc, RB_ADDR(sc_if->msk_rxq, RB_CTRL), RB_RST_SET);
/* Reset Rx MAC FIFO. */
CSR_WRITE_4(sc, MR_ADDR(sc_if->msk_port, RX_GMF_CTRL_T), GMF_RST_SET);
/* Free Rx and Tx mbufs still in the queues. */
for (i = 0; i < MSK_RX_RING_CNT; i++) {
rxd = &sc_if->msk_cdata.msk_rxdesc[i];
if (rxd->rx_m != NULL) {
bus_dmamap_sync(sc_if->msk_cdata.msk_rx_tag,
rxd->rx_dmamap, BUS_DMASYNC_POSTREAD);
bus_dmamap_unload(sc_if->msk_cdata.msk_rx_tag,
rxd->rx_dmamap);
m_freem(rxd->rx_m);
rxd->rx_m = NULL;
}
}
for (i = 0; i < MSK_JUMBO_RX_RING_CNT; i++) {
jrxd = &sc_if->msk_cdata.msk_jumbo_rxdesc[i];
if (jrxd->rx_m != NULL) {
bus_dmamap_sync(sc_if->msk_cdata.msk_jumbo_rx_tag,
jrxd->rx_dmamap, BUS_DMASYNC_POSTREAD);
bus_dmamap_unload(sc_if->msk_cdata.msk_jumbo_rx_tag,
jrxd->rx_dmamap);
m_freem(jrxd->rx_m);
jrxd->rx_m = NULL;
}
}
for (i = 0; i < MSK_TX_RING_CNT; i++) {
txd = &sc_if->msk_cdata.msk_txdesc[i];
if (txd->tx_m != NULL) {
bus_dmamap_sync(sc_if->msk_cdata.msk_tx_tag,
txd->tx_dmamap, BUS_DMASYNC_POSTWRITE);
bus_dmamap_unload(sc_if->msk_cdata.msk_tx_tag,
txd->tx_dmamap);
m_freem(txd->tx_m);
txd->tx_m = NULL;
}
}
/*
* Mark the interface down.
*/
ifp->if_drv_flags &= ~(IFF_DRV_RUNNING | IFF_DRV_OACTIVE);
sc_if->msk_flags &= ~MSK_FLAG_LINK;
}
|
the_stack_data/162643162.c
|
// Fig. 5.11: fig05_11.c
// Shifted, scaled random integers produced by 1 + rand() % 6.
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
// loop 20 times
for (unsigned int i = 1; i <= 20; ++i) {
// pick random number from 1 to 6 and output it
printf("%10d", 1 + (rand() % 6));
// if counter is divisible by 5, begin new line of output
if (i % 5 == 0) {
puts("");
}
}
}
/**************************************************************************
* (C) Copyright 1992-2015 by Deitel & Associates, Inc. and *
* Pearson Education, Inc. All Rights Reserved. *
* *
* DISCLAIMER: The authors and publisher of this book have used their *
* best efforts in preparing the book. These efforts include the *
* development, research, and testing of the theories and programs *
* to determine their effectiveness. The authors and publisher make *
* no warranty of any kind, expressed or implied, with regard to these *
* programs or to the documentation contained in these books. The authors *
* and publisher shall not be liable in any event for incidental or *
* consequential damages in connection with, or arising out of, the *
* furnishing, performance, or use of these programs. *
*************************************************************************/
|
the_stack_data/102624.c
|
#include <stdint.h>
#include <stdlib.h>
int ocall_dpdk_initialize(char* config_name, int config_snaplen, unsigned int config_timeout, uint32_t config_flags, int config_mode,
char* dpdk_args, int debug, int dpdk_queues, void** ctxt_ptr, char* errbuf, size_t errlen) {
return 0;
}
int ocall_dpdk_start_device(void* handle, void* dev) {
return 0;
}
int ocall_dpdk_acquire(void* handle) {
return 0;
}
int ocall_dpdk_stop(void* handle) {
return 0;
}
int ocall_dpdk_shutdown(void* handle) {
return 0;
}
|
the_stack_data/92326288.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_recursive_power.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: baslanha <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/12/11 20:44:42 by baslanha #+# #+# */
/* Updated: 2021/12/11 20:45:22 by baslanha ### ########.fr */
/* */
/* ************************************************************************** */
int ft_recursive_power(int nb, int power)
{
int n;
n = nb;
if (n > n * nb)
return (0);
else if (power > 1)
return (n * ft_recursive_power(n, power - 1));
else if (power == 0)
return (1);
else if (power < 0)
return (0);
else
return (n);
}
|
the_stack_data/125162.c
|
// RUN: test.sh -e -t %t %s
#include <string.h>
// strncpy() with too short a destination.
int main()
{
char dst[10];
char pad[100];
char src[] = "A string";
strncpy(&dst[0], &src[0], 11);
return 0;
}
|
the_stack_data/37638402.c
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int nodes = 1728;
int degree = 30; // degree must be even number
for(int n=0;n<nodes;n++){
for(int d=0;d<degree/2;d++){
int n_plus_1 = n + 1;
if(n_plus_1 == nodes) n_plus_1 = 0;
printf("%d %d\n", n, n_plus_1);
}
}
return 0;
}
|
the_stack_data/64199497.c
|
#include <stdio.h>
struct entry {
int value;
struct entry *previous;
struct entry *next;
};
void insertEntry( struct entry *oldEntry, struct entry *newEntry );
void removeEntry( struct entry *entryToRemove );
int main (void) {
struct entry p1, p2, p3;
struct entry *listPointer;
struct entry HEAD = { 0, NULL, &p1 };
p1.value = 1;
p1.previous = &HEAD;
p1.next = &p2;
p2.value = 2;
p2.previous = &p1;
p2.next = NULL;
p3.value = 3;
p3.previous = NULL;
p3.next = NULL;
insertEntry ( &p2, &p3 );
removeEntry ( &p1 );
listPointer = HEAD.next;
while( listPointer ) {
printf("%d\n", listPointer->value);
listPointer = listPointer->next;
}
return 0;
}
void insertEntry( struct entry *oldEntry, struct entry *newEntry ) {
newEntry->previous = oldEntry;
newEntry->next = oldEntry->next;
oldEntry->next = newEntry;
}
void removeEntry( struct entry *entryToRemove ) {
entryToRemove->previous->next = entryToRemove->next;
}
|
the_stack_data/104826998.c
|
//+doc convert errno to str, with 3 chars length
// ending the string (global)
// with two \0\0, when errno<100
// errnum must be <200.
//+def
static char *errno_str(int err){
static char e[5];
// = { '1','0','0','\n',0 }; blows up 4k.
// needs another section.
char *p = e;
if ( err<0 )
err=-err;
if ( err>99 ){
err-=100;
} else {
p++;
}
e[0] = '1';
e[1]=(err/10)+'0';
e[2]=(err%10)+'0';
e[3]=0;
e[4]=0;
return(p);
}
|
the_stack_data/365330.c
|
/*
* Public domain. 2003. Niklas Hallqvist.
*
* $OpenBSD: nover.c,v 1.1 2003/07/01 05:51:31 niklas Exp $
*/
#include <stdio.h>
void
version(void)
{
printf("none\n");
}
|
the_stack_data/73574042.c
|
/*
[广义表 - 百度百科](https://baike.baidu.com/item/%E5%B9%BF%E4%B9%89%E8%A1%A8)
[广义表#头尾链表存储表示 - 维基百科](https://zh.wikipedia.org/wiki/%E5%B9%BF%E4%B9%89%E8%A1%A8#%E5%A4%B4%E5%B0%BE%E9%93%BE%E8%A1%A8%E5%AD%98%E5%82%A8%E8%A1%A8%E7%A4%BA)
广义表（英语：Generalized List）是一种非线性的数据结构。但如果广义表的每个元素都是原子，它就变成了线性表。广义表广泛地用于人工智能等领域的LISP语言。
广义表一般记作 LS = (a1, a2, ···, an), n是它的长度，ai可以是单个元素(原子)，也可以是广义表(子表)，当广义表非空时，称第一个元素a1为LS的表头，称其余元素组成的表为LS的表尾。
注意：表头是元素(可以是原子，也可以是广表)，表尾一定是广义表。
E=(a, E)是一个递归的表。D=(( ),(e),(a,(b,c,d)))是多层次的广义表，长度为3，深度为3。例：((a),a)的表头是(a)，表尾是(a)，((a))的表头是(a)，表尾是( )。
《数据结构-入门指南》 - xubeijun/续杯君
[第2节 常见链表有哪些 - 广义表](https://www.xubeijun.com/column/data-structures/data-structures-start-guide/chapter-003/section-002/the-common-linked-lists#generalized-list)
5组测试用例
()
(a,b)
(x,(a,b))
((x,(a,b)),y)
((x,(a,b)),((x,(a,b)),y))
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
// 默认输入字符串最大长度
#define MAXLEN 255
// 输出类型 ELEMENT=0:元素, BRACKET=1:括号
typedef enum {ELEMENT, BRACKET} OutTag;
// 节点类型 ATOM=0:原子，LIST=1:子表
typedef enum {ATOM, LIST} ElemTag;
// 原子值类型
typedef char AtomType;
// 广义表字符串数组
typedef char GListStr[MAXLEN];
typedef struct GLNode {
ElemTag tag; //节点类型
union {
AtomType atom; // 原子结点的值域
struct{
struct GLNode *hp; //表头指针域
struct GLNode *tp; //表尾指针域
}ptr; // 表结点的指针域
};
}GLNode, *GList;
// 初始化广义表
bool init(GList *L);
// 生成广义表初始节点
bool buildNode(GList *L);
// 创建广义表
bool create(GList *L, GListStr str);
// 获取广义字符串的节点类型
void getStrTag(GListStr str, ElemTag *hpTag);
// 分割广义表字符串，获得表头字符串，表尾字符串，表头节点类型
void strsub(GListStr str,GListStr *hpSub, GListStr *tpSub, ElemTag *hpTag);
// 广义表是否为空表
bool isEmpty(GList L);
// 获取广义表长度
int length(GList L);
// 获取广义表深度
int depth(GList L);
// 广义表头插法插入
bool insert(GList *L, GList v);
// 广义表头插法删除
bool delete(GList *L, GList *x);
// 获取广义表的表头
bool getHead(GList L, GList *x);
// 获取广义表的表尾
bool getTail(GList L, GList *x);
// 复制广义表，从src复制到dest
void copyGList(GList src, GList *dest);
// 遍历广义表
void traverse(GList L, OutTag O);
// 遍历输出所有原子值
void printATOM(GList L);
// 遍历输出带括号的广义表
void printGList(GList L, bool f);
// 清空广义表节点
void clear(GList *L);
// 销毁广义表节点
void destroy(GList *L);
/**
* [init 初始化广义表L，该空表的长度为0，深度为1]
* @param L [广义表L的二级指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool init(GList *L){
*L = NULL;
return true;
}
/**
* [buildNode 生成广义表初始节点]
* @param L [广义表L的二级指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool buildNode(GList *L){
*L = (GList)malloc(sizeof(GLNode));
if(!(*L)){
return false;
}
(*L)->tag = LIST;
(*L)->ptr.hp = NULL;
(*L)->ptr.tp = NULL;
return true;
}
/**
* [create 生成广义表，根据广义表字符串数组]
* @param L [广义表L的二级指针]
* @param str [广义表字符串数组]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool create(GList *L, GListStr str){
bool f;
GListStr hpSub="", tpSub="", sub="", emp="()";
ElemTag hpTag;
AtomType atom;
GList M,N;
// 空表
if(strcmp(str,emp) == 0){
init(L);
return true;
}
f = buildNode(L);
if(!f){
// 生成初始节点失败
return false;
}
getStrTag(str, &hpTag);
if(hpTag == ATOM){
strncpy(&atom,str,1);
(*L)->tag = ATOM;
(*L)->atom = atom;
}else{
(*L)->tag = LIST;
M = *L;
// 去除括号
memset(sub, '\0', sizeof(sub));
strncpy(sub, str+1, strlen(str)-2);
while(strlen(sub) > 0){
strsub(sub, &hpSub, &tpSub, &hpTag);
f = create(&(M->ptr.hp), hpSub);
if(!f){
// 表头递归生成失败
return false;
}
if(strlen(sub) == strlen(hpSub)){
break;
}
if(strlen(tpSub) > 0){
f= buildNode(&N);
if(!f){
// 生成初始节点失败
return false;
}
M->ptr.tp = N;
memset(sub, '\0', sizeof(sub));
strncpy(sub, tpSub, strlen(tpSub));
memset(hpSub, '\0', sizeof(hpSub));
memset(tpSub, '\0', sizeof(tpSub));
}
M = N;
}
}
return true;
}
/**
* [getStrTag 获取广义字符串的节点类型]
* @param str [获取广义字符串]
* @param hpTag [节点类型]
*/
void getStrTag(GListStr str, ElemTag *hpTag){
*hpTag = ATOM;
GListStr item;
memset(item,'\0',sizeof(item));
if(strlen(str) > 0){
strncpy(item, str, 1);
if(strcmp(item, "(") == 0){
*hpTag = LIST;
}
}
}
/**
* [strsub 分割广义表字符串]
* @param str [广义表字符串数组]
* @param hpSub [表头字符串]
* @param tpSub [表尾字符串]
* @param hpTag [表头节点类型]
*/
void strsub(GListStr str,GListStr *hpSub, GListStr *tpSub, ElemTag *hpTag){
int i, n = 0;
int hpPos = 0;
GListStr sub,item;
*hpTag = ATOM;
memset(sub,'\0',sizeof(sub));
memset(item,'\0',sizeof(item));
strncpy(sub, str, strlen(str));
for (i = 0; i < strlen(sub); ++i){
++hpPos;
strncpy(item,sub+i,1);
if(i == 0 && strcmp(item, "(") == 0){
*hpTag = LIST;
}
if(strcmp(item, "(") == 0){
++n;
}
if(strcmp(item, ")") == 0){
--n;
}
if((*hpTag) == ATOM && strcmp(item, ",") == 0){
break;
}
if((*hpTag) == LIST && n == 0){
break;
}
}
if(hpPos > 0){
memset((*hpSub), '\0', sizeof((*hpSub)));
strncpy((*hpSub), sub, hpPos);
}
if(strlen(sub) > hpPos){
memset((*tpSub), '\0', sizeof((*tpSub)));
if((*hpTag) == ATOM){
strncpy((*tpSub), sub+(hpPos), strlen(sub)-(hpPos));
}else{
strncpy((*tpSub), sub+(hpPos+1), strlen(sub)-(hpPos+1));
}
}
}
/**
* [isEmpty 广义表L是否为空表]
* @param L [广义表L的指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool isEmpty(GList L){
if(!L){
return true;
}else{
return false;
}
}
/**
* [length 返回广义表L的长度，最高层的节点个数。]
* @param L [广义表L的指针]
* @return int [返回广义表L的长度]
*/
int length(GList L){
int len = 0;
if(L){
for(len = 0; L; len++){
L = L->ptr.tp;
}
}
return len;
}
/**
* [length 返回广义表L的深度，表展开后所含括号的层数。]
* @param L [广义表L的指针]
* @return int [返回广义表L的深度]
*/
int depth(GList L){
int dep,max;
// 空表
if(!L){
return 1;
}
// L为原子
if(L->tag == ATOM){
return 0;
}
while(L){
dep = depth(L->ptr.hp);
if(dep > max){
max = dep;
}
L = L->ptr.tp;
}
return max + 1;
}
/**
* [insert 在广义表L中使用头插法，插入结点x]
* @param L [广义表L的二级指针]
* @param v [结点v]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool insert(GList *L, GList v){
bool f;
GList M;
f = buildNode(&M);
if(!f){
return false;
}
M->ptr.hp = v;
M->ptr.tp = *L;
*L = M;
return true;
}
/**
* [delete 在广义表L中使用头插法，删除其元素。]
* @param L [广义表L的二级指针]
* @param x [被删除的结点x的二级指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool delete(GList *L, GList *x){
GList M;
if(!L){
printf("L does not exist. \n");
return false;
}
M = (*L);
*L = (*L)->ptr.tp;
M->ptr.tp = NULL;
buildNode(x);
copyGList(M, x);
free(M);
M = NULL;
return true;
}
/**
* [getHead 返回广义表L中的头结点。]
* @param L [广义表L的指针]
* @param x [头结点x的二级指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool getHead(GList L, GList *x){
if(!L){
printf("L is empty, it has no head. \n");
return false;
}
buildNode(x);
copyGList(L->ptr.hp, x);
return true;
}
/**
* [getTail 返回广义表L中的尾结点。]
* @param L [广义表L的指针]
* @param x [尾结点x的二级指针]
* @return bool [返回是否完成标识，操作成功则为true，否则为false。]
*/
bool getTail(GList L, GList *x){
if(!L){
printf("L is empty, it have no tail. \n");
return false;
}
if(L->ptr.tp){
buildNode(x);
copyGList(L->ptr.tp, x);
}else{
return false;
}
return true;
}
/**
* [copyGList 复制广义表]
* @param src [复制来源广义表]
* @param dest [复制目标广义表]
*/
void copyGList(GList src, GList *dest){
if(!src){
init(dest);
}else{
if(!(*dest)){
buildNode(dest);
}
(*dest)->tag = src->tag;
if(src->tag == ATOM){
(*dest)->atom = src->atom;
}else{
copyGList(src->ptr.hp, &((*dest)->ptr.hp));
copyGList(src->ptr.tp, &((*dest)->ptr.tp));
}
}
}
/**
* [traverse 遍历输出所有元素值]
* @param L [广义表L的指针]
* @param O [输出类型]
*/
void traverse(GList L, OutTag O){
if(O == ELEMENT){
printATOM(L);
}else{
printGList(L, true);
}
printf("\n operation - traverse end \n\n");
}
/**
* [printATOM 遍历输出所有原子值]
* @param L [广义表L的指针]
*/
void printATOM(GList L){
if(L){
if(L->tag == ATOM){
printf("%c", L->atom);
}else{
printATOM(L->ptr.hp);
if(L->ptr.tp){
printf(",");
}
printATOM(L->ptr.tp);
}
}
}
/**
* [printGList 遍历输出带括号的广义表]
* @param L [广义表L的指针]
* @param f [bool 是否输出外层括号]
*/
void printGList(GList L, bool f){
if(!L){
printf("()");
}else{
if(L->tag == ATOM){
printf("%c", L->atom);
}else{
if(f){
printf("(");
}
if(L->ptr.hp){
bool bracket = (L->ptr.hp->tag == LIST)?true:false;
printGList(L->ptr.hp, bracket);
}
if(L->ptr.tp){
printf(",");
printGList(L->ptr.tp, false);
}
if(f){
printf(")");
}
}
}
}
/**
* [clear 将广义表清空，清除所有元素。]
* @param L [广义表L的二级指针]
*/
void clear(GList *L){
destroy(L);
}
/**
* [destroy 将广义表销毁，释放内存。]
* @param L [广义表L的二级指针]
*/
void destroy(GList *L){
GList H,T;
if(*L){
if((*L)->tag == LIST){
H = (*L)->ptr.hp;
T = (*L)->ptr.tp;
destroy(&H);
destroy(&T);
}
free(*L);
(*L) = NULL;
}
}
/**
* [isValid 是否可用]
* @param flag [bool 可用标识]
* @return char [返回字符串，true返回成功，否则返回失败]
*/
char * isValid(bool flag){
char *src;
if(flag){
src = "success";
}else{
src = "false";
}
return src;
}
int main(){
bool f;
int len, dep, x;
GListStr str, s1 = "(m,n)";
GList L, M, N, H, T;
printf( "Enter Generalized List: ");
x = scanf("%s",str);
if(x!=1){
printf("stdin format is error \n");
exit(-1);
}
printf("GListStr is %s \n\n", str);
f = init(&L);
printf("operation - init \n it is %s \n\n", isValid(f));
f = isEmpty(L);
printf("operation - isEmpty \n it is %s \n\n", isValid(f));
f = create(&L, str);
printf("operation - create \n it is %s \n\n", isValid(f));
len = length(L);
printf("operation - length \n it is %d \n\n", len);
dep = depth(L);
printf("operation - depth \n it is %d \n\n", dep);
create(&M, s1);
f = insert(&L, M);
printf("operation - insert \n it is %s \n\n", isValid(f));
printf("operation - traverse after insert \n\n");
traverse(L, BRACKET);
f = delete(&L, &N);
printf("operation - delete \n it is %s \n\n", isValid(f));
if(f){
printf("operation - traverse delete Node \n\n");
traverse(N, BRACKET);
destroy(&N);
}
printf("operation - traverse after delete \n\n");
traverse(L, BRACKET);
f = getHead(L, &H);
printf("operation - getHead \n it is %s \n\n", isValid(f));
if(f){
printf("operation - traverse after getHead \n\n");
traverse(H, BRACKET);
destroy(&H);
}
f = getTail(L, &T);
printf("operation - getTail \n it is %s \n\n", isValid(f));
if(f){
printf("operation - traverse after getTail \n\n");
traverse(T, BRACKET);
destroy(&T);
}
printf("operation - traverse origin GList atom \n\n");
traverse(L, ELEMENT);
printf("operation - traverse origin GList with bracket \n\n");
traverse(L, BRACKET);
printf("operation - clear \n\n");
clear(&L);
printf("operation - traverse after clear \n\n");
traverse(L, BRACKET);
printf("operation - destroy \n\n");
destroy(&L);
printf("operation - traverse after destroy \n\n");
traverse(L, BRACKET);
return 0;
}
|
the_stack_data/533806.c
|
#include<stdio.h>
int main(void)
{
printf("Hello world\n");// clang is also compiler outputs as a.out -- assembler oupt
// clang -o <desired name> <code file> -- names output as desired name
}
|
the_stack_data/75136616.c
|
/*
* putchar.c - print (or buffer) a character on the standard output stream
*/
/* $Header: /cvsup/minix/src/lib/stdio/putchar.c,v 1.1.1.1 2005/04/21 14:56:36 beng Exp $ */
#include <stdio.h>
int
(putchar)(int c)
{
return putchar(c);
}
|
the_stack_data/14151.c
|
// 4 kyu
// Range Extraction
#include <stdlib.h>
#include <stdio.h>
char *
range_extraction(const int *arr, size_t sz)
{
int i, *p = NULL;
char *str = calloc(0x400, 1);
for (i = 0; i < (sz - 1); i++) {
if (arr[i] + 1 == arr[i + 1]) {
if (!p)
p = arr + i;
} else {
if (p)
sprintf(str, "%s%i%c%i,", str, *p,
((*p + 1 == arr[i]) ? ',' : '-'),
arr[i]);
else
sprintf(str, "%s%i,", str, arr[i]);
p = NULL;
};
};
if (p)
sprintf(str, "%s%i%c%i", str, *p,
((*p + 1 == arr[i]) ? ',' : '-'), arr[i]);
else
sprintf(str, "%s%i", str, arr[i]);
return str;
}
|
the_stack_data/192331286.c
|
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
#include <stdlib.h>
#include <string.h>
struct ListNode {
int val;
struct ListNode *next;
};
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
unsigned char carrier = 0, tmpval = 0;
struct ListNode *pstresult = NULL, *pstcurrentPtr = NULL, *psttmp = NULL, *pstcurrentl1 = NULL, *pstcurrentl2 = NULL;
if (l1 == NULL || l2 == NULL)
{
return NULL;
}
pstcurrentl1 = l1;
pstcurrentl2 = l2;
while(!(pstcurrentl1 == NULL && pstcurrentl2 == NULL && carrier == 0))
{
// calc value & carrier
if (pstcurrentl1 != NULL && pstcurrentl2 != NULL)
{
tmpval = pstcurrentl1->val + pstcurrentl2->val + carrier;
pstcurrentl1 = pstcurrentl1->next;
pstcurrentl2 = pstcurrentl2->next;
}
else if (pstcurrentl1 != NULL && pstcurrentl2 == NULL)
{
tmpval = pstcurrentl1->val + carrier;
pstcurrentl1 = pstcurrentl1->next;
}
else if (pstcurrentl1 == NULL && pstcurrentl2 != NULL)
{
tmpval = pstcurrentl2->val + carrier;
pstcurrentl2 = pstcurrentl2->next;
}
else if (carrier != 0)
{
tmpval = carrier;
}
carrier = tmpval / 10;
tmpval %= 10;
//create result elements
psttmp = malloc(sizeof(struct ListNode));
if (psttmp == NULL)
{
return pstresult;
}
else
{
memset(psttmp, 0, sizeof(struct ListNode));
}
// update result elements
if ( pstresult == NULL )
{
pstresult = psttmp;
pstcurrentPtr = pstresult;
}
else
{
pstcurrentPtr->next = psttmp;
pstcurrentPtr = pstcurrentPtr->next;
}
pstcurrentPtr->next = NULL;
pstcurrentPtr->val = tmpval;
}
return pstresult;
}
|
the_stack_data/33617.c
|
/* This file was automatically generated by CasADi.
The CasADi copyright holders make no ownership claim of its contents. */
#ifdef __cplusplus
extern "C" {
#endif
/* How to prefix internal symbols */
#ifdef CODEGEN_PREFIX
#define NAMESPACE_CONCAT(NS, ID) _NAMESPACE_CONCAT(NS, ID)
#define _NAMESPACE_CONCAT(NS, ID) NS ## ID
#define CASADI_PREFIX(ID) NAMESPACE_CONCAT(CODEGEN_PREFIX, ID)
#else
#define CASADI_PREFIX(ID) pendulum_dae_dyn_gnsf_get_matrices_fun_ ## ID
#endif
#include <math.h>
#ifndef casadi_real
#define casadi_real double
#endif
#ifndef casadi_int
#define casadi_int int
#endif
/* Add prefix to internal symbols */
#define casadi_f0 CASADI_PREFIX(f0)
#define casadi_s0 CASADI_PREFIX(s0)
#define casadi_s1 CASADI_PREFIX(s1)
#define casadi_s2 CASADI_PREFIX(s2)
#define casadi_s3 CASADI_PREFIX(s3)
#define casadi_s4 CASADI_PREFIX(s4)
#define casadi_s5 CASADI_PREFIX(s5)
#define casadi_s6 CASADI_PREFIX(s6)
#define casadi_s7 CASADI_PREFIX(s7)
#define casadi_s8 CASADI_PREFIX(s8)
/* Symbol visibility in DLLs */
#ifndef CASADI_SYMBOL_EXPORT
#if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
#if defined(STATIC_LINKED)
#define CASADI_SYMBOL_EXPORT
#else
#define CASADI_SYMBOL_EXPORT __declspec(dllexport)
#endif
#elif defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
#define CASADI_SYMBOL_EXPORT __attribute__ ((visibility ("default")))
#else
#define CASADI_SYMBOL_EXPORT
#endif
#endif
static const casadi_int casadi_s0[5] = {1, 1, 0, 1, 0};
static const casadi_int casadi_s1[58] = {10, 5, 0, 10, 20, 30, 40, 50, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s2[14] = {10, 1, 0, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s3[36] = {10, 3, 0, 10, 20, 30, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s4[113] = {10, 10, 0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static const casadi_int casadi_s5[48] = {8, 5, 0, 8, 16, 24, 32, 40, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7};
static const casadi_int casadi_s6[4] = {0, 1, 0, 0};
static const casadi_int casadi_s7[15] = {1, 6, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 0};
static const casadi_int casadi_s8[13] = {1, 5, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0};
/* pendulum_dae_dyn_gnsf_get_matrices_fun:(i0)->(o0[10x5],o1[10],o2[10x3],o3[10x10],o4[8x5],o5[8x5],o6[8x5],o7[0],o8,o9[10],o10,o11,o12,o13,o14[1x6],o15[1x5],o16) */
static int casadi_f0(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem) {
casadi_real a0, a1, a2, a3, a4;
a0=0.;
if (res[0]!=0) res[0][0]=a0;
if (res[0]!=0) res[0][1]=a0;
if (res[0]!=0) res[0][2]=a0;
if (res[0]!=0) res[0][3]=a0;
if (res[0]!=0) res[0][4]=a0;
if (res[0]!=0) res[0][5]=a0;
if (res[0]!=0) res[0][6]=a0;
if (res[0]!=0) res[0][7]=a0;
if (res[0]!=0) res[0][8]=a0;
if (res[0]!=0) res[0][9]=a0;
if (res[0]!=0) res[0][10]=a0;
if (res[0]!=0) res[0][11]=a0;
if (res[0]!=0) res[0][12]=a0;
if (res[0]!=0) res[0][13]=a0;
if (res[0]!=0) res[0][14]=a0;
if (res[0]!=0) res[0][15]=a0;
if (res[0]!=0) res[0][16]=a0;
if (res[0]!=0) res[0][17]=a0;
if (res[0]!=0) res[0][18]=a0;
if (res[0]!=0) res[0][19]=a0;
a1=-1.;
if (res[0]!=0) res[0][20]=a1;
if (res[0]!=0) res[0][21]=a0;
if (res[0]!=0) res[0][22]=a0;
if (res[0]!=0) res[0][23]=a0;
if (res[0]!=0) res[0][24]=a0;
if (res[0]!=0) res[0][25]=a0;
if (res[0]!=0) res[0][26]=a0;
if (res[0]!=0) res[0][27]=a0;
if (res[0]!=0) res[0][28]=a0;
if (res[0]!=0) res[0][29]=a0;
if (res[0]!=0) res[0][30]=a0;
if (res[0]!=0) res[0][31]=a1;
if (res[0]!=0) res[0][32]=a0;
if (res[0]!=0) res[0][33]=a0;
if (res[0]!=0) res[0][34]=a0;
if (res[0]!=0) res[0][35]=a0;
if (res[0]!=0) res[0][36]=a0;
if (res[0]!=0) res[0][37]=a0;
if (res[0]!=0) res[0][38]=a0;
if (res[0]!=0) res[0][39]=a0;
if (res[0]!=0) res[0][40]=a0;
if (res[0]!=0) res[0][41]=a0;
if (res[0]!=0) res[0][42]=a0;
if (res[0]!=0) res[0][43]=a0;
if (res[0]!=0) res[0][44]=a0;
if (res[0]!=0) res[0][45]=a0;
if (res[0]!=0) res[0][46]=a0;
if (res[0]!=0) res[0][47]=a0;
if (res[0]!=0) res[0][48]=a0;
if (res[0]!=0) res[0][49]=a0;
if (res[1]!=0) res[1][0]=a0;
if (res[1]!=0) res[1][1]=a0;
if (res[1]!=0) res[1][2]=a0;
if (res[1]!=0) res[1][3]=a0;
if (res[1]!=0) res[1][4]=a0;
if (res[1]!=0) res[1][5]=a0;
if (res[1]!=0) res[1][6]=a0;
if (res[1]!=0) res[1][7]=a1;
if (res[1]!=0) res[1][8]=a0;
if (res[1]!=0) res[1][9]=a0;
if (res[2]!=0) res[2][0]=a0;
if (res[2]!=0) res[2][1]=a0;
if (res[2]!=0) res[2][2]=a0;
if (res[2]!=0) res[2][3]=a0;
if (res[2]!=0) res[2][4]=a0;
if (res[2]!=0) res[2][5]=a0;
if (res[2]!=0) res[2][6]=a0;
a2=1.;
if (res[2]!=0) res[2][7]=a2;
if (res[2]!=0) res[2][8]=a0;
if (res[2]!=0) res[2][9]=a0;
if (res[2]!=0) res[2][10]=a0;
if (res[2]!=0) res[2][11]=a0;
if (res[2]!=0) res[2][12]=a0;
if (res[2]!=0) res[2][13]=a0;
if (res[2]!=0) res[2][14]=a0;
if (res[2]!=0) res[2][15]=a2;
if (res[2]!=0) res[2][16]=a0;
if (res[2]!=0) res[2][17]=a0;
if (res[2]!=0) res[2][18]=a0;
if (res[2]!=0) res[2][19]=a0;
if (res[2]!=0) res[2][20]=a0;
if (res[2]!=0) res[2][21]=a0;
if (res[2]!=0) res[2][22]=a0;
if (res[2]!=0) res[2][23]=a0;
if (res[2]!=0) res[2][24]=a0;
if (res[2]!=0) res[2][25]=a0;
if (res[2]!=0) res[2][26]=a2;
if (res[2]!=0) res[2][27]=a0;
if (res[2]!=0) res[2][28]=a0;
if (res[2]!=0) res[2][29]=a0;
if (res[3]!=0) res[3][0]=a1;
if (res[3]!=0) res[3][1]=a0;
if (res[3]!=0) res[3][2]=a0;
if (res[3]!=0) res[3][3]=a0;
if (res[3]!=0) res[3][4]=a0;
if (res[3]!=0) res[3][5]=a0;
if (res[3]!=0) res[3][6]=a0;
if (res[3]!=0) res[3][7]=a0;
if (res[3]!=0) res[3][8]=a0;
if (res[3]!=0) res[3][9]=a0;
if (res[3]!=0) res[3][10]=a0;
if (res[3]!=0) res[3][11]=a1;
if (res[3]!=0) res[3][12]=a0;
if (res[3]!=0) res[3][13]=a0;
if (res[3]!=0) res[3][14]=a0;
if (res[3]!=0) res[3][15]=a0;
if (res[3]!=0) res[3][16]=a0;
if (res[3]!=0) res[3][17]=a0;
if (res[3]!=0) res[3][18]=a0;
if (res[3]!=0) res[3][19]=a0;
if (res[3]!=0) res[3][20]=a0;
if (res[3]!=0) res[3][21]=a0;
if (res[3]!=0) res[3][22]=a1;
if (res[3]!=0) res[3][23]=a0;
if (res[3]!=0) res[3][24]=a0;
if (res[3]!=0) res[3][25]=a0;
if (res[3]!=0) res[3][26]=a0;
if (res[3]!=0) res[3][27]=a0;
if (res[3]!=0) res[3][28]=a0;
if (res[3]!=0) res[3][29]=a0;
if (res[3]!=0) res[3][30]=a0;
if (res[3]!=0) res[3][31]=a0;
if (res[3]!=0) res[3][32]=a0;
if (res[3]!=0) res[3][33]=a1;
if (res[3]!=0) res[3][34]=a0;
if (res[3]!=0) res[3][35]=a0;
if (res[3]!=0) res[3][36]=a0;
if (res[3]!=0) res[3][37]=a0;
if (res[3]!=0) res[3][38]=a0;
if (res[3]!=0) res[3][39]=a0;
if (res[3]!=0) res[3][40]=a0;
if (res[3]!=0) res[3][41]=a0;
if (res[3]!=0) res[3][42]=a0;
if (res[3]!=0) res[3][43]=a0;
if (res[3]!=0) res[3][44]=a1;
if (res[3]!=0) res[3][45]=a0;
if (res[3]!=0) res[3][46]=a0;
if (res[3]!=0) res[3][47]=a0;
if (res[3]!=0) res[3][48]=a0;
if (res[3]!=0) res[3][49]=a0;
if (res[3]!=0) res[3][50]=a0;
if (res[3]!=0) res[3][51]=a0;
if (res[3]!=0) res[3][52]=a2;
if (res[3]!=0) res[3][53]=a0;
if (res[3]!=0) res[3][54]=a0;
if (res[3]!=0) res[3][55]=a1;
if (res[3]!=0) res[3][56]=a0;
if (res[3]!=0) res[3][57]=a0;
a3=-2.;
if (res[3]!=0) res[3][58]=a3;
if (res[3]!=0) res[3][59]=a0;
if (res[3]!=0) res[3][60]=a0;
if (res[3]!=0) res[3][61]=a0;
if (res[3]!=0) res[3][62]=a0;
if (res[3]!=0) res[3][63]=a2;
if (res[3]!=0) res[3][64]=a0;
if (res[3]!=0) res[3][65]=a0;
if (res[3]!=0) res[3][66]=a1;
if (res[3]!=0) res[3][67]=a0;
if (res[3]!=0) res[3][68]=a0;
if (res[3]!=0) res[3][69]=a3;
if (res[3]!=0) res[3][70]=a0;
if (res[3]!=0) res[3][71]=a0;
if (res[3]!=0) res[3][72]=a0;
if (res[3]!=0) res[3][73]=a0;
if (res[3]!=0) res[3][74]=a2;
if (res[3]!=0) res[3][75]=a0;
if (res[3]!=0) res[3][76]=a0;
a3=-1.0000000000000001e-01;
if (res[3]!=0) res[3][77]=a3;
if (res[3]!=0) res[3][78]=a0;
if (res[3]!=0) res[3][79]=a0;
if (res[3]!=0) res[3][80]=a0;
if (res[3]!=0) res[3][81]=a0;
if (res[3]!=0) res[3][82]=a0;
if (res[3]!=0) res[3][83]=a0;
if (res[3]!=0) res[3][84]=a0;
if (res[3]!=0) res[3][85]=a0;
if (res[3]!=0) res[3][86]=a0;
if (res[3]!=0) res[3][87]=a0;
if (res[3]!=0) res[3][88]=a2;
if (res[3]!=0) res[3][89]=a0;
if (res[3]!=0) res[3][90]=a0;
if (res[3]!=0) res[3][91]=a0;
if (res[3]!=0) res[3][92]=a0;
if (res[3]!=0) res[3][93]=a0;
if (res[3]!=0) res[3][94]=a0;
if (res[3]!=0) res[3][95]=a0;
if (res[3]!=0) res[3][96]=a0;
if (res[3]!=0) res[3][97]=a0;
if (res[3]!=0) res[3][98]=a0;
if (res[3]!=0) res[3][99]=a2;
if (res[4]!=0) res[4][0]=a2;
if (res[4]!=0) res[4][1]=a0;
if (res[4]!=0) res[4][2]=a0;
if (res[4]!=0) res[4][3]=a0;
if (res[4]!=0) res[4][4]=a0;
if (res[4]!=0) res[4][5]=a0;
if (res[4]!=0) res[4][6]=a0;
if (res[4]!=0) res[4][7]=a0;
if (res[4]!=0) res[4][8]=a0;
if (res[4]!=0) res[4][9]=a2;
if (res[4]!=0) res[4][10]=a0;
if (res[4]!=0) res[4][11]=a0;
if (res[4]!=0) res[4][12]=a0;
if (res[4]!=0) res[4][13]=a0;
if (res[4]!=0) res[4][14]=a0;
if (res[4]!=0) res[4][15]=a0;
if (res[4]!=0) res[4][16]=a0;
if (res[4]!=0) res[4][17]=a0;
if (res[4]!=0) res[4][18]=a2;
if (res[4]!=0) res[4][19]=a0;
if (res[4]!=0) res[4][20]=a0;
if (res[4]!=0) res[4][21]=a0;
if (res[4]!=0) res[4][22]=a0;
if (res[4]!=0) res[4][23]=a0;
if (res[4]!=0) res[4][24]=a0;
if (res[4]!=0) res[4][25]=a0;
if (res[4]!=0) res[4][26]=a0;
if (res[4]!=0) res[4][27]=a2;
if (res[4]!=0) res[4][28]=a0;
if (res[4]!=0) res[4][29]=a0;
if (res[4]!=0) res[4][30]=a0;
if (res[4]!=0) res[4][31]=a0;
if (res[4]!=0) res[4][32]=a0;
if (res[4]!=0) res[4][33]=a0;
if (res[4]!=0) res[4][34]=a0;
if (res[4]!=0) res[4][35]=a0;
if (res[4]!=0) res[4][36]=a2;
if (res[4]!=0) res[4][37]=a0;
if (res[4]!=0) res[4][38]=a0;
if (res[4]!=0) res[4][39]=a0;
if (res[5]!=0) res[5][0]=a0;
if (res[5]!=0) res[5][1]=a0;
if (res[5]!=0) res[5][2]=a0;
if (res[5]!=0) res[5][3]=a0;
if (res[5]!=0) res[5][4]=a0;
if (res[5]!=0) res[5][5]=a0;
if (res[5]!=0) res[5][6]=a0;
if (res[5]!=0) res[5][7]=a0;
if (res[5]!=0) res[5][8]=a0;
if (res[5]!=0) res[5][9]=a0;
if (res[5]!=0) res[5][10]=a0;
if (res[5]!=0) res[5][11]=a0;
if (res[5]!=0) res[5][12]=a0;
if (res[5]!=0) res[5][13]=a0;
if (res[5]!=0) res[5][14]=a0;
if (res[5]!=0) res[5][15]=a0;
if (res[5]!=0) res[5][16]=a0;
if (res[5]!=0) res[5][17]=a0;
if (res[5]!=0) res[5][18]=a0;
if (res[5]!=0) res[5][19]=a0;
if (res[5]!=0) res[5][20]=a0;
if (res[5]!=0) res[5][21]=a0;
if (res[5]!=0) res[5][22]=a0;
if (res[5]!=0) res[5][23]=a0;
if (res[5]!=0) res[5][24]=a0;
if (res[5]!=0) res[5][25]=a0;
if (res[5]!=0) res[5][26]=a0;
if (res[5]!=0) res[5][27]=a0;
if (res[5]!=0) res[5][28]=a0;
if (res[5]!=0) res[5][29]=a0;
if (res[5]!=0) res[5][30]=a0;
if (res[5]!=0) res[5][31]=a0;
if (res[5]!=0) res[5][32]=a0;
if (res[5]!=0) res[5][33]=a0;
if (res[5]!=0) res[5][34]=a0;
if (res[5]!=0) res[5][35]=a0;
if (res[5]!=0) res[5][36]=a0;
if (res[5]!=0) res[5][37]=a0;
if (res[5]!=0) res[5][38]=a0;
if (res[5]!=0) res[5][39]=a0;
if (res[6]!=0) res[6][0]=a0;
if (res[6]!=0) res[6][1]=a0;
if (res[6]!=0) res[6][2]=a0;
if (res[6]!=0) res[6][3]=a0;
if (res[6]!=0) res[6][4]=a0;
if (res[6]!=0) res[6][5]=a0;
if (res[6]!=0) res[6][6]=a0;
if (res[6]!=0) res[6][7]=a0;
if (res[6]!=0) res[6][8]=a0;
if (res[6]!=0) res[6][9]=a0;
if (res[6]!=0) res[6][10]=a0;
if (res[6]!=0) res[6][11]=a0;
if (res[6]!=0) res[6][12]=a0;
if (res[6]!=0) res[6][13]=a0;
if (res[6]!=0) res[6][14]=a0;
if (res[6]!=0) res[6][15]=a0;
if (res[6]!=0) res[6][16]=a0;
if (res[6]!=0) res[6][17]=a0;
if (res[6]!=0) res[6][18]=a0;
if (res[6]!=0) res[6][19]=a0;
if (res[6]!=0) res[6][20]=a0;
if (res[6]!=0) res[6][21]=a2;
if (res[6]!=0) res[6][22]=a0;
if (res[6]!=0) res[6][23]=a0;
if (res[6]!=0) res[6][24]=a0;
if (res[6]!=0) res[6][25]=a0;
if (res[6]!=0) res[6][26]=a0;
if (res[6]!=0) res[6][27]=a0;
if (res[6]!=0) res[6][28]=a0;
if (res[6]!=0) res[6][29]=a0;
if (res[6]!=0) res[6][30]=a2;
if (res[6]!=0) res[6][31]=a0;
if (res[6]!=0) res[6][32]=a0;
if (res[6]!=0) res[6][33]=a0;
if (res[6]!=0) res[6][34]=a0;
if (res[6]!=0) res[6][35]=a0;
if (res[6]!=0) res[6][36]=a0;
if (res[6]!=0) res[6][37]=a0;
if (res[6]!=0) res[6][38]=a0;
if (res[6]!=0) res[6][39]=a2;
if (res[8]!=0) res[8][0]=a0;
if (res[9]!=0) res[9][0]=a0;
if (res[9]!=0) res[9][1]=a0;
if (res[9]!=0) res[9][2]=a0;
if (res[9]!=0) res[9][3]=a0;
if (res[9]!=0) res[9][4]=a0;
if (res[9]!=0) res[9][5]=a0;
if (res[9]!=0) res[9][6]=a0;
if (res[9]!=0) res[9][7]=a0;
if (res[9]!=0) res[9][8]=a0;
a3=1.9620000000000001e+01;
if (res[9]!=0) res[9][9]=a3;
if (res[10]!=0) res[10][0]=a1;
if (res[11]!=0) res[11][0]=a0;
if (res[12]!=0) res[12][0]=a2;
if (res[13]!=0) res[13][0]=a0;
if (res[14]!=0) res[14][0]=a0;
if (res[14]!=0) res[14][1]=a2;
a1=3.;
if (res[14]!=0) res[14][2]=a1;
a3=4.;
if (res[14]!=0) res[14][3]=a3;
a4=5.;
if (res[14]!=0) res[14][4]=a4;
if (res[14]!=0) res[14][5]=a4;
if (res[15]!=0) res[15][0]=a0;
if (res[15]!=0) res[15][1]=a2;
a2=2.;
if (res[15]!=0) res[15][2]=a2;
if (res[15]!=0) res[15][3]=a1;
if (res[15]!=0) res[15][4]=a3;
if (res[16]!=0) res[16][0]=a0;
return 0;
}
CASADI_SYMBOL_EXPORT int pendulum_dae_dyn_gnsf_get_matrices_fun(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem){
return casadi_f0(arg, res, iw, w, mem);
}
CASADI_SYMBOL_EXPORT void pendulum_dae_dyn_gnsf_get_matrices_fun_incref(void) {
}
CASADI_SYMBOL_EXPORT void pendulum_dae_dyn_gnsf_get_matrices_fun_decref(void) {
}
CASADI_SYMBOL_EXPORT casadi_int pendulum_dae_dyn_gnsf_get_matrices_fun_n_in(void) { return 1;}
CASADI_SYMBOL_EXPORT casadi_int pendulum_dae_dyn_gnsf_get_matrices_fun_n_out(void) { return 17;}
CASADI_SYMBOL_EXPORT const char* pendulum_dae_dyn_gnsf_get_matrices_fun_name_in(casadi_int i){
switch (i) {
case 0: return "i0";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const char* pendulum_dae_dyn_gnsf_get_matrices_fun_name_out(casadi_int i){
switch (i) {
case 0: return "o0";
case 1: return "o1";
case 2: return "o2";
case 3: return "o3";
case 4: return "o4";
case 5: return "o5";
case 6: return "o6";
case 7: return "o7";
case 8: return "o8";
case 9: return "o9";
case 10: return "o10";
case 11: return "o11";
case 12: return "o12";
case 13: return "o13";
case 14: return "o14";
case 15: return "o15";
case 16: return "o16";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* pendulum_dae_dyn_gnsf_get_matrices_fun_sparsity_in(casadi_int i) {
switch (i) {
case 0: return casadi_s0;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* pendulum_dae_dyn_gnsf_get_matrices_fun_sparsity_out(casadi_int i) {
switch (i) {
case 0: return casadi_s1;
case 1: return casadi_s2;
case 2: return casadi_s3;
case 3: return casadi_s4;
case 4: return casadi_s5;
case 5: return casadi_s5;
case 6: return casadi_s5;
case 7: return casadi_s6;
case 8: return casadi_s0;
case 9: return casadi_s2;
case 10: return casadi_s0;
case 11: return casadi_s0;
case 12: return casadi_s0;
case 13: return casadi_s0;
case 14: return casadi_s7;
case 15: return casadi_s8;
case 16: return casadi_s0;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT int pendulum_dae_dyn_gnsf_get_matrices_fun_work(casadi_int *sz_arg, casadi_int* sz_res, casadi_int *sz_iw, casadi_int *sz_w) {
if (sz_arg) *sz_arg = 1;
if (sz_res) *sz_res = 17;
if (sz_iw) *sz_iw = 0;
if (sz_w) *sz_w = 0;
return 0;
}
#ifdef __cplusplus
} /* extern "C" */
#endif
|
the_stack_data/29824807.c
|
/* $Id: insertsort.c,v 1.2 2005/04/04 11:34:58 csg Exp $ */
/*************************************************************************/
/* */
/* SNU-RT Benchmark Suite for Worst Case Timing Analysis */
/* ===================================================== */
/* Collected and Modified by S.-S. Lim */
/* [email protected] */
/* Real-Time Research Group */
/* Seoul National University */
/* */
/* */
/* < Features > - restrictions for our experimental environment */
/* */
/* 1. Completely structured. */
/* - There are no unconditional jumps. */
/* - There are no exit from loop bodies. */
/* (There are no 'break' or 'return' in loop bodies) */
/* 2. No 'switch' statements. */
/* 3. No 'do..while' statements. */
/* 4. Expressions are restricted. */
/* - There are no multiple expressions joined by 'or', */
/* 'and' operations. */
/* 5. No library calls. */
/* - All the functions needed are implemented in the */
/* source file. */
/* */
/* */
/*************************************************************************/
/* */
/* FILE: insertsort.c */
/* SOURCE : Public Domain Code */
/* */
/* DESCRIPTION : */
/* */
/* Insertion sort for 10 integer numbers. */
/* The integer array a[] is initialized in main function. */
/* */
/* REMARK : */
/* */
/* EXECUTION TIME : */
/* */
/* */
/*************************************************************************/
static int cnt1, cnt2;
unsigned int a[11];
int main()
{
int i,j, temp;
a[0] = 0; /* assume all data is positive */
a[1] = 11; a[2]=10;a[3]=9; a[4]=8; a[5]=7; a[6]=6; a[7]=5;
a[8] =4; a[9]=3; a[10]=2;
i = 2;
while(i <= 10){
cnt1++;
j = i;
#ifdef DEBUG
cnt2=0;
#endif
while (a[j] < a[j-1])
{
cnt2++;
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
j--;
}
#ifdef DEBUG
printf("Inner Loop Counts: %d\n", cnt2);
#endif
i++;
}
#ifdef DEBUG
printf("Outer Loop : %d , Inner Loop : %d\n", cnt1, cnt2);
#endif
return cnt1+cnt2;
}
|
the_stack_data/89200092.c
|
#include <stdio.h>
/* 8 - máximo divisor comum dos inteiros x e y é o maior inteiro que é divisível por x e y. Escreva uma função recursiva mdc em C,
que retorna o máximo divisor comum de x e y. O mdc de x e y é definido como segue: se y é igual a 0, então mdc(x,y) é x;
caso contrário, mdc(x,y) é mdc (y, x%y), onde % é o operador resto.*/
int maxDivCom(int a, int b) {
if( b == 0) {
return a;
}
return maxDivCom(b, a % b);
}
int main(void) {
int x,y;
printf("\n====================== Q8 =======================\n");
printf("digite um numero: ");
scanf("%d",&x);
printf("digite outro numero: ");
scanf("%d",&y);
printf("\n%d ",maxDivCom(x, y));
return 0;
}
|
the_stack_data/150140504.c
|
/***
* This code is a part of EvoApproxLib library (ehw.fit.vutbr.cz/approxlib) distributed under The MIT License.
* When used, please cite the following article(s): V. Mrazek, Z. Vasicek, L. Sekanina, H. Jiang and J. Han, "Scalable Construction of Approximate Multipliers With Formally Guaranteed Worst Case Error" in IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 26, no. 11, pp. 2572-2576, Nov. 2018. doi: 10.1109/TVLSI.2018.2856362
* This file contains a circuit from a sub-set of pareto optimal circuits with respect to the pwr and ep parameters
***/
// MAE% = 0.00029 %
// MAE = 12374
// WCE% = 0.0015 %
// WCE = 66049
// WCRE% = 100.00 %
// EP% = 47.90 %
// MRE% = 0.012 %
// MSE = 80900.511e4
// PDK45_PWR = 2.173 mW
// PDK45_AREA = 3052.3 um2
// PDK45_DELAY = 3.13 ns
#include <stdint.h>
#include <stdlib.h>
uint64_t mult8_cgp14ep_ep13107_wc1_csamrca(const uint64_t B,const uint64_t A)
{
uint64_t O, dout_17, dout_18, dout_19, dout_20, dout_21, dout_22, dout_23, dout_24, dout_25, dout_26, dout_27, dout_28, dout_29, dout_30, dout_31, dout_32, dout_33, dout_34, dout_35, dout_36, dout_37, dout_38, dout_39, dout_40, dout_41, dout_42, dout_43, dout_44, dout_45, dout_46, dout_47, dout_48, dout_49, dout_50, dout_51, dout_52, dout_53, dout_54, dout_55, dout_56, dout_57, dout_58, dout_59, dout_60, dout_61, dout_62, dout_63, dout_64, dout_65, dout_66, dout_67, dout_68, dout_69, dout_70, dout_71, dout_72, dout_73, dout_74, dout_75, dout_76, dout_77, dout_78, dout_79, dout_80, dout_81, dout_82, dout_83, dout_84, dout_85, dout_86, dout_87, dout_88, dout_89, dout_90, dout_91, dout_92, dout_93, dout_94, dout_95, dout_96, dout_97, dout_98, dout_99, dout_100, dout_101, dout_102, dout_103, dout_104, dout_105, dout_106, dout_107, dout_108, dout_109, dout_110, dout_111, dout_112, dout_113, dout_114, dout_115, dout_116, dout_117, dout_118, dout_119, dout_120, dout_121, dout_122, dout_123, dout_124, dout_125, dout_126, dout_127, dout_128, dout_129, dout_130, dout_131, dout_132, dout_133, dout_134, dout_135, dout_136, dout_137, dout_138, dout_139, dout_140, dout_141, dout_142, dout_143, dout_144, dout_145, dout_146, dout_147, dout_148, dout_149, dout_150, dout_151, dout_152, dout_153, dout_154, dout_155, dout_156, dout_157, dout_158, dout_159, dout_160, dout_161, dout_162, dout_163, dout_164, dout_165, dout_166, dout_167, dout_168, dout_169, dout_170, dout_171, dout_172, dout_173, dout_174, dout_175, dout_176, dout_177, dout_178, dout_179, dout_180, dout_181, dout_182, dout_183, dout_184, dout_185, dout_186, dout_187, dout_188, dout_189, dout_190, dout_191, dout_192, dout_193, dout_194, dout_195, dout_196, dout_197, dout_198, dout_199, dout_200, dout_201, dout_202, dout_203, dout_204, dout_205, dout_206, dout_207, dout_208, dout_209, dout_210, dout_211, dout_212, dout_213, dout_214, dout_215, dout_216, dout_217, dout_218, dout_219, dout_220, dout_221, dout_222, dout_223, dout_224, dout_225, dout_226, dout_227, dout_228, dout_229, dout_230, dout_231, dout_232, dout_233, dout_234, dout_235, dout_236, dout_237, dout_238, dout_239, dout_240, dout_241, dout_242, dout_243, dout_244, dout_245, dout_246, dout_247, dout_248, dout_249, dout_250, dout_251, dout_252, dout_253, dout_254, dout_255, dout_256, dout_257, dout_258, dout_259, dout_260, dout_261, dout_262, dout_263, dout_264, dout_265, dout_266, dout_267, dout_268, dout_269, dout_270, dout_271, dout_272, dout_273, dout_274, dout_275, dout_276, dout_277, dout_278, dout_279, dout_280, dout_281, dout_282, dout_283, dout_284, dout_285, dout_286, dout_287, dout_288, dout_289, dout_290, dout_291, dout_292, dout_293, dout_294, dout_295, dout_296, dout_297, dout_298, dout_299, dout_300, dout_301, dout_302, dout_303, dout_304, dout_305, dout_306, dout_307, dout_308, dout_309, dout_310, dout_311, dout_312, dout_313, dout_314, dout_315, dout_316, dout_317, dout_318, dout_319, dout_320, dout_321, dout_322, dout_323, dout_324, dout_325, dout_326, dout_327, dout_328, dout_329, dout_330, dout_331, dout_332, dout_333, dout_334, dout_335; int avg=0;
dout_17=((B >> 1)&1)&((A >> 0)&1);
dout_18=((B >> 2)&1)&((A >> 0)&1);
dout_19=((B >> 3)&1)&((A >> 0)&1);
dout_20=((B >> 4)&1)&((A >> 0)&1);
dout_21=((B >> 5)&1)&((A >> 0)&1);
dout_22=((B >> 6)&1)&((A >> 0)&1);
dout_23=((B >> 7)&1)&((A >> 0)&1);
dout_24=((B >> 0)&1)&((A >> 1)&1);
dout_25=((B >> 1)&1)&((A >> 1)&1);
dout_26=((B >> 2)&1)&((A >> 1)&1);
dout_27=((B >> 3)&1)&((A >> 1)&1);
dout_28=((B >> 4)&1)&((A >> 1)&1);
dout_29=((B >> 5)&1)&((A >> 1)&1);
dout_30=((B >> 6)&1)&((A >> 1)&1);
dout_31=((B >> 7)&1)&((A >> 1)&1);
dout_32=dout_17^dout_24;
dout_33=dout_17&dout_24;
dout_34=dout_18^dout_25;
dout_35=dout_18&dout_25;
dout_36=dout_19^dout_26;
dout_37=dout_19&dout_26;
dout_38=dout_20^dout_27;
dout_39=dout_20&dout_27;
dout_40=dout_21^dout_28;
dout_41=dout_21&dout_28;
dout_42=dout_22^dout_29;
dout_43=dout_22&dout_29;
dout_44=dout_23^dout_30;
dout_45=dout_23&((B >> 6)&1);
dout_46=((B >> 0)&1)&((A >> 2)&1);
dout_47=((B >> 1)&1)&((A >> 2)&1);
dout_48=((B >> 2)&1)&((A >> 2)&1);
dout_49=((B >> 3)&1)&((A >> 2)&1);
dout_50=((B >> 4)&1)&((A >> 2)&1);
dout_51=((B >> 5)&1)&((A >> 2)&1);
dout_52=((B >> 6)&1)&((A >> 2)&1);
dout_53=((B >> 7)&1)&((A >> 2)&1);
dout_54=dout_34^dout_46;
dout_55=dout_34&dout_46;
dout_56=dout_54&dout_33;
dout_57=dout_54^dout_33;
dout_58=dout_55|dout_56;
dout_59=dout_36^dout_47;
dout_60=dout_36&dout_47;
dout_61=dout_59&dout_35;
dout_62=dout_59^dout_35;
dout_63=dout_60|dout_61;
dout_64=dout_38^dout_48;
dout_65=dout_38&dout_48;
dout_66=dout_64&dout_37;
dout_67=dout_64^dout_37;
dout_68=dout_65|dout_66;
dout_69=dout_40^dout_49;
dout_70=dout_40&dout_49;
dout_71=dout_69&dout_39;
dout_72=dout_69^dout_39;
dout_73=dout_70|dout_71;
dout_74=dout_42^dout_50;
dout_75=dout_42&dout_50;
dout_76=dout_74&dout_41;
dout_77=dout_74^dout_41;
dout_78=dout_75|dout_76;
dout_79=dout_44^dout_51;
dout_80=dout_44&dout_51;
dout_81=dout_79&dout_43;
dout_82=dout_79^dout_43;
dout_83=dout_80|dout_81;
dout_84=dout_31^dout_52;
dout_85=dout_31&dout_52;
dout_86=((A >> 1)&1)&dout_45;
dout_87=dout_84^dout_86;
dout_88=dout_85|dout_86;
dout_89=((B >> 0)&1)&((A >> 3)&1);
dout_90=((B >> 1)&1)&((A >> 3)&1);
dout_91=((B >> 2)&1)&((A >> 3)&1);
dout_92=((B >> 3)&1)&((A >> 3)&1);
dout_93=((B >> 4)&1)&((A >> 3)&1);
dout_94=((B >> 5)&1)&((A >> 3)&1);
dout_95=((B >> 6)&1)&((A >> 3)&1);
dout_96=((B >> 7)&1)&((A >> 3)&1);
dout_97=dout_62^dout_89;
dout_98=dout_62&dout_89;
dout_99=dout_97&dout_58;
dout_100=dout_97^dout_58;
dout_101=dout_98|dout_99;
dout_102=dout_67^dout_90;
dout_103=dout_67&dout_90;
dout_104=dout_102&dout_63;
dout_105=dout_102^dout_63;
dout_106=dout_103|dout_104;
dout_107=dout_72^dout_91;
dout_108=dout_72&dout_91;
dout_109=dout_107&dout_68;
dout_110=dout_107^dout_68;
dout_111=dout_108|dout_109;
dout_112=dout_77^dout_92;
dout_113=dout_77&dout_92;
dout_114=dout_112&dout_73;
dout_115=dout_112^dout_73;
dout_116=dout_113|dout_114;
dout_117=dout_82^dout_93;
dout_118=dout_82&dout_93;
dout_119=dout_117&dout_78;
dout_120=dout_117^dout_78;
dout_121=dout_118|dout_119;
dout_122=dout_87^dout_94;
dout_123=dout_87&dout_94;
dout_124=dout_122&dout_83;
dout_125=dout_122^dout_83;
dout_126=dout_123|dout_124;
dout_127=dout_53^dout_95;
dout_128=dout_53&dout_95;
dout_129=dout_127&dout_88;
dout_130=dout_127^dout_88;
dout_131=dout_128|dout_129;
dout_132=((B >> 0)&1)&((A >> 4)&1);
dout_133=((B >> 1)&1)&((A >> 4)&1);
dout_134=((B >> 2)&1)&((A >> 4)&1);
dout_135=((B >> 3)&1)&((A >> 4)&1);
dout_136=((B >> 4)&1)&((A >> 4)&1);
dout_137=((B >> 5)&1)&((A >> 4)&1);
dout_138=((B >> 6)&1)&((A >> 4)&1);
dout_139=((B >> 7)&1)&((A >> 4)&1);
dout_140=dout_105^dout_132;
dout_141=dout_105&dout_132;
dout_142=dout_140&dout_101;
dout_143=dout_140^dout_101;
dout_144=dout_141|dout_142;
dout_145=dout_110^dout_133;
dout_146=dout_110&dout_133;
dout_147=dout_145&dout_106;
dout_148=dout_145^dout_106;
dout_149=dout_146|dout_147;
dout_150=dout_115^dout_134;
dout_151=dout_115&dout_134;
dout_152=dout_150&dout_111;
dout_153=dout_150^dout_111;
dout_154=dout_151|dout_152;
dout_155=dout_120^dout_135;
dout_156=dout_120&dout_135;
dout_157=dout_155&dout_116;
dout_158=dout_155^dout_116;
dout_159=dout_156|dout_157;
dout_160=dout_125^dout_136;
dout_161=dout_125&dout_136;
dout_162=dout_160&dout_121;
dout_163=dout_160^dout_121;
dout_164=dout_161|dout_162;
dout_165=dout_130^dout_137;
dout_166=dout_130&dout_137;
dout_167=dout_165&dout_126;
dout_168=dout_165^dout_126;
dout_169=dout_166|dout_167;
dout_170=dout_96^dout_138;
dout_171=dout_96&dout_138;
dout_172=dout_170&dout_131;
dout_173=dout_170^dout_131;
dout_174=dout_171|dout_172;
dout_175=((B >> 0)&1)&((A >> 5)&1);
dout_176=((B >> 1)&1)&((A >> 5)&1);
dout_177=((B >> 2)&1)&((A >> 5)&1);
dout_178=((B >> 3)&1)&((A >> 5)&1);
dout_179=((B >> 4)&1)&((A >> 5)&1);
dout_180=((B >> 5)&1)&((A >> 5)&1);
dout_181=((B >> 6)&1)&((A >> 5)&1);
dout_182=((B >> 7)&1)&((A >> 5)&1);
dout_183=dout_148^dout_175;
dout_184=dout_148&dout_175;
dout_185=dout_183&dout_144;
dout_186=dout_183^dout_144;
dout_187=dout_184|dout_185;
dout_188=dout_153^dout_176;
dout_189=dout_153&dout_176;
dout_190=dout_188&dout_149;
dout_191=dout_188^dout_149;
dout_192=dout_189|dout_190;
dout_193=dout_158^dout_177;
dout_194=dout_158&dout_177;
dout_195=dout_193&dout_154;
dout_196=dout_193^dout_154;
dout_197=dout_194|dout_195;
dout_198=dout_163^dout_178;
dout_199=dout_163&dout_178;
dout_200=dout_198&dout_159;
dout_201=dout_198^dout_159;
dout_202=dout_199|dout_200;
dout_203=dout_168^dout_179;
dout_204=dout_168&dout_179;
dout_205=dout_203&dout_164;
dout_206=dout_203^dout_164;
dout_207=dout_204|dout_205;
dout_208=dout_173^dout_180;
dout_209=dout_173&dout_180;
dout_210=dout_208&dout_169;
dout_211=dout_208^dout_169;
dout_212=dout_209|dout_210;
dout_213=dout_139^dout_181;
dout_214=dout_139&dout_181;
dout_215=dout_213&dout_174;
dout_216=dout_213^dout_174;
dout_217=dout_214|dout_215;
dout_218=((B >> 0)&1)&((A >> 6)&1);
dout_219=((B >> 1)&1)&((A >> 6)&1);
dout_220=((B >> 2)&1)&((A >> 6)&1);
dout_221=((B >> 3)&1)&((A >> 6)&1);
dout_222=((B >> 4)&1)&((A >> 6)&1);
dout_223=((B >> 5)&1)&((A >> 6)&1);
dout_224=((B >> 6)&1)&((A >> 6)&1);
dout_225=((B >> 7)&1)&((A >> 6)&1);
dout_226=dout_191^dout_218;
dout_227=dout_191&dout_218;
dout_228=dout_226&dout_187;
dout_229=dout_226^dout_187;
dout_230=dout_227|dout_228;
dout_231=dout_196^dout_219;
dout_232=dout_196&dout_219;
dout_233=dout_231&dout_192;
dout_234=dout_231^dout_192;
dout_235=dout_232|dout_233;
dout_236=dout_201^dout_220;
dout_237=dout_201&dout_220;
dout_238=dout_236&dout_197;
dout_239=dout_236^dout_197;
dout_240=dout_237|dout_238;
dout_241=dout_206^dout_221;
dout_242=dout_206&dout_221;
dout_243=dout_241&dout_202;
dout_244=dout_241^dout_202;
dout_245=dout_242|dout_243;
dout_246=dout_211^dout_222;
dout_247=dout_211&dout_222;
dout_248=dout_246&dout_207;
dout_249=dout_246^dout_207;
dout_250=dout_247|dout_248;
dout_251=dout_216^dout_223;
dout_252=dout_216&dout_223;
dout_253=dout_251&dout_212;
dout_254=dout_251^dout_212;
dout_255=dout_252|dout_253;
dout_256=dout_182^dout_224;
dout_257=dout_182&dout_224;
dout_258=dout_256&dout_217;
dout_259=dout_256^dout_217;
dout_260=dout_257|dout_258;
dout_261=((B >> 0)&1)&((A >> 7)&1);
dout_262=((B >> 1)&1)&((A >> 7)&1);
dout_263=((B >> 2)&1)&((A >> 7)&1);
dout_264=((B >> 3)&1)&((A >> 7)&1);
dout_265=((B >> 4)&1)&((A >> 7)&1);
dout_266=((B >> 5)&1)&((A >> 7)&1);
dout_267=((B >> 6)&1)&((A >> 7)&1);
dout_268=((B >> 7)&1)&((A >> 7)&1);
dout_269=dout_234^dout_261;
dout_270=dout_234&dout_261;
dout_271=dout_269&dout_230;
dout_272=dout_269^dout_230;
dout_273=dout_270|dout_271;
dout_274=dout_239^dout_262;
dout_275=dout_239&dout_262;
dout_276=dout_274&dout_235;
dout_277=dout_274^dout_235;
dout_278=dout_275|dout_276;
dout_279=dout_244^dout_263;
dout_280=dout_244&dout_263;
dout_281=dout_279&dout_240;
dout_282=dout_279^dout_240;
dout_283=dout_280|dout_281;
dout_284=dout_249^dout_264;
dout_285=dout_249&dout_264;
dout_286=dout_284&dout_245;
dout_287=dout_284^dout_245;
dout_288=dout_285|dout_286;
dout_289=dout_254^dout_265;
dout_290=dout_254&dout_265;
dout_291=dout_289&dout_250;
dout_292=dout_289^dout_250;
dout_293=dout_290|dout_291;
dout_294=dout_259^dout_266;
dout_295=dout_259&dout_266;
dout_296=dout_294&dout_255;
dout_297=dout_294^dout_255;
dout_298=dout_295|dout_296;
dout_299=dout_225^dout_267;
dout_300=dout_225&dout_267;
dout_301=dout_299&dout_260;
dout_302=dout_299^dout_260;
dout_303=dout_300|dout_301;
dout_304=dout_277^dout_273;
dout_305=dout_277&dout_273;
dout_306=dout_282^dout_278;
dout_307=dout_282&dout_278;
dout_308=dout_306&dout_305;
dout_309=dout_306^dout_305;
dout_310=dout_307|dout_308;
dout_311=dout_287^dout_283;
dout_312=dout_287&dout_283;
dout_313=dout_311&dout_310;
dout_314=dout_311^dout_310;
dout_315=dout_312|dout_313;
dout_316=dout_292^dout_288;
dout_317=dout_292&dout_288;
dout_318=dout_316&dout_315;
dout_319=dout_316^dout_315;
dout_320=dout_317|dout_318;
dout_321=dout_297^dout_293;
dout_322=dout_297&dout_293;
dout_323=dout_321&dout_320;
dout_324=dout_321^dout_320;
dout_325=dout_322|dout_323;
dout_326=dout_302^dout_298;
dout_327=dout_302&dout_298;
dout_328=dout_326&dout_325;
dout_329=dout_326^dout_325;
dout_330=dout_327|dout_328;
dout_331=dout_268^dout_303;
dout_332=((A >> 7)&1)&dout_303;
dout_333=dout_331&dout_330;
dout_334=dout_331^dout_330;
dout_335=dout_332|dout_333;
O = 0;
O |= (dout_58&1) << 0;
O |= (dout_32&1) << 1;
O |= (dout_57&1) << 2;
O |= (dout_100&1) << 3;
O |= (dout_143&1) << 4;
O |= (dout_186&1) << 5;
O |= (dout_229&1) << 6;
O |= (dout_272&1) << 7;
O |= (dout_304&1) << 8;
O |= (dout_309&1) << 9;
O |= (dout_314&1) << 10;
O |= (dout_319&1) << 11;
O |= (dout_324&1) << 12;
O |= (dout_329&1) << 13;
O |= (dout_334&1) << 14;
O |= (dout_335&1) << 15;
return O;
}
uint32_t mul16u_60L (uint16_t a, uint16_t b) {
static uint16_t * cacheLL = NULL;
static uint16_t * cacheLH = NULL;
static uint16_t * cacheHL = NULL;
static uint16_t * cacheHH = NULL;
int fillData = cacheLL == NULL || cacheLH == NULL || cacheHL == NULL || cacheHH == NULL;
if(!cacheLL) cacheLL = (uint16_t *)malloc(256 * 256 * sizeof(uint16_t));
if(!cacheLH) cacheLH = (uint16_t *)malloc(256 * 256 * sizeof(uint16_t));
if(!cacheHL) cacheHL = (uint16_t *)malloc(256 * 256 * sizeof(uint16_t));
if(!cacheHH) cacheHH = (uint16_t *)malloc(256 * 256 * sizeof(uint16_t));
if(fillData) {
for(int i = 0; i < 256; i++) {
for(int j = 0; j < 256; j++) {
cacheLL[i * 256 + j] = mult8_cgp14ep_ep13107_wc1_csamrca(i, j);
cacheLH[i * 256 + j] = mult8_cgp14ep_ep13107_wc1_csamrca(i, j);
cacheHL[i * 256 + j] = mult8_cgp14ep_ep13107_wc1_csamrca(i, j);
cacheHH[i * 256 + j] = mult8_cgp14ep_ep13107_wc1_csamrca(i, j);
}
}
}
uint32_t opt = 0;
opt += (uint32_t)cacheLL[(a & 0xFF ) * 256 + (b & 0xFF )];
opt += (uint32_t)cacheLH[(a & 0xFF ) * 256 + ((b >> 8) & 0xFF )] << 8;
opt += (uint32_t)cacheHL[((a >> 8) & 0xFF) * 256 + (b & 0xFF )] << 8;
opt += (uint32_t)cacheHH[((a >> 8) & 0xFF) * 256 + ((b >> 8) & 0xFF )] << 16;
return opt;
}
|
the_stack_data/132617.c
|
// general protection fault in cpuacct_account_field
// https://syzkaller.appspot.com/bug?id=eb2f733a8932fb8d1ade156b73cda7cf3af1b6fa
// status:invalid
// autogenerated by syzkaller (http://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <dirent.h>
#include <endian.h>
#include <errno.h>
#include <errno.h>
#include <errno.h>
#include <fcntl.h>
#include <linux/futex.h>
#include <pthread.h>
#include <sched.h>
#include <signal.h>
#include <signal.h>
#include <stdarg.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/mount.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/prctl.h>
#include <sys/resource.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>
__attribute__((noreturn)) static void doexit(int status)
{
volatile unsigned i;
syscall(__NR_exit_group, status);
for (i = 0;; i++) {
}
}
#include <errno.h>
#include <stdarg.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
const int kFailStatus = 67;
const int kRetryStatus = 69;
static void fail(const char* msg, ...)
{
int e = errno;
va_list args;
va_start(args, msg);
vfprintf(stderr, msg, args);
va_end(args);
fprintf(stderr, " (errno %d)\n", e);
doexit((e == ENOMEM || e == EAGAIN) ? kRetryStatus : kFailStatus);
}
static void exitf(const char* msg, ...)
{
int e = errno;
va_list args;
va_start(args, msg);
vfprintf(stderr, msg, args);
va_end(args);
fprintf(stderr, " (errno %d)\n", e);
doexit(kRetryStatus);
}
static uint64_t current_time_ms()
{
struct timespec ts;
if (clock_gettime(CLOCK_MONOTONIC, &ts))
fail("clock_gettime failed");
return (uint64_t)ts.tv_sec * 1000 + (uint64_t)ts.tv_nsec / 1000000;
}
static void use_temporary_dir()
{
char tmpdir_template[] = "./syzkaller.XXXXXX";
char* tmpdir = mkdtemp(tmpdir_template);
if (!tmpdir)
fail("failed to mkdtemp");
if (chmod(tmpdir, 0777))
fail("failed to chmod");
if (chdir(tmpdir))
fail("failed to chdir");
}
static bool write_file(const char* file, const char* what, ...)
{
char buf[1024];
va_list args;
va_start(args, what);
vsnprintf(buf, sizeof(buf), what, args);
va_end(args);
buf[sizeof(buf) - 1] = 0;
int len = strlen(buf);
int fd = open(file, O_WRONLY | O_CLOEXEC);
if (fd == -1)
return false;
if (write(fd, buf, len) != len) {
int err = errno;
close(fd);
errno = err;
return false;
}
close(fd);
return true;
}
static void setup_cgroups()
{
if (mkdir("/syzcgroup", 0777)) {
}
if (mkdir("/syzcgroup/unified", 0777)) {
}
if (mount("none", "/syzcgroup/unified", "cgroup2", 0, NULL)) {
}
if (chmod("/syzcgroup/unified", 0777)) {
}
if (!write_file("/syzcgroup/unified/cgroup.subtree_control",
"+cpu +memory +io +pids +rdma")) {
}
if (mkdir("/syzcgroup/cpu", 0777)) {
}
if (mount("none", "/syzcgroup/cpu", "cgroup", 0,
"cpuset,cpuacct,perf_event,hugetlb")) {
}
if (!write_file("/syzcgroup/cpu/cgroup.clone_children", "1")) {
}
if (chmod("/syzcgroup/cpu", 0777)) {
}
if (mkdir("/syzcgroup/net", 0777)) {
}
if (mount("none", "/syzcgroup/net", "cgroup", 0,
"net_cls,net_prio,devices,freezer")) {
}
if (chmod("/syzcgroup/net", 0777)) {
}
}
static void setup_binfmt_misc()
{
if (!write_file("/proc/sys/fs/binfmt_misc/register",
":syz0:M:0:syz0::./file0:")) {
}
if (!write_file("/proc/sys/fs/binfmt_misc/register",
":syz1:M:1:yz1::./file0:POC")) {
}
}
static void loop();
static void sandbox_common()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setsid();
struct rlimit rlim;
rlim.rlim_cur = rlim.rlim_max = 160 << 20;
setrlimit(RLIMIT_AS, &rlim);
rlim.rlim_cur = rlim.rlim_max = 8 << 20;
setrlimit(RLIMIT_MEMLOCK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 136 << 20;
setrlimit(RLIMIT_FSIZE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 1 << 20;
setrlimit(RLIMIT_STACK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 0;
setrlimit(RLIMIT_CORE, &rlim);
if (unshare(CLONE_NEWNS)) {
}
if (unshare(CLONE_NEWIPC)) {
}
if (unshare(0x02000000)) {
}
if (unshare(CLONE_NEWUTS)) {
}
if (unshare(CLONE_SYSVSEM)) {
}
}
int wait_for_loop(int pid)
{
if (pid < 0)
fail("sandbox fork failed");
int status = 0;
while (waitpid(-1, &status, __WALL) != pid) {
}
return WEXITSTATUS(status);
}
static int do_sandbox_none(void)
{
if (unshare(CLONE_NEWPID)) {
}
int pid = fork();
if (pid != 0)
return wait_for_loop(pid);
setup_cgroups();
setup_binfmt_misc();
sandbox_common();
if (unshare(CLONE_NEWNET)) {
}
loop();
doexit(1);
}
static void remove_dir(const char* dir)
{
DIR* dp;
struct dirent* ep;
int iter = 0;
retry:
while (umount2(dir, MNT_DETACH) == 0) {
}
dp = opendir(dir);
if (dp == NULL) {
if (errno == EMFILE) {
exitf("opendir(%s) failed due to NOFILE, exiting", dir);
}
exitf("opendir(%s) failed", dir);
}
while ((ep = readdir(dp))) {
if (strcmp(ep->d_name, ".") == 0 || strcmp(ep->d_name, "..") == 0)
continue;
char filename[FILENAME_MAX];
snprintf(filename, sizeof(filename), "%s/%s", dir, ep->d_name);
struct stat st;
if (lstat(filename, &st))
exitf("lstat(%s) failed", filename);
if (S_ISDIR(st.st_mode)) {
remove_dir(filename);
continue;
}
int i;
for (i = 0;; i++) {
if (unlink(filename) == 0)
break;
if (errno == EROFS) {
break;
}
if (errno != EBUSY || i > 100)
exitf("unlink(%s) failed", filename);
if (umount2(filename, MNT_DETACH))
exitf("umount(%s) failed", filename);
}
}
closedir(dp);
int i;
for (i = 0;; i++) {
if (rmdir(dir) == 0)
break;
if (i < 100) {
if (errno == EROFS) {
break;
}
if (errno == EBUSY) {
if (umount2(dir, MNT_DETACH))
exitf("umount(%s) failed", dir);
continue;
}
if (errno == ENOTEMPTY) {
if (iter < 100) {
iter++;
goto retry;
}
}
}
exitf("rmdir(%s) failed", dir);
}
}
static void execute_one();
extern unsigned long long procid;
static void loop()
{
char cgroupdir[64];
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/unified/syz%llu", procid);
char cgroupdir_cpu[64];
snprintf(cgroupdir_cpu, sizeof(cgroupdir_cpu), "/syzcgroup/cpu/syz%llu",
procid);
char cgroupdir_net[64];
snprintf(cgroupdir_net, sizeof(cgroupdir_net), "/syzcgroup/net/syz%llu",
procid);
if (mkdir(cgroupdir, 0777)) {
}
if (mkdir(cgroupdir_cpu, 0777)) {
}
if (mkdir(cgroupdir_net, 0777)) {
}
int pid = getpid();
char procs_file[128];
snprintf(procs_file, sizeof(procs_file), "%s/cgroup.procs", cgroupdir);
if (!write_file(procs_file, "%d", pid)) {
}
snprintf(procs_file, sizeof(procs_file), "%s/cgroup.procs", cgroupdir_cpu);
if (!write_file(procs_file, "%d", pid)) {
}
snprintf(procs_file, sizeof(procs_file), "%s/cgroup.procs", cgroupdir_net);
if (!write_file(procs_file, "%d", pid)) {
}
int iter;
for (iter = 0;; iter++) {
char cwdbuf[32];
sprintf(cwdbuf, "./%d", iter);
if (mkdir(cwdbuf, 0777))
fail("failed to mkdir");
int pid = fork();
if (pid < 0)
fail("clone failed");
if (pid == 0) {
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
if (chdir(cwdbuf))
fail("failed to chdir");
if (symlink(cgroupdir, "./cgroup")) {
}
if (symlink(cgroupdir_cpu, "./cgroup.cpu")) {
}
if (symlink(cgroupdir_net, "./cgroup.net")) {
}
execute_one();
doexit(0);
}
int status = 0;
uint64_t start = current_time_ms();
for (;;) {
int res = waitpid(-1, &status, __WALL | WNOHANG);
if (res == pid) {
break;
}
usleep(1000);
if (current_time_ms() - start < 3 * 1000)
continue;
kill(-pid, SIGKILL);
kill(pid, SIGKILL);
while (waitpid(-1, &status, __WALL) != pid) {
}
break;
}
remove_dir(cwdbuf);
}
}
struct thread_t {
int created, running, call;
pthread_t th;
};
static struct thread_t threads[16];
static void execute_call(int call);
static int running;
static int collide;
static void* thr(void* arg)
{
struct thread_t* th = (struct thread_t*)arg;
for (;;) {
while (!__atomic_load_n(&th->running, __ATOMIC_ACQUIRE))
syscall(SYS_futex, &th->running, FUTEX_WAIT, 0, 0);
execute_call(th->call);
__atomic_fetch_sub(&running, 1, __ATOMIC_RELAXED);
__atomic_store_n(&th->running, 0, __ATOMIC_RELEASE);
syscall(SYS_futex, &th->running, FUTEX_WAKE);
}
return 0;
}
static void execute(int num_calls)
{
int call, thread;
running = 0;
for (call = 0; call < num_calls; call++) {
for (thread = 0; thread < sizeof(threads) / sizeof(threads[0]); thread++) {
struct thread_t* th = &threads[thread];
if (!th->created) {
th->created = 1;
pthread_attr_t attr;
pthread_attr_init(&attr);
pthread_attr_setstacksize(&attr, 128 << 10);
pthread_create(&th->th, &attr, thr, th);
}
if (!__atomic_load_n(&th->running, __ATOMIC_ACQUIRE)) {
th->call = call;
__atomic_fetch_add(&running, 1, __ATOMIC_RELAXED);
__atomic_store_n(&th->running, 1, __ATOMIC_RELEASE);
syscall(SYS_futex, &th->running, FUTEX_WAKE);
if (collide && call % 2)
break;
struct timespec ts;
ts.tv_sec = 0;
ts.tv_nsec = 20 * 1000 * 1000;
syscall(SYS_futex, &th->running, FUTEX_WAIT, 1, &ts);
if (__atomic_load_n(&running, __ATOMIC_RELAXED))
usleep((call == num_calls - 1) ? 10000 : 1000);
break;
}
}
}
}
#ifndef __NR_bpf
#define __NR_bpf 321
#endif
uint64_t r[1] = {0xffffffffffffffff};
unsigned long long procid;
void execute_call(int call)
{
long res;
switch (call) {
case 0:
syscall(__NR_socketpair, 0, 0x80000, 2, 0x20000140);
break;
case 1:
syscall(__NR_socket, 0xa, 1, 0);
break;
case 2:
*(uint32_t*)0x20000280 = 0x12;
*(uint32_t*)0x20000284 = 0;
*(uint32_t*)0x20000288 = 4;
*(uint32_t*)0x2000028c = 7;
*(uint32_t*)0x20000290 = 0;
*(uint32_t*)0x20000294 = 1;
*(uint32_t*)0x20000298 = 0;
*(uint8_t*)0x2000029c = 0;
*(uint8_t*)0x2000029d = 0;
*(uint8_t*)0x2000029e = 0;
*(uint8_t*)0x2000029f = 0;
*(uint8_t*)0x200002a0 = 0;
*(uint8_t*)0x200002a1 = 0;
*(uint8_t*)0x200002a2 = 0;
*(uint8_t*)0x200002a3 = 0;
*(uint8_t*)0x200002a4 = 0;
*(uint8_t*)0x200002a5 = 0;
*(uint8_t*)0x200002a6 = 0;
*(uint8_t*)0x200002a7 = 0;
*(uint8_t*)0x200002a8 = 0;
*(uint8_t*)0x200002a9 = 0;
*(uint8_t*)0x200002aa = 0;
*(uint8_t*)0x200002ab = 0;
res = syscall(__NR_bpf, 0, 0x20000280, 0x2c);
if (res != -1)
r[0] = res;
break;
case 3:
*(uint32_t*)0x20000180 = r[0];
*(uint64_t*)0x20000188 = 0x20000000;
*(uint64_t*)0x20000190 = 0x20000140;
*(uint64_t*)0x20000198 = 0;
syscall(__NR_bpf, 2, 0x20000180, 0x20);
break;
case 4:
*(uint32_t*)0x20000000 = r[0];
*(uint64_t*)0x20000008 = 0x20000080;
*(uint64_t*)0x20000010 = 0x20000140;
*(uint64_t*)0x20000018 = 1;
syscall(__NR_bpf, 2, 0x20000000, 0x20);
break;
}
}
void execute_one()
{
execute(5);
collide = 1;
execute(5);
}
int main()
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
char* cwd = get_current_dir_name();
for (;;) {
if (chdir(cwd))
fail("failed to chdir");
use_temporary_dir();
do_sandbox_none();
}
}
|
the_stack_data/115151.c
|
#include <stdio.h>
#include <string.h>
int check(char y)
{
if (y == 'a' || y == 'A' || y == 'e' || y == 'E' || y == 'i' || y == 'I' || y =='o' || y == 'O' || y == 'u' || y == 'U')
return 1;
return 0;
}
int main ()
{
char x[50], y[50];
int a, b = 0;
printf("Enter the string : ");
gets(x);
for (a = 0; x[a] != '\0'; a++)
{
if (check(x[a]) == 0)
{
y[b] = x[a];
b++;
}
}
y[b] = '\0';
strcpy(x, y);
printf("After removing vowels: %s\n", x);
return 0;
}
|
the_stack_data/234934.c
|
#include <stdio.h>
int main() {
printf("---------------------------------------\n");
printf("| decimal | octal | Hexadecimal |\n");
printf("---------------------------------------\n");
printf("| 0 | 0 | 0 |\n");
printf("| 1 | 1 | 1 |\n");
printf("| 2 | 2 | 2 |\n");
printf("| 3 | 3 | 3 |\n");
printf("| 4 | 4 | 4 |\n");
printf("| 5 | 5 | 5 |\n");
printf("| 6 | 6 | 6 |\n");
printf("| 7 | 7 | 7 |\n");
printf("| 8 | 10 | 8 |\n");
printf("| 9 | 11 | 9 |\n");
printf("| 10 | 12 | A |\n");
printf("| 11 | 13 | B |\n");
printf("| 12 | 14 | C |\n");
printf("| 13 | 15 | D |\n");
printf("| 14 | 16 | E |\n");
printf("| 15 | 17 | F |\n");
printf("---------------------------------------\n");
return 0;
}
|
the_stack_data/67324975.c
|
//Background converted using Mollusk's PAImageConverter
//This Background uses etk_Pal
int etk_Width = 256;
int etk_Height = 192;
const unsigned short etk_Map[768] __attribute__ ((aligned (4))) = {
0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 24,
0, 0, 0, 25, 26, 0, 27, 28, 3, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 24, 24,
0, 0, 50, 51, 52, 53, 54, 55, 3, 56, 57, 58, 59, 60, 61, 62,
63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78,
0, 79, 80, 81, 82, 83, 84, 85, 3, 86, 87, 88, 89, 90, 91, 92,
93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108,
109, 110, 111, 112, 113, 114, 115, 116, 3, 117, 118, 119, 120, 121, 122, 123,
124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139,
140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155,
156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171,
172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187,
188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203,
204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219,
220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235,
236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251,
252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267,
268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283,
284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299,
300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315,
316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331,
3, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346,
347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362,
363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378,
379, 380, 381, 350, 350, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392,
393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408,
409, 410, 411, 350, 350, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422,
423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438,
439, 440, 441, 350, 350, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452,
453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468,
469, 470, 471, 350, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483,
484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499,
500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 350, 512, 513, 514,
515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530,
531, 532, 533, 534, 535, 350, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545,
546, 547, 548, 549, 550, 551, 3, 3, 552, 553, 554, 555, 556, 557, 558, 559,
560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575,
576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591,
592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 569, 603, 604, 605, 606,
607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622,
623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 569, 634, 635, 636, 637,
638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653,
654, 655, 656, 657, 350, 658, 659, 660, 661, 662, 663, 569, 664, 665, 666, 667,
668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683,
684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699,
700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715,
716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731
};
const unsigned char etk_Tiles[46848] __attribute__ ((aligned (4))) = {
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 57,
1, 1, 1, 1, 1, 1, 57, 57, 1, 1, 1, 1, 1, 1, 57, 2,
1, 1, 1, 1, 1, 57, 57, 57, 1, 1, 1, 1, 57, 57, 57, 103,
1, 1, 1, 1, 57, 57, 57, 100, 1, 1, 1, 57, 57, 57, 57, 106,
2, 3, 4, 4, 4, 4, 4, 4, 5, 5, 4, 4, 4, 4, 4, 4,
77, 4, 4, 4, 4, 4, 4, 4, 90, 4, 4, 4, 4, 4, 4, 4,
3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 3, 5, 4, 4, 4, 4, 4, 4, 58, 5, 4, 4, 4, 4, 4,
4, 78, 4, 4, 4, 4, 4, 4, 4, 78, 4, 4, 4, 4, 4, 4,
4, 77, 4, 4, 4, 4, 4, 4, 4, 77, 4, 4, 4, 4, 4, 4,
5, 3, 4, 4, 4, 4, 4, 4, 5, 107, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 6,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 108, 4, 4, 6,
6, 6, 7, 8, 9, 10, 10, 11, 6, 6, 7, 19, 10, 10, 10, 59,
6, 6, 7, 19, 10, 10, 36, 59, 6, 6, 91, 9, 10, 82, 36, 25,
6, 6, 58, 99, 10, 82, 36, 26, 6, 104, 7, 10, 10, 82, 102, 25,
104, 58, 104, 10, 82, 36, 11, 26, 4, 104, 86, 82, 82, 21, 87, 50,
12, 13, 14, 15, 15, 15, 15, 15, 26, 60, 61, 15, 16, 62, 16, 16,
26, 73, 79, 15, 80, 15, 64, 16, 26, 92, 93, 15, 16, 15, 62, 18,
26, 71, 93, 15, 16, 15, 62, 18, 25, 87, 68, 15, 16, 15, 62, 16,
50, 11, 93, 15, 16, 15, 16, 18, 25, 46, 37, 16, 54, 18, 16, 15,
16, 16, 16, 1, 17, 16, 18, 16, 15, 18, 63, 35, 45, 18, 64, 18,
15, 18, 63, 35, 35, 18, 15, 18, 15, 16, 16, 35, 94, 16, 15, 18,
15, 56, 16, 35, 21, 16, 16, 18, 15, 16, 16, 35, 20, 56, 16, 16,
15, 16, 16, 35, 22, 56, 16, 16, 16, 16, 16, 45, 22, 19, 16, 54,
15, 15, 16, 15, 15, 15, 15, 15, 16, 16, 16, 15, 16, 15, 16, 18,
16, 15, 16, 16, 16, 15, 16, 16, 15, 54, 15, 16, 15, 16, 15, 19,
15, 18, 15, 16, 15, 16, 15, 67, 15, 18, 16, 16, 16, 18, 18, 1,
16, 18, 16, 16, 16, 18, 18, 1, 16, 15, 16, 15, 15, 15, 15, 36,
19, 20, 21, 22, 23, 24, 25, 24, 57, 21, 21, 65, 23, 25, 50, 50,
1, 22, 21, 65, 52, 50, 50, 50, 94, 22, 22, 23, 46, 24, 50, 50,
21, 20, 20, 23, 12, 50, 25, 50, 21, 21, 22, 52, 25, 50, 25, 50,
36, 21, 22, 87, 25, 50, 50, 50, 21, 20, 21, 46, 26, 50, 50, 50,
26, 25, 23, 1, 16, 16, 16, 15, 50, 50, 23, 35, 56, 16, 15, 15,
50, 25, 52, 35, 16, 16, 15, 15, 50, 50, 52, 35, 56, 16, 15, 15,
50, 50, 52, 36, 56, 16, 15, 15, 25, 50, 87, 20, 56, 16, 15, 16,
25, 50, 87, 22, 56, 56, 15, 16, 50, 50, 87, 23, 19, 16, 16, 54,
27, 28, 29, 30, 28, 31, 32, 33, 27, 47, 28, 30, 31, 31, 30, 66,
79, 28, 30, 28, 31, 31, 32, 40, 95, 34, 31, 31, 31, 31, 39, 70,
95, 34, 31, 31, 31, 28, 39, 70, 88, 69, 30, 31, 39, 30, 33, 40,
82, 69, 28, 31, 28, 39, 33, 40, 36, 43, 31, 28, 30, 30, 109, 40,
30, 34, 19, 18, 16, 16, 19, 16, 39, 30, 61, 16, 15, 16, 19, 67,
39, 28, 81, 19, 15, 18, 56, 2, 33, 32, 34, 61, 80, 62, 16, 67,
84, 39, 29, 27, 64, 16, 15, 19, 42, 84, 32, 34, 19, 54, 64, 18,
42, 40, 39, 30, 9, 16, 80, 54, 42, 40, 33, 39, 81, 67, 15, 16,
16, 15, 19, 35, 21, 21, 20, 36, 18, 54, 56, 17, 36, 22, 21, 22,
54, 54, 18, 14, 82, 22, 22, 82, 56, 15, 54, 19, 20, 21, 22, 20,
100, 86, 15, 16, 20, 21, 22, 75, 1, 19, 15, 54, 36, 36, 22, 65,
1, 2, 15, 54, 35, 21, 21, 65, 67, 45, 18, 15, 17, 21, 21, 22,
37, 38, 30, 28, 30, 31, 30, 39, 68, 69, 39, 30, 39, 28, 39, 39,
68, 83, 39, 28, 39, 39, 39, 39, 87, 48, 39, 39, 39, 39, 39, 39,
55, 48, 39, 32, 39, 32, 39, 32, 88, 93, 39, 39, 39, 39, 39, 39,
21, 93, 29, 39, 32, 39, 39, 39, 21, 46, 34, 39, 39, 39, 32, 39,
40, 41, 42, 42, 32, 30, 28, 30, 70, 42, 42, 42, 42, 33, 31, 30,
84, 42, 42, 42, 42, 85, 30, 28, 84, 42, 96, 42, 42, 97, 33, 30,
33, 42, 42, 42, 42, 40, 42, 33, 33, 40, 42, 42, 42, 41, 96, 42,
33, 40, 42, 42, 42, 97, 105, 42, 33, 70, 42, 42, 42, 40, 42, 42,
43, 44, 36, 21, 36, 45, 12, 46, 31, 29, 71, 23, 72, 22, 72, 46,
31, 32, 37, 51, 23, 21, 35, 52, 31, 29, 39, 43, 23, 21, 35, 1,
31, 31, 31, 34, 101, 102, 21, 35, 32, 39, 28, 30, 38, 46, 72, 22,
33, 30, 30, 30, 31, 69, 52, 65, 40, 84, 28, 31, 29, 39, 110, 74,
28, 47, 48, 49, 50, 51, 25, 52, 69, 30, 28, 48, 73, 26, 74, 25,
37, 69, 47, 29, 48, 49, 25, 25, 98, 92, 69, 47, 28, 69, 73, 12,
52, 13, 37, 29, 29, 47, 43, 13, 1, 23, 13, 69, 30, 29, 47, 48,
35, 35, 46, 48, 28, 34, 29, 34, 21, 99, 1, 44, 111, 28, 28, 29,
21, 22, 20, 22, 22, 21, 53, 22, 46, 21, 20, 20, 22, 21, 21, 23,
12, 21, 21, 22, 21, 22, 22, 22, 12, 46, 52, 21, 21, 21, 21, 21,
12, 74, 59, 21, 21, 20, 22, 21, 73, 76, 25, 87, 22, 21, 22, 21,
48, 49, 74, 46, 52, 21, 20, 21, 29, 37, 13, 50, 25, 23, 21, 21,
1, 16, 15, 18, 54, 16, 16, 54, 23, 57, 56, 15, 54, 18, 16, 15,
53, 21, 14, 15, 16, 18, 16, 15, 21, 53, 53, 19, 18, 15, 15, 54,
21, 22, 52, 1, 56, 16, 16, 54, 22, 21, 21, 52, 72, 16, 18, 16,
22, 21, 21, 52, 23, 100, 16, 16, 22, 22, 21, 21, 53, 21, 45, 18,
19, 22, 21, 22, 22, 22, 22, 22, 18, 65, 22, 21, 22, 22, 22, 22,
86, 35, 22, 22, 22, 22, 22, 22, 15, 19, 35, 22, 21, 21, 22, 22,
15, 16, 1, 22, 21, 22, 21, 22, 16, 18, 56, 21, 23, 22, 22, 22,
18, 15, 18, 21, 23, 22, 22, 21, 15, 18, 16, 1, 82, 21, 22, 21,
22, 52, 50, 50, 24, 55, 56, 54, 75, 21, 76, 26, 25, 49, 35, 64,
20, 22, 87, 25, 25, 13, 88, 62, 21, 21, 22, 24, 24, 13, 98, 8,
21, 21, 21, 24, 25, 98, 13, 86, 22, 21, 20, 74, 24, 74, 13, 67,
22, 65, 20, 74, 24, 12, 44, 35, 21, 82, 21, 87, 50, 50, 12, 92,
16, 16, 15, 15, 15, 15, 15, 15, 54, 54, 15, 15, 15, 15, 15, 15,
54, 89, 16, 15, 15, 15, 15, 15, 18, 16, 15, 15, 15, 15, 15, 15,
86, 16, 15, 15, 15, 15, 15, 15, 8, 15, 16, 15, 15, 15, 15, 15,
8, 15, 18, 15, 15, 15, 15, 15, 100, 18, 16, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 17, 14, 14, 14, 14, 1, 1, 1, 17, 14, 123, 19, 19,
1, 1, 17, 14, 133, 19, 56, 56, 1, 17, 123, 19, 56, 16, 15, 8,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 17, 2, 1, 1, 1, 1, 1, 1,
123, 14, 14, 14, 1, 1, 1, 1, 19, 19, 19, 123, 17, 1, 1, 1,
56, 56, 19, 19, 14, 17, 1, 1, 8, 54, 18, 56, 123, 14, 17, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9,
1, 1, 1, 1, 1, 1, 9, 9, 1, 1, 1, 1, 1, 1, 1, 9,
1, 1, 1, 1, 1, 1, 9, 9, 1, 1, 1, 1, 1, 9, 9, 9,
1, 1, 9, 57, 9, 112, 100, 113, 1, 9, 1, 9, 57, 112, 117, 4,
1, 9, 9, 9, 112, 112, 127, 4, 9, 9, 9, 9, 112, 112, 4, 4,
9, 9, 9, 112, 9, 112, 5, 4, 9, 9, 9, 112, 112, 112, 4, 4,
9, 9, 9, 9, 112, 89, 4, 4, 9, 9, 9, 112, 112, 113, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 5,
4, 4, 4, 4, 4, 4, 4, 107, 4, 4, 4, 4, 4, 4, 4, 107,
4, 4, 4, 4, 4, 4, 4, 113, 4, 4, 4, 4, 4, 4, 4, 107,
5, 113, 4, 4, 4, 4, 4, 4, 107, 107, 4, 4, 4, 4, 4, 4,
107, 113, 4, 4, 4, 4, 4, 4, 127, 113, 4, 4, 4, 4, 4, 4,
127, 113, 5, 4, 4, 4, 4, 4, 127, 127, 4, 4, 4, 4, 4, 4,
127, 127, 4, 4, 4, 4, 4, 4, 117, 113, 4, 4, 4, 4, 4, 4,
4, 4, 4, 108, 108, 4, 108, 6, 4, 4, 4, 108, 108, 108, 108, 6,
4, 4, 4, 108, 108, 108, 108, 118, 4, 108, 108, 108, 108, 108, 108, 3,
4, 4, 108, 108, 108, 108, 108, 135, 4, 4, 108, 108, 108, 108, 3, 8,
4, 4, 108, 108, 108, 108, 3, 119, 4, 108, 108, 108, 108, 3, 135, 142,
6, 6, 100, 36, 82, 22, 87, 50, 118, 119, 120, 36, 21, 23, 25, 25,
118, 15, 45, 36, 20, 52, 24, 74, 119, 132, 35, 20, 10, 87, 26, 25,
8, 67, 10, 20, 36, 25, 26, 25, 8, 57, 10, 20, 21, 26, 26, 25,
119, 45, 10, 82, 20, 26, 24, 26, 8, 35, 82, 36, 23, 25, 25, 26,
25, 13, 110, 15, 54, 16, 16, 15, 25, 121, 122, 15, 18, 15, 15, 15,
26, 110, 111, 15, 16, 15, 54, 15, 26, 83, 83, 54, 80, 15, 18, 15,
26, 83, 69, 89, 15, 16, 15, 18, 26, 69, 69, 100, 15, 16, 15, 18,
24, 69, 28, 133, 54, 16, 15, 16, 98, 69, 34, 45, 54, 54, 16, 16,
16, 16, 16, 45, 22, 19, 56, 54, 16, 16, 16, 1, 22, 14, 16, 54,
16, 16, 56, 1, 20, 1, 56, 54, 16, 16, 16, 1, 20, 61, 100, 18,
16, 16, 56, 2, 82, 35, 67, 15, 16, 16, 56, 123, 82, 21, 17, 15,
16, 16, 56, 123, 36, 22, 1, 15, 15, 16, 56, 133, 35, 22, 35, 16,
16, 15, 15, 15, 15, 15, 15, 36, 16, 54, 15, 15, 15, 15, 16, 20,
16, 54, 15, 16, 15, 15, 56, 20, 16, 54, 15, 16, 15, 16, 100, 36,
18, 15, 16, 15, 15, 16, 2, 36, 15, 16, 16, 54, 16, 19, 35, 21,
15, 16, 16, 54, 16, 19, 35, 20, 15, 15, 16, 18, 15, 2, 94, 20,
21, 20, 65, 76, 25, 25, 24, 50, 21, 22, 21, 50, 25, 25, 24, 24,
21, 21, 21, 50, 25, 25, 25, 25, 21, 22, 23, 50, 25, 128, 25, 25,
21, 21, 52, 25, 24, 50, 25, 50, 21, 21, 87, 24, 25, 50, 50, 50,
21, 22, 59, 24, 25, 25, 24, 50, 21, 23, 46, 50, 50, 25, 50, 50,
24, 50, 59, 23, 19, 16, 16, 54, 25, 26, 59, 53, 123, 16, 15, 15,
25, 128, 46, 23, 9, 16, 15, 16, 98, 13, 12, 52, 1, 56, 15, 80,
44, 131, 76, 95, 45, 56, 15, 54, 44, 131, 50, 87, 35, 19, 16, 16,
44, 126, 24, 87, 35, 67, 16, 16, 13, 126, 49, 87, 36, 2, 16, 15,
35, 43, 30, 39, 31, 39, 84, 40, 35, 124, 28, 30, 39, 39, 84, 42,
35, 124, 30, 28, 39, 39, 84, 42, 35, 124, 28, 30, 39, 39, 84, 42,
17, 124, 39, 39, 39, 32, 84, 42, 17, 124, 39, 39, 39, 39, 84, 42,
123, 124, 32, 39, 32, 39, 84, 42, 14, 124, 39, 39, 39, 39, 84, 42,
42, 42, 114, 39, 115, 45, 15, 18, 42, 42, 40, 33, 30, 125, 16, 18,
42, 42, 40, 84, 39, 34, 19, 54, 96, 41, 42, 40, 33, 39, 35, 16,
42, 42, 42, 105, 33, 39, 125, 112, 42, 42, 138, 42, 109, 33, 139, 81,
42, 42, 138, 42, 109, 66, 39, 125, 42, 42, 40, 143, 40, 40, 33, 30,
16, 45, 16, 15, 67, 36, 22, 22, 64, 56, 17, 18, 100, 99, 65, 82,
63, 16, 35, 19, 56, 1, 65, 36, 54, 15, 1, 45, 54, 133, 21, 21,
16, 18, 14, 35, 15, 136, 20, 23, 8, 16, 56, 1, 19, 18, 21, 22,
18, 16, 16, 14, 17, 16, 21, 22, 2, 16, 18, 56, 36, 14, 45, 22,
22, 87, 34, 32, 39, 39, 39, 39, 21, 23, 69, 32, 32, 39, 32, 32,
21, 21, 43, 39, 39, 39, 129, 39, 20, 21, 83, 29, 32, 39, 39, 39,
21, 20, 48, 69, 39, 39, 39, 32, 21, 21, 37, 69, 39, 39, 39, 39,
21, 21, 73, 69, 39, 39, 32, 39, 22, 21, 92, 83, 39, 32, 39, 39,
33, 70, 42, 42, 42, 40, 42, 42, 33, 84, 42, 42, 42, 42, 96, 96,
32, 84, 42, 40, 42, 42, 42, 42, 32, 109, 42, 40, 42, 42, 42, 42,
32, 33, 42, 42, 42, 42, 42, 42, 129, 33, 42, 42, 42, 42, 42, 42,
32, 33, 42, 42, 42, 42, 42, 42, 32, 33, 42, 42, 42, 42, 42, 42,
42, 70, 39, 30, 31, 30, 69, 73, 42, 40, 114, 32, 39, 28, 39, 28,
42, 42, 130, 33, 32, 31, 28, 29, 42, 42, 96, 70, 29, 32, 31, 31,
42, 42, 42, 42, 32, 32, 29, 28, 42, 42, 96, 42, 84, 32, 39, 39,
42, 42, 96, 42, 70, 33, 39, 39, 42, 42, 42, 42, 96, 105, 32, 39,
72, 22, 1, 74, 73, 29, 34, 34, 49, 102, 65, 1, 76, 83, 34, 29,
92, 51, 22, 57, 72, 73, 43, 34, 47, 48, 44, 21, 57, 87, 73, 28,
31, 47, 37, 22, 35, 45, 74, 69, 31, 31, 31, 44, 11, 56, 136, 37,
31, 31, 28, 37, 50, 57, 56, 71, 30, 31, 31, 31, 69, 11, 57, 56,
38, 69, 73, 74, 25, 87, 65, 21, 29, 29, 28, 73, 13, 25, 76, 21,
29, 29, 31, 83, 73, 25, 26, 52, 28, 34, 34, 47, 34, 73, 13, 26,
28, 29, 29, 29, 34, 48, 60, 12, 69, 29, 34, 38, 29, 47, 69, 140,
48, 29, 29, 28, 34, 28, 31, 141, 52, 34, 28, 34, 34, 34, 34, 34,
22, 22, 21, 21, 21, 23, 21, 19, 21, 22, 22, 22, 22, 23, 52, 36,
21, 22, 22, 21, 22, 65, 65, 102, 87, 21, 22, 22, 22, 22, 22, 52,
12, 21, 22, 21, 65, 75, 22, 22, 13, 59, 23, 23, 21, 22, 22, 21,
140, 26, 59, 21, 22, 22, 22, 21, 69, 134, 74, 87, 23, 22, 22, 22,
54, 16, 18, 67, 35, 21, 22, 22, 1, 15, 64, 16, 123, 22, 36, 22,
36, 16, 15, 16, 19, 22, 21, 22, 23, 94, 67, 16, 16, 35, 23, 22,
87, 35, 35, 54, 15, 45, 72, 22, 23, 52, 36, 2, 16, 19, 35, 22,
21, 87, 102, 35, 19, 19, 1, 22, 21, 22, 46, 36, 36, 63, 56, 22,
21, 36, 22, 23, 50, 50, 12, 116, 22, 22, 21, 102, 46, 25, 25, 126,
22, 23, 21, 22, 87, 25, 50, 131, 22, 65, 21, 21, 23, 12, 74, 116,
22, 21, 22, 22, 22, 50, 24, 13, 21, 21, 22, 22, 36, 128, 25, 13,
21, 21, 22, 22, 21, 74, 25, 98, 21, 21, 22, 21, 21, 87, 24, 26,
17, 54, 16, 15, 15, 15, 15, 15, 46, 54, 15, 15, 15, 15, 15, 15,
13, 86, 15, 15, 15, 15, 15, 15, 134, 16, 18, 15, 15, 15, 15, 15,
137, 56, 54, 16, 54, 16, 15, 16, 137, 57, 18, 16, 16, 16, 16, 16,
126, 45, 16, 16, 16, 15, 16, 15, 134, 52, 67, 15, 15, 15, 15, 15,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17,
1, 1, 1, 1, 1, 1, 17, 2, 1, 1, 1, 1, 1, 1, 2, 123,
1, 1, 45, 1, 1, 17, 123, 14, 1, 1, 1, 1, 1, 123, 19, 56,
1, 1, 1, 1, 2, 19, 19, 56, 1, 1, 1, 9, 123, 19, 56, 16,
1, 123, 123, 56, 16, 15, 8, 8, 2, 123, 19, 16, 15, 8, 119, 58,
133, 19, 56, 15, 8, 119, 118, 7, 19, 56, 18, 8, 8, 135, 118, 78,
56, 16, 15, 119, 119, 78, 7, 58, 16, 62, 8, 58, 7, 7, 58, 119,
15, 15, 8, 58, 78, 78, 119, 8, 8, 8, 58, 7, 7, 58, 119, 8,
119, 15, 15, 56, 123, 14, 17, 1, 58, 8, 15, 56, 123, 14, 17, 1,
58, 8, 54, 56, 14, 14, 17, 1, 119, 15, 54, 56, 123, 14, 1, 1,
135, 15, 18, 56, 123, 2, 1, 1, 8, 16, 56, 19, 2, 17, 1, 1,
8, 56, 19, 19, 2, 1, 1, 1, 15, 56, 19, 123, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17,
1, 1, 1, 1, 1, 17, 17, 17, 1, 1, 1, 1, 1, 17, 17, 17,
1, 1, 1, 1, 17, 17, 17, 123, 1, 1, 1, 17, 17, 17, 156, 17,
1, 1, 1, 9, 9, 9, 9, 9, 1, 1, 1, 1, 9, 9, 9, 9,
1, 17, 9, 9, 9, 9, 9, 9, 17, 17, 17, 123, 9, 9, 9, 9,
17, 123, 123, 123, 9, 9, 9, 9, 123, 123, 123, 156, 123, 123, 9, 9,
17, 156, 156, 123, 123, 123, 9, 9, 156, 156, 156, 156, 156, 123, 9, 9,
9, 9, 9, 9, 112, 113, 4, 4, 9, 9, 9, 112, 86, 5, 4, 4,
9, 9, 9, 112, 86, 4, 4, 4, 9, 9, 9, 9, 89, 4, 4, 4,
9, 9, 9, 112, 89, 4, 4, 4, 9, 9, 9, 9, 56, 4, 4, 4,
9, 9, 9, 112, 80, 4, 4, 4, 9, 9, 9, 9, 100, 5, 4, 4,
4, 4, 4, 4, 4, 4, 4, 113, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 58,
4, 4, 4, 4, 4, 4, 4, 91, 4, 4, 4, 4, 4, 4, 4, 86,
4, 4, 4, 4, 4, 4, 4, 54, 4, 4, 4, 4, 4, 4, 4, 56,
127, 113, 4, 4, 4, 4, 4, 4, 147, 107, 4, 4, 4, 4, 4, 4,
147, 5, 4, 4, 4, 4, 4, 4, 152, 4, 4, 4, 4, 4, 5, 107,
67, 4, 4, 4, 4, 4, 5, 107, 112, 4, 4, 4, 4, 5, 5, 107,
112, 4, 4, 4, 4, 5, 5, 107, 67, 4, 4, 4, 4, 4, 5, 107,
4, 108, 108, 108, 3, 3, 8, 90, 4, 108, 108, 3, 77, 77, 8, 86,
5, 108, 77, 77, 77, 8, 8, 135, 107, 107, 106, 106, 135, 8, 8, 8,
107, 3, 106, 135, 135, 8, 86, 8, 107, 106, 106, 135, 119, 8, 8, 80,
107, 106, 135, 135, 119, 8, 86, 16, 78, 135, 135, 91, 119, 142, 8, 56,
8, 10, 82, 36, 23, 25, 50, 25, 15, 10, 36, 21, 87, 12, 26, 25,
16, 10, 36, 20, 59, 24, 50, 25, 100, 10, 82, 102, 50, 50, 50, 25,
133, 94, 36, 23, 50, 50, 50, 74, 2, 10, 20, 59, 50, 24, 26, 98,
17, 10, 94, 76, 50, 12, 26, 13, 35, 36, 20, 74, 50, 50, 50, 13,
13, 38, 28, 144, 54, 54, 64, 16, 13, 38, 47, 95, 18, 15, 64, 16,
13, 38, 47, 95, 56, 15, 16, 15, 134, 34, 28, 93, 123, 80, 18, 15,
140, 38, 34, 43, 45, 16, 18, 15, 126, 34, 28, 43, 81, 86, 54, 15,
126, 29, 34, 43, 27, 15, 15, 15, 121, 47, 28, 69, 93, 54, 80, 16,
15, 16, 56, 19, 35, 82, 36, 16, 18, 16, 16, 19, 35, 22, 20, 56,
18, 16, 56, 56, 35, 22, 20, 56, 18, 16, 16, 56, 1, 22, 22, 67,
18, 16, 16, 56, 1, 22, 22, 123, 18, 18, 56, 16, 9, 23, 22, 45,
18, 18, 16, 16, 2, 23, 21, 35, 16, 15, 56, 56, 100, 23, 22, 21,
15, 16, 15, 18, 15, 1, 10, 20, 15, 18, 15, 15, 15, 35, 36, 21,
15, 18, 16, 15, 15, 35, 36, 21, 18, 18, 16, 15, 18, 21, 36, 22,
18, 16, 16, 54, 56, 20, 36, 22, 16, 16, 54, 54, 19, 21, 21, 21,
19, 54, 54, 15, 123, 20, 21, 21, 123, 15, 16, 16, 1, 21, 21, 20,
21, 23, 46, 50, 50, 25, 50, 50, 23, 52, 12, 50, 50, 25, 25, 26,
23, 87, 25, 50, 50, 25, 24, 50, 20, 87, 25, 25, 50, 24, 50, 25,
20, 87, 25, 25, 50, 24, 50, 25, 23, 87, 25, 50, 50, 50, 50, 25,
23, 59, 25, 24, 50, 50, 50, 25, 21, 76, 50, 24, 25, 74, 25, 26,
13, 131, 49, 46, 36, 45, 15, 15, 134, 111, 44, 59, 94, 35, 15, 54,
134, 83, 13, 59, 20, 35, 15, 15, 134, 69, 13, 50, 21, 36, 54, 16,
134, 34, 13, 49, 21, 36, 18, 80, 110, 29, 73, 49, 21, 36, 56, 15,
122, 29, 73, 98, 20, 36, 56, 15, 83, 39, 48, 13, 65, 36, 67, 15,
123, 27, 39, 39, 39, 32, 84, 42, 14, 27, 39, 32, 39, 39, 70, 42,
14, 27, 39, 39, 39, 39, 40, 42, 14, 27, 32, 39, 32, 39, 40, 42,
123, 27, 39, 39, 39, 39, 40, 42, 14, 27, 39, 39, 145, 32, 40, 42,
2, 27, 145, 32, 39, 39, 40, 42, 2, 95, 39, 39, 145, 145, 40, 42,
41, 42, 40, 41, 40, 105, 33, 39, 41, 42, 41, 42, 42, 42, 84, 33,
41, 42, 41, 42, 42, 40, 84, 33, 42, 42, 42, 42, 42, 40, 40, 109,
42, 42, 42, 42, 42, 40, 40, 109, 41, 42, 41, 42, 42, 40, 40, 105,
41, 42, 41, 42, 41, 40, 40, 40, 42, 42, 42, 42, 42, 42, 42, 42,
61, 56, 18, 16, 36, 45, 17, 22, 27, 45, 18, 64, 1, 82, 123, 21,
115, 61, 16, 15, 67, 36, 123, 35, 39, 125, 56, 63, 132, 2, 1, 45,
33, 139, 14, 18, 64, 19, 35, 45, 33, 39, 72, 19, 16, 16, 36, 36,
33, 145, 79, 2, 16, 15, 36, 36, 84, 33, 115, 79, 16, 15, 2, 36,
22, 21, 101, 48, 145, 39, 39, 39, 21, 22, 52, 111, 33, 39, 32, 145,
36, 22, 95, 73, 39, 39, 39, 39, 22, 21, 11, 73, 39, 32, 32, 39,
22, 21, 23, 73, 30, 39, 39, 32, 22, 36, 11, 13, 30, 33, 39, 39,
22, 22, 102, 49, 29, 33, 32, 39, 21, 65, 21, 87, 69, 39, 39, 32,
129, 33, 42, 42, 42, 42, 42, 42, 39, 33, 40, 42, 40, 42, 42, 42,
39, 33, 40, 42, 40, 42, 42, 42, 32, 32, 40, 42, 42, 42, 42, 42,
39, 32, 40, 42, 42, 42, 42, 42, 39, 32, 70, 42, 42, 42, 42, 42,
39, 39, 70, 42, 42, 42, 42, 42, 39, 39, 70, 42, 40, 42, 42, 42,
42, 42, 42, 42, 96, 40, 33, 32, 42, 42, 42, 42, 96, 42, 70, 148,
42, 42, 42, 42, 96, 42, 66, 148, 42, 42, 42, 42, 42, 42, 42, 66,
42, 42, 42, 42, 96, 96, 96, 130, 42, 42, 42, 42, 42, 42, 96, 130,
42, 42, 42, 42, 42, 42, 96, 158, 42, 42, 66, 42, 130, 130, 42, 42,
31, 30, 28, 30, 30, 50, 94, 54, 39, 39, 39, 28, 31, 69, 92, 100,
39, 32, 39, 30, 28, 31, 48, 99, 32, 30, 39, 30, 30, 31, 47, 73,
148, 129, 32, 30, 30, 31, 31, 111, 70, 114, 32, 30, 30, 31, 30, 28,
130, 114, 129, 30, 30, 39, 31, 29, 66, 66, 148, 32, 29, 69, 83, 149,
35, 69, 28, 34, 29, 28, 29, 34, 80, 73, 34, 28, 34, 34, 28, 38,
56, 92, 43, 29, 38, 28, 34, 28, 21, 95, 121, 31, 34, 29, 29, 34,
71, 120, 153, 29, 31, 34, 69, 149, 83, 157, 46, 146, 141, 149, 83, 69,
69, 131, 140, 150, 149, 28, 29, 28, 69, 48, 101, 73, 154, 29, 29, 34,
34, 146, 134, 12, 87, 21, 22, 22, 34, 69, 149, 13, 25, 23, 82, 22,
29, 28, 38, 134, 98, 24, 87, 98, 34, 69, 83, 141, 137, 137, 137, 60,
149, 141, 141, 83, 149, 154, 44, 52, 69, 29, 29, 34, 38, 149, 126, 26,
29, 29, 34, 29, 28, 69, 141, 98, 28, 34, 34, 34, 34, 34, 69, 154,
22, 36, 52, 102, 82, 14, 16, 20, 65, 22, 22, 13, 73, 51, 87, 131,
44, 13, 60, 150, 151, 126, 134, 60, 44, 52, 23, 21, 52, 87, 82, 57,
22, 65, 21, 22, 22, 74, 23, 35, 59, 22, 21, 21, 20, 87, 128, 21,
51, 22, 65, 21, 20, 11, 25, 52, 116, 12, 52, 65, 23, 72, 52, 128,
22, 21, 21, 21, 21, 52, 24, 26, 137, 101, 51, 55, 11, 11, 46, 25,
126, 13, 13, 101, 59, 22, 87, 50, 1, 82, 36, 21, 22, 21, 23, 50,
9, 102, 22, 21, 21, 20, 21, 128, 36, 21, 21, 22, 22, 22, 21, 50,
36, 21, 20, 21, 21, 22, 21, 74, 87, 21, 82, 21, 65, 22, 20, 59,
73, 46, 57, 16, 18, 16, 16, 16, 128, 134, 99, 15, 15, 16, 15, 15,
26, 126, 36, 15, 15, 15, 15, 16, 24, 126, 71, 18, 15, 15, 15, 15,
74, 134, 155, 56, 16, 15, 15, 16, 26, 116, 121, 56, 80, 15, 15, 15,
128, 116, 159, 19, 80, 15, 54, 15, 128, 98, 126, 1, 16, 16, 15, 54,
15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 54, 16, 16, 15, 15, 15,
15, 16, 15, 16, 16, 15, 15, 15, 15, 16, 16, 15, 15, 15, 15, 15,
15, 16, 16, 15, 15, 15, 15, 15, 15, 16, 16, 15, 15, 15, 15, 15,
15, 16, 16, 15, 15, 15, 15, 15, 15, 16, 16, 54, 16, 16, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 15, 15,
15, 15, 15, 15, 15, 15, 16, 16, 15, 15, 15, 15, 15, 15, 16, 16,
15, 15, 15, 16, 16, 16, 15, 15, 15, 15, 15, 16, 16, 16, 15, 15,
15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17,
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 14,
1, 1, 1, 1, 1, 17, 14, 19, 1, 1, 1, 1, 17, 17, 123, 19,
1, 1, 2, 14, 19, 56, 15, 15, 1, 1, 123, 19, 19, 18, 54, 8,
17, 14, 19, 19, 56, 15, 8, 119, 14, 123, 19, 16, 18, 8, 119, 58,
14, 19, 56, 16, 86, 119, 58, 7, 19, 19, 16, 62, 8, 78, 7, 118,
56, 63, 15, 8, 135, 7, 118, 78, 56, 15, 8, 119, 58, 4, 78, 78,
119, 58, 7, 118, 7, 58, 8, 15, 58, 58, 7, 118, 58, 119, 15, 16,
5, 7, 118, 58, 119, 8, 18, 56, 78, 7, 7, 119, 8, 15, 56, 19,
78, 118, 7, 8, 15, 15, 19, 19, 118, 58, 78, 8, 54, 16, 19, 67,
58, 58, 8, 54, 16, 56, 123, 2, 78, 119, 8, 18, 56, 19, 14, 17,
56, 19, 123, 2, 1, 1, 1, 1, 56, 123, 14, 17, 1, 1, 1, 1,
19, 123, 2, 1, 1, 1, 1, 1, 133, 17, 1, 1, 1, 1, 1, 17,
14, 1, 1, 1, 1, 1, 1, 17, 14, 1, 1, 1, 1, 1, 1, 2,
1, 1, 1, 1, 1, 1, 17, 2, 1, 1, 1, 1, 1, 1, 2, 103,
1, 17, 17, 17, 17, 14, 136, 136, 17, 17, 17, 14, 136, 136, 136, 136,
17, 2, 14, 14, 136, 136, 164, 164, 2, 14, 133, 136, 100, 132, 132, 164,
14, 133, 133, 100, 132, 64, 63, 164, 14, 133, 100, 132, 64, 64, 15, 64,
133, 133, 100, 64, 80, 142, 142, 15, 133, 100, 132, 80, 172, 142, 142, 15,
156, 156, 156, 156, 123, 123, 9, 9, 162, 156, 156, 156, 156, 123, 9, 9,
162, 156, 156, 156, 156, 123, 9, 9, 164, 162, 156, 156, 123, 123, 9, 9,
164, 162, 156, 156, 123, 123, 9, 9, 164, 162, 156, 156, 123, 123, 9, 9,
164, 162, 156, 156, 156, 123, 9, 9, 63, 162, 156, 156, 123, 9, 9, 9,
9, 9, 9, 99, 117, 5, 4, 4, 9, 9, 9, 56, 4, 4, 4, 4,
9, 9, 9, 112, 113, 4, 4, 4, 9, 9, 9, 67, 4, 4, 4, 4,
9, 9, 168, 67, 5, 4, 4, 4, 9, 9, 9, 100, 4, 4, 4, 4,
9, 9, 9, 89, 4, 4, 4, 4, 9, 9, 9, 86, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 89, 4, 4, 4, 4, 4, 4, 4, 19,
4, 4, 4, 4, 4, 4, 4, 89, 4, 4, 4, 4, 4, 4, 4, 89,
4, 4, 4, 4, 4, 4, 4, 56, 4, 4, 4, 4, 4, 4, 5, 100,
4, 4, 4, 4, 4, 4, 113, 152, 4, 4, 4, 4, 4, 4, 127, 67,
123, 4, 4, 4, 4, 4, 5, 107, 67, 4, 4, 4, 4, 4, 5, 58,
67, 5, 4, 4, 4, 4, 5, 78, 67, 107, 4, 4, 4, 4, 107, 78,
152, 107, 4, 4, 4, 4, 7, 78, 112, 5, 4, 4, 4, 4, 58, 78,
112, 127, 4, 4, 4, 4, 5, 78, 112, 113, 4, 4, 4, 5, 7, 78,
78, 135, 135, 119, 119, 8, 8, 19, 78, 135, 135, 8, 135, 8, 86, 57,
78, 135, 135, 135, 142, 8, 8, 67, 78, 135, 119, 8, 90, 142, 8, 2,
135, 135, 135, 135, 142, 8, 62, 57, 78, 135, 119, 8, 8, 8, 16, 35,
135, 135, 90, 90, 8, 135, 56, 36, 135, 119, 135, 173, 86, 8, 19, 10,
99, 82, 82, 50, 26, 24, 50, 13, 10, 82, 36, 50, 25, 24, 26, 116,
36, 82, 22, 12, 128, 25, 25, 13, 82, 82, 23, 50, 25, 24, 25, 49,
82, 36, 23, 25, 128, 25, 25, 49, 20, 20, 87, 24, 25, 24, 25, 49,
20, 36, 87, 128, 25, 50, 25, 13, 20, 20, 59, 128, 25, 24, 25, 13,
141, 28, 34, 28, 27, 54, 80, 16, 149, 34, 38, 47, 124, 56, 62, 16,
149, 28, 28, 34, 69, 45, 15, 15, 122, 34, 34, 28, 69, 72, 18, 15,
149, 28, 38, 34, 28, 95, 56, 15, 111, 34, 28, 34, 28, 27, 19, 86,
83, 38, 28, 38, 34, 124, 67, 15, 83, 34, 34, 34, 28, 124, 9, 8,
16, 16, 56, 16, 100, 22, 22, 22, 16, 15, 16, 16, 56, 22, 22, 23,
15, 15, 16, 56, 56, 35, 22, 22, 18, 16, 63, 16, 56, 45, 22, 23,
15, 16, 16, 16, 56, 1, 22, 21, 16, 15, 16, 63, 16, 1, 22, 22,
18, 15, 16, 16, 56, 1, 22, 22, 15, 15, 16, 16, 16, 123, 22, 22,
1, 15, 16, 19, 35, 21, 21, 20, 35, 54, 54, 14, 36, 21, 22, 21,
21, 56, 86, 19, 36, 22, 22, 21, 20, 67, 54, 100, 36, 21, 22, 21,
22, 17, 86, 14, 82, 22, 22, 21, 22, 1, 16, 1, 22, 22, 21, 21,
22, 35, 19, 35, 22, 21, 22, 22, 22, 36, 67, 35, 22, 21, 22, 21,
21, 12, 50, 24, 25, 74, 25, 128, 21, 50, 26, 24, 25, 74, 25, 49,
21, 46, 26, 24, 24, 50, 25, 13, 23, 76, 26, 24, 50, 128, 24, 13,
23, 12, 128, 24, 25, 25, 26, 60, 23, 25, 24, 50, 50, 24, 26, 155,
23, 50, 24, 24, 50, 25, 24, 110, 52, 50, 25, 24, 50, 26, 49, 111,
83, 32, 43, 13, 65, 36, 123, 16, 69, 39, 34, 13, 95, 20, 123, 16,
83, 145, 29, 44, 52, 20, 1, 15, 69, 145, 29, 73, 52, 36, 120, 18,
69, 33, 30, 73, 46, 72, 35, 54, 38, 33, 39, 48, 59, 36, 35, 16,
31, 145, 39, 37, 46, 36, 35, 54, 39, 145, 39, 43, 12, 21, 45, 16,
160, 95, 39, 39, 145, 145, 40, 42, 67, 95, 39, 32, 145, 145, 40, 42,
19, 27, 28, 145, 32, 145, 84, 42, 67, 27, 30, 145, 39, 33, 84, 165,
67, 93, 29, 145, 39, 145, 109, 42, 123, 68, 28, 145, 39, 39, 66, 41,
170, 68, 28, 145, 145, 145, 84, 165, 19, 68, 31, 145, 39, 33, 109, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 40,
42, 42, 42, 42, 42, 40, 40, 40, 40, 41, 96, 138, 42, 41, 42, 105,
41, 42, 42, 42, 96, 42, 40, 42, 96, 40, 165, 42, 42, 40, 96, 42,
42, 42, 42, 165, 42, 42, 40, 42, 165, 105, 42, 42, 42, 42, 42, 96,
70, 114, 30, 27, 18, 16, 19, 35, 105, 163, 33, 30, 9, 18, 16, 14,
40, 85, 33, 139, 72, 56, 15, 14, 40, 70, 33, 39, 27, 1, 86, 19,
40, 40, 33, 33, 34, 65, 56, 16, 40, 96, 84, 33, 30, 93, 67, 86,
40, 40, 40, 33, 145, 43, 72, 86, 40, 105, 40, 148, 33, 34, 93, 16,
21, 21, 21, 11, 69, 39, 39, 39, 20, 20, 21, 102, 111, 34, 32, 39,
20, 22, 21, 11, 73, 34, 33, 39, 36, 22, 21, 22, 92, 69, 145, 32,
35, 22, 21, 22, 92, 69, 145, 39, 123, 22, 21, 82, 74, 43, 39, 39,
100, 36, 23, 21, 87, 48, 39, 39, 16, 35, 22, 21, 11, 37, 28, 32,
39, 32, 70, 42, 40, 42, 42, 42, 32, 32, 70, 42, 40, 42, 42, 42,
39, 39, 84, 42, 40, 40, 42, 42, 39, 39, 114, 130, 42, 105, 42, 105,
39, 32, 109, 42, 40, 42, 130, 42, 39, 39, 33, 40, 40, 130, 40, 130,
32, 39, 109, 70, 40, 130, 42, 42, 39, 39, 33, 42, 42, 96, 171, 69,
42, 42, 42, 42, 130, 96, 66, 66, 42, 42, 96, 130, 42, 96, 42, 130,
42, 42, 130, 96, 96, 143, 130, 34, 130, 40, 42, 42, 143, 139, 83, 141,
40, 42, 143, 66, 69, 83, 83, 139, 143, 130, 34, 83, 149, 139, 97, 97,
129, 83, 83, 69, 130, 97, 42, 130, 83, 69, 166, 97, 42, 70, 130, 66,
42, 130, 66, 34, 83, 149, 83, 29, 69, 83, 149, 69, 34, 30, 129, 30,
83, 83, 83, 34, 129, 32, 30, 30, 69, 166, 167, 66, 32, 30, 30, 31,
143, 169, 130, 66, 32, 30, 31, 30, 130, 96, 96, 96, 148, 129, 30, 30,
66, 130, 130, 96, 171, 32, 30, 129, 130, 166, 166, 130, 66, 148, 129, 30,
30, 69, 37, 52, 150, 29, 29, 34, 29, 29, 38, 53, 87, 83, 29, 34,
30, 28, 69, 68, 71, 149, 29, 28, 30, 30, 28, 48, 46, 141, 69, 34,
30, 129, 32, 38, 68, 73, 83, 29, 30, 29, 30, 30, 69, 92, 122, 69,
30, 30, 29, 30, 34, 43, 126, 69, 30, 30, 30, 139, 30, 34, 121, 83,
28, 34, 28, 34, 115, 34, 29, 161, 34, 34, 34, 34, 34, 34, 34, 34,
34, 34, 34, 34, 34, 34, 34, 28, 29, 34, 34, 34, 34, 34, 34, 34,
29, 34, 34, 34, 34, 34, 34, 34, 29, 34, 34, 34, 34, 34, 34, 34,
34, 29, 34, 34, 34, 34, 34, 34, 29, 34, 34, 34, 34, 34, 34, 34,
126, 25, 59, 72, 23, 21, 65, 50, 69, 134, 98, 52, 65, 22, 20, 52,
69, 121, 13, 87, 21, 21, 21, 23, 34, 83, 131, 98, 52, 21, 22, 22,
34, 34, 83, 116, 76, 23, 21, 21, 34, 34, 69, 149, 13, 52, 21, 22,
34, 34, 34, 69, 121, 46, 36, 21, 115, 34, 34, 34, 83, 110, 52, 36,
50, 21, 36, 21, 22, 22, 21, 87, 25, 87, 21, 22, 22, 21, 22, 102,
25, 12, 21, 36, 22, 21, 22, 22, 87, 128, 87, 21, 22, 22, 21, 21,
23, 12, 128, 23, 21, 21, 22, 21, 22, 87, 128, 76, 21, 75, 22, 21,
22, 23, 12, 128, 87, 36, 22, 65, 21, 22, 87, 128, 24, 23, 21, 65,
24, 49, 126, 36, 18, 16, 16, 16, 12, 50, 73, 76, 56, 15, 18, 15,
12, 128, 116, 73, 16, 15, 15, 16, 46, 26, 13, 60, 67, 54, 18, 15,
87, 26, 98, 126, 61, 86, 15, 16, 52, 24, 49, 126, 95, 86, 15, 18,
11, 25, 128, 126, 68, 18, 54, 15, 53, 76, 26, 140, 60, 16, 54, 16,
15, 16, 16, 15, 16, 16, 15, 15, 15, 18, 16, 18, 15, 15, 16, 16,
15, 15, 56, 16, 15, 15, 15, 15, 15, 18, 56, 63, 54, 16, 18, 15,
15, 16, 56, 16, 16, 15, 15, 16, 15, 54, 56, 56, 15, 18, 15, 18,
16, 15, 56, 56, 16, 15, 16, 15, 15, 15, 16, 19, 54, 15, 18, 15,
16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 16, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 18, 16, 18, 15, 18, 16, 18, 16,
15, 15, 15, 16, 15, 15, 15, 15, 15, 18, 15, 18, 15, 18, 15, 18,
16, 15, 16, 15, 16, 15, 16, 15, 18, 15, 18, 15, 18, 15, 18, 15,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17,
1, 1, 1, 1, 2, 123, 19, 56, 1, 1, 1, 1, 14, 19, 19, 54,
1, 1, 1, 2, 67, 19, 56, 62, 1, 1, 2, 14, 19, 56, 18, 8,
1, 2, 14, 19, 56, 16, 8, 119, 1, 14, 123, 19, 16, 54, 8, 91,
1, 123, 19, 56, 54, 54, 8, 7, 123, 19, 56, 16, 8, 8, 58, 4,
16, 15, 119, 58, 7, 118, 118, 7, 8, 8, 5, 5, 7, 118, 7, 58,
8, 119, 4, 7, 118, 118, 7, 58, 8, 58, 4, 118, 118, 7, 58, 91,
58, 4, 78, 119, 118, 58, 119, 8, 5, 4, 78, 118, 7, 119, 8, 8,
4, 5, 118, 118, 58, 8, 8, 54, 4, 118, 118, 78, 91, 15, 54, 56,
119, 8, 8, 56, 19, 19, 2, 1, 8, 15, 15, 19, 67, 14, 1, 1,
8, 15, 16, 19, 123, 2, 1, 1, 54, 16, 56, 67, 123, 2, 1, 1,
16, 56, 19, 123, 17, 1, 1, 1, 56, 100, 100, 17, 1, 1, 1, 1,
56, 136, 14, 17, 1, 1, 1, 1, 19, 123, 1, 1, 1, 1, 9, 9,
1, 1, 1, 45, 1, 1, 2, 103, 1, 1, 45, 1, 1, 57, 103, 133,
1, 1, 1, 57, 57, 57, 103, 133, 1, 1, 1, 9, 57, 112, 112, 152,
1, 1, 9, 57, 112, 112, 103, 152, 9, 9, 9, 112, 112, 112, 152, 152,
9, 9, 9, 112, 112, 112, 152, 152, 9, 9, 112, 112, 112, 112, 152, 152,
133, 100, 147, 172, 172, 90, 142, 15, 100, 147, 175, 172, 172, 142, 142, 15,
133, 147, 147, 172, 172, 90, 142, 64, 147, 147, 147, 172, 172, 62, 62, 63,
100, 147, 147, 172, 172, 142, 64, 64, 147, 147, 147, 172, 172, 172, 15, 63,
147, 147, 147, 172, 172, 62, 64, 63, 152, 147, 147, 172, 172, 62, 64, 64,
164, 162, 156, 123, 123, 123, 9, 9, 63, 19, 156, 156, 123, 123, 9, 9,
164, 156, 156, 156, 123, 123, 9, 9, 164, 162, 156, 156, 123, 123, 9, 9,
164, 162, 156, 156, 123, 123, 9, 9, 164, 162, 156, 156, 156, 123, 9, 9,
164, 162, 156, 156, 123, 123, 123, 9, 164, 162, 156, 156, 156, 156, 123, 112,
9, 9, 9, 86, 4, 4, 4, 4, 9, 9, 9, 113, 4, 4, 4, 4,
9, 9, 112, 5, 4, 4, 4, 4, 9, 9, 112, 5, 4, 4, 4, 4,
9, 9, 112, 5, 4, 4, 4, 4, 9, 112, 152, 4, 4, 4, 4, 4,
112, 112, 152, 5, 4, 4, 4, 4, 67, 152, 147, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 117, 112, 4, 4, 4, 4, 4, 4, 89, 112,
4, 4, 4, 4, 4, 4, 152, 99, 4, 4, 4, 4, 4, 5, 67, 99,
4, 4, 4, 4, 4, 113, 112, 99, 4, 4, 4, 4, 4, 127, 9, 36,
4, 4, 4, 4, 4, 89, 36, 99, 4, 4, 4, 4, 4, 56, 35, 36,
112, 127, 4, 4, 4, 5, 78, 78, 112, 117, 4, 4, 4, 107, 78, 78,
99, 89, 4, 5, 4, 6, 78, 135, 112, 89, 4, 5, 4, 58, 78, 135,
99, 19, 5, 5, 58, 78, 78, 135, 168, 100, 5, 5, 135, 78, 135, 119,
10, 133, 5, 107, 135, 135, 135, 173, 10, 103, 78, 78, 78, 135, 135, 135,
135, 135, 8, 90, 8, 142, 14, 82, 135, 135, 135, 142, 8, 8, 1, 157,
135, 135, 135, 8, 142, 62, 35, 82, 135, 173, 8, 135, 142, 16, 10, 20,
135, 135, 119, 90, 8, 19, 82, 20, 90, 119, 8, 90, 8, 133, 82, 20,
8, 135, 119, 90, 8, 2, 82, 21, 90, 135, 135, 142, 86, 45, 82, 20,
21, 22, 76, 26, 50, 24, 25, 73, 20, 23, 74, 24, 50, 50, 26, 155,
21, 23, 128, 26, 24, 24, 26, 60, 36, 52, 24, 25, 50, 25, 26, 134,
36, 87, 24, 128, 50, 24, 26, 131, 36, 59, 128, 50, 25, 25, 26, 110,
20, 76, 128, 50, 25, 24, 128, 122, 21, 12, 128, 24, 24, 25, 49, 122,
83, 34, 28, 28, 38, 69, 45, 15, 83, 47, 34, 28, 34, 69, 61, 16,
69, 28, 38, 34, 28, 28, 81, 56, 69, 38, 34, 28, 38, 34, 27, 67,
69, 34, 28, 34, 34, 28, 124, 14, 69, 38, 28, 28, 38, 34, 34, 14,
69, 47, 34, 28, 34, 28, 34, 45, 38, 38, 34, 38, 28, 34, 29, 81,
18, 16, 16, 63, 56, 67, 21, 22, 15, 16, 15, 16, 16, 19, 36, 23,
15, 16, 15, 56, 16, 19, 35, 22, 16, 16, 15, 16, 16, 56, 35, 22,
86, 16, 15, 16, 56, 16, 1, 22, 54, 15, 16, 16, 56, 56, 17, 22,
18, 15, 16, 16, 63, 16, 123, 20, 56, 15, 16, 16, 16, 16, 67, 21,
22, 21, 1, 36, 22, 21, 22, 21, 75, 22, 35, 21, 21, 22, 22, 21,
75, 21, 36, 21, 22, 22, 22, 20, 22, 22, 21, 21, 22, 21, 22, 21,
21, 21, 22, 22, 22, 22, 22, 21, 22, 22, 22, 21, 22, 22, 22, 21,
21, 21, 20, 22, 21, 22, 22, 21, 22, 21, 22, 22, 22, 22, 21, 21,
52, 24, 25, 24, 50, 26, 13, 83, 52, 50, 128, 24, 50, 25, 13, 83,
52, 24, 25, 24, 25, 12, 13, 69, 52, 24, 50, 24, 12, 12, 13, 69,
52, 24, 25, 12, 12, 25, 155, 176, 52, 12, 74, 24, 12, 25, 60, 34,
52, 12, 50, 12, 76, 74, 131, 28, 52, 50, 74, 101, 76, 12, 141, 28,
39, 39, 39, 43, 71, 21, 72, 63, 39, 39, 33, 38, 92, 21, 1, 16,
33, 39, 145, 29, 92, 23, 45, 63, 145, 39, 145, 31, 92, 87, 45, 63,
33, 39, 145, 32, 37, 59, 72, 63, 145, 39, 145, 39, 177, 46, 45, 19,
145, 39, 145, 145, 37, 68, 45, 63, 33, 39, 39, 145, 48, 46, 10, 19,
67, 68, 29, 145, 39, 145, 84, 41, 136, 68, 28, 145, 39, 145, 105, 42,
123, 68, 28, 145, 39, 33, 70, 96, 14, 68, 31, 145, 39, 39, 40, 42,
123, 68, 31, 145, 39, 33, 40, 96, 14, 92, 28, 145, 145, 145, 40, 42,
17, 92, 31, 145, 39, 33, 40, 96, 123, 68, 30, 145, 39, 33, 40, 165,
105, 42, 42, 165, 42, 42, 40, 96, 41, 42, 165, 42, 42, 42, 42, 96,
42, 40, 42, 96, 41, 42, 40, 42, 41, 42, 41, 42, 96, 42, 42, 42,
42, 105, 42, 96, 41, 42, 42, 42, 41, 42, 41, 42, 42, 42, 42, 42,
42, 40, 96, 40, 165, 42, 40, 42, 41, 96, 42, 42, 42, 42, 41, 42,
40, 40, 42, 84, 33, 29, 93, 123, 105, 40, 40, 105, 84, 145, 69, 72,
40, 105, 40, 40, 109, 33, 30, 93, 40, 42, 105, 40, 70, 33, 145, 115,
42, 96, 40, 42, 40, 114, 145, 30, 105, 42, 40, 105, 40, 84, 33, 39,
42, 42, 42, 40, 42, 84, 33, 145, 40, 105, 42, 40, 105, 178, 114, 33,
86, 2, 22, 21, 102, 68, 34, 145, 89, 19, 36, 22, 82, 68, 69, 32,
19, 18, 35, 22, 21, 101, 83, 39, 45, 54, 14, 22, 36, 46, 111, 31,
65, 16, 100, 82, 21, 59, 122, 83, 27, 1, 15, 1, 82, 92, 154, 83,
34, 93, 18, 45, 44, 116, 154, 69, 30, 111, 68, 73, 44, 52, 60, 176,
39, 39, 148, 97, 66, 34, 83, 83, 39, 145, 114, 139, 69, 83, 139, 130,
33, 34, 69, 69, 34, 148, 97, 42, 69, 83, 69, 148, 169, 42, 42, 130,
83, 28, 33, 40, 130, 130, 130, 66, 31, 39, 33, 130, 105, 70, 130, 42,
145, 32, 32, 70, 96, 130, 66, 130, 32, 39, 33, 70, 130, 130, 70, 130,
34, 96, 130, 42, 130, 130, 130, 66, 97, 130, 40, 130, 96, 130, 158, 130,
42, 130, 96, 130, 130, 130, 130, 130, 42, 130, 130, 130, 158, 130, 174, 130,
70, 130, 166, 130, 130, 130, 130, 130, 42, 130, 130, 96, 130, 158, 130, 130,
96, 130, 42, 130, 130, 130, 130, 166, 42, 130, 96, 130, 66, 96, 96, 130,
130, 96, 130, 166, 166, 174, 30, 30, 96, 130, 166, 96, 166, 66, 129, 30,
66, 166, 130, 166, 130, 166, 171, 129, 96, 130, 166, 166, 166, 166, 174, 129,
96, 166, 130, 166, 130, 166, 166, 171, 166, 66, 166, 130, 166, 166, 166, 174,
130, 130, 96, 166, 166, 166, 166, 166, 166, 66, 166, 166, 166, 130, 166, 166,
30, 129, 30, 30, 29, 30, 83, 110, 30, 30, 29, 30, 139, 129, 34, 149,
30, 30, 139, 30, 30, 29, 129, 149, 30, 129, 30, 139, 29, 30, 30, 69,
139, 30, 30, 30, 30, 139, 139, 139, 129, 30, 30, 139, 30, 29, 29, 139,
171, 139, 129, 30, 139, 139, 30, 139, 174, 32, 139, 30, 29, 139, 29, 139,
34, 29, 34, 34, 34, 34, 115, 34, 69, 139, 29, 34, 34, 34, 34, 34,
83, 34, 34, 34, 34, 34, 34, 34, 149, 34, 29, 34, 34, 115, 34, 115,
149, 69, 139, 29, 34, 34, 34, 34, 69, 83, 139, 34, 34, 34, 34, 34,
69, 83, 139, 34, 115, 34, 34, 115, 139, 83, 34, 29, 139, 34, 34, 34,
34, 34, 34, 115, 34, 149, 73, 102, 34, 115, 34, 69, 34, 34, 149, 73,
34, 34, 34, 34, 69, 34, 69, 122, 34, 34, 34, 34, 34, 34, 34, 69,
34, 115, 34, 34, 115, 34, 69, 34, 34, 34, 34, 34, 34, 34, 34, 34,
34, 34, 115, 34, 34, 34, 34, 69, 34, 34, 34, 34, 115, 34, 115, 34,
21, 21, 23, 76, 128, 59, 21, 21, 82, 22, 21, 52, 12, 128, 52, 20,
46, 36, 21, 21, 59, 128, 12, 23, 110, 87, 36, 21, 52, 74, 128, 87,
83, 60, 23, 36, 21, 46, 26, 24, 34, 83, 13, 82, 21, 52, 128, 128,
34, 69, 122, 71, 36, 23, 12, 24, 34, 34, 69, 131, 52, 72, 87, 74,
21, 46, 26, 134, 126, 19, 54, 16, 36, 87, 25, 13, 159, 160, 86, 15,
21, 52, 25, 98, 126, 95, 127, 15, 21, 23, 74, 24, 126, 68, 86, 15,
23, 22, 12, 25, 116, 37, 54, 15, 46, 22, 46, 25, 13, 110, 63, 15,
128, 52, 87, 12, 92, 134, 19, 86, 25, 46, 87, 24, 98, 126, 179, 86,
15, 16, 16, 19, 18, 16, 15, 16, 54, 15, 16, 19, 16, 15, 18, 15,
15, 15, 16, 67, 56, 15, 15, 16, 15, 18, 15, 67, 19, 15, 18, 15,
15, 15, 16, 123, 19, 15, 15, 16, 15, 15, 16, 67, 67, 15, 16, 54,
15, 15, 16, 67, 14, 15, 15, 16, 15, 15, 15, 67, 1, 15, 16, 16,
15, 16, 15, 16, 15, 16, 15, 16, 18, 15, 18, 15, 18, 15, 18, 15,
15, 16, 15, 16, 15, 16, 15, 15, 18, 15, 18, 15, 18, 15, 54, 16,
15, 16, 15, 16, 15, 16, 16, 15, 16, 54, 16, 54, 16, 54, 15, 18,
15, 16, 15, 16, 15, 15, 16, 15, 16, 15, 18, 15, 54, 16, 18, 15,
1, 1, 1, 1, 1, 1, 17, 14, 1, 1, 1, 1, 1, 1, 14, 14,
1, 1, 1, 1, 17, 17, 14, 19, 1, 1, 1, 1, 17, 14, 19, 19,
17, 1, 1, 1, 2, 14, 132, 56, 1, 1, 1, 2, 14, 19, 16, 54,
1, 1, 2, 14, 19, 56, 15, 54, 1, 2, 9, 19, 19, 56, 15, 8,
14, 56, 56, 15, 8, 119, 7, 4, 19, 56, 15, 15, 119, 58, 5, 118,
56, 15, 15, 8, 7, 4, 5, 119, 16, 8, 8, 119, 4, 4, 7, 119,
18, 8, 119, 7, 4, 7, 118, 119, 8, 58, 7, 4, 7, 78, 119, 58,
8, 7, 4, 4, 7, 119, 119, 58, 119, 4, 4, 4, 78, 119, 78, 58,
118, 119, 58, 78, 119, 15, 18, 56, 119, 119, 58, 91, 8, 15, 56, 56,
119, 58, 119, 8, 8, 56, 56, 19, 78, 58, 119, 8, 15, 56, 19, 123,
58, 58, 8, 54, 18, 19, 67, 123, 58, 119, 15, 16, 56, 14, 14, 17,
91, 8, 54, 56, 56, 14, 14, 17, 119, 8, 16, 56, 19, 14, 17, 17,
67, 14, 1, 1, 1, 1, 9, 9, 123, 1, 1, 1, 1, 1, 9, 9,
2, 1, 1, 1, 1, 9, 9, 9, 17, 1, 1, 1, 9, 9, 9, 9,
1, 1, 1, 9, 9, 9, 9, 9, 1, 1, 17, 9, 9, 9, 9, 9,
17, 17, 17, 123, 123, 123, 123, 9, 17, 123, 123, 156, 156, 156, 123, 123,
9, 9, 112, 112, 112, 152, 152, 152, 9, 9, 112, 112, 112, 112, 152, 152,
9, 9, 112, 112, 112, 152, 152, 152, 9, 9, 112, 112, 112, 112, 152, 152,
9, 112, 112, 112, 112, 152, 152, 152, 9, 9, 112, 112, 112, 112, 152, 152,
9, 9, 112, 112, 112, 112, 152, 152, 9, 9, 112, 112, 112, 152, 152, 152,
147, 147, 147, 172, 172, 64, 62, 63, 152, 147, 172, 172, 172, 142, 64, 64,
147, 147, 147, 172, 172, 62, 142, 63, 147, 147, 147, 172, 172, 142, 142, 64,
152, 147, 147, 172, 172, 172, 142, 64, 147, 147, 172, 172, 172, 142, 142, 64,
152, 147, 147, 172, 172, 172, 142, 64, 147, 147, 147, 172, 172, 172, 142, 64,
164, 162, 156, 156, 156, 123, 123, 67, 63, 162, 162, 156, 156, 19, 19, 147,
164, 162, 162, 156, 19, 56, 56, 147, 63, 162, 162, 162, 164, 56, 80, 117,
164, 164, 162, 162, 56, 18, 172, 106, 63, 164, 164, 164, 63, 142, 106, 184,
164, 136, 162, 164, 64, 173, 184, 184, 132, 164, 164, 164, 187, 78, 184, 184,
152, 147, 117, 4, 4, 4, 4, 4, 147, 147, 117, 4, 4, 4, 4, 4,
117, 172, 107, 4, 4, 4, 4, 4, 90, 106, 4, 4, 4, 4, 4, 4,
77, 77, 108, 4, 4, 4, 4, 4, 184, 184, 108, 4, 4, 4, 4, 4,
184, 184, 108, 4, 4, 4, 4, 4, 184, 184, 108, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 7, 4, 4,
4, 4, 4, 4, 5, 8, 4, 4, 4, 4, 4, 4, 113, 54, 4, 4,
4, 4, 4, 4, 127, 18, 5, 4, 4, 4, 4, 4, 86, 132, 107, 4,
4, 4, 4, 4, 4, 100, 82, 36, 4, 4, 4, 4, 5, 14, 22, 20,
4, 4, 4, 4, 3, 2, 82, 22, 4, 4, 4, 4, 5, 2, 102, 22,
4, 4, 4, 4, 3, 57, 102, 20, 4, 4, 4, 4, 3, 1, 102, 20,
4, 4, 4, 4, 78, 1, 102, 20, 4, 4, 4, 4, 78, 45, 22, 22,
10, 103, 173, 78, 78, 135, 135, 8, 10, 120, 119, 107, 78, 135, 135, 90,
10, 120, 173, 58, 135, 119, 135, 8, 10, 120, 142, 107, 78, 135, 135, 135,
10, 45, 142, 58, 135, 135, 119, 90, 10, 45, 64, 78, 78, 135, 135, 8,
10, 45, 64, 78, 78, 135, 119, 90, 10, 45, 64, 78, 135, 135, 173, 8,
8, 90, 119, 8, 62, 35, 82, 20, 173, 119, 8, 90, 16, 36, 82, 36,
90, 135, 8, 135, 56, 10, 20, 36, 142, 119, 135, 8, 100, 82, 20, 36,
8, 135, 142, 135, 14, 157, 82, 21, 173, 119, 90, 119, 57, 102, 82, 20,
8, 173, 90, 8, 1, 20, 36, 22, 173, 8, 135, 18, 35, 82, 36, 22,
23, 12, 26, 24, 50, 25, 13, 122, 52, 50, 25, 24, 24, 25, 13, 149,
52, 128, 26, 50, 24, 26, 13, 149, 87, 128, 24, 25, 25, 25, 13, 149,
87, 128, 25, 50, 24, 26, 13, 183, 76, 24, 24, 26, 50, 26, 73, 185,
12, 128, 25, 24, 24, 26, 73, 83, 25, 128, 128, 25, 25, 128, 134, 176,
28, 34, 28, 34, 28, 38, 30, 81, 34, 28, 38, 28, 34, 28, 28, 125,
38, 28, 34, 28, 34, 29, 30, 124, 34, 28, 34, 38, 34, 28, 28, 34,
34, 28, 38, 28, 28, 34, 32, 29, 28, 34, 34, 34, 28, 29, 129, 30,
38, 28, 28, 38, 34, 29, 32, 39, 28, 34, 34, 34, 28, 34, 148, 33,
19, 15, 15, 15, 56, 16, 19, 21, 67, 15, 18, 15, 16, 63, 56, 35,
160, 15, 15, 16, 16, 16, 56, 45, 61, 18, 16, 15, 18, 56, 16, 1,
81, 56, 15, 16, 16, 16, 16, 2, 79, 67, 15, 15, 16, 16, 56, 14,
124, 17, 15, 18, 15, 16, 63, 67, 115, 35, 18, 15, 15, 16, 16, 19,
22, 21, 22, 21, 22, 21, 21, 21, 22, 21, 22, 22, 22, 21, 21, 21,
22, 22, 22, 21, 22, 21, 21, 21, 22, 22, 22, 22, 22, 21, 21, 72,
22, 22, 22, 21, 21, 21, 21, 35, 21, 22, 22, 22, 22, 21, 21, 72,
36, 22, 22, 21, 20, 21, 21, 35, 21, 22, 22, 20, 21, 20, 21, 94,
52, 76, 74, 101, 180, 98, 149, 39, 53, 101, 76, 101, 76, 44, 149, 145,
53, 46, 76, 101, 76, 44, 83, 145, 65, 46, 101, 76, 76, 73, 83, 145,
65, 46, 76, 46, 55, 155, 83, 145, 144, 46, 76, 76, 76, 110, 38, 163,
65, 87, 101, 55, 101, 60, 186, 145, 72, 87, 51, 46, 76, 122, 38, 163,
145, 145, 39, 145, 43, 46, 36, 164, 145, 145, 145, 145, 69, 44, 36, 19,
145, 145, 145, 33, 69, 44, 102, 19, 145, 145, 163, 145, 31, 37, 11, 67,
145, 163, 33, 145, 39, 68, 59, 67, 145, 163, 33, 32, 145, 48, 101, 67,
163, 163, 138, 145, 145, 43, 44, 14, 145, 178, 41, 33, 145, 69, 44, 57,
123, 68, 28, 145, 39, 33, 40, 42, 2, 68, 39, 145, 39, 33, 105, 41,
57, 68, 39, 145, 39, 33, 40, 42, 2, 68, 30, 145, 39, 33, 40, 165,
1, 68, 28, 145, 39, 33, 40, 41, 2, 68, 30, 145, 39, 109, 40, 42,
2, 37, 28, 145, 145, 109, 138, 165, 17, 68, 30, 39, 39, 84, 40, 105,
40, 42, 42, 42, 42, 138, 40, 42, 96, 42, 96, 42, 42, 105, 42, 40,
41, 40, 42, 42, 42, 40, 105, 42, 42, 96, 42, 105, 42, 41, 42, 41,
42, 41, 105, 42, 42, 40, 40, 40, 42, 41, 42, 42, 105, 138, 42, 96,
42, 42, 96, 42, 41, 40, 42, 41, 42, 42, 42, 40, 42, 40, 42, 143,
105, 42, 40, 40, 40, 42, 84, 33, 40, 42, 105, 42, 40, 105, 42, 34,
42, 42, 42, 105, 143, 85, 69, 83, 42, 42, 42, 41, 129, 83, 83, 129,
42, 105, 41, 148, 83, 69, 105, 42, 42, 143, 129, 69, 34, 97, 42, 40,
143, 34, 83, 139, 41, 42, 40, 130, 139, 83, 139, 41, 40, 40, 42, 40,
29, 161, 131, 179, 1, 82, 73, 83, 83, 83, 68, 16, 14, 82, 92, 149,
28, 33, 27, 2, 56, 35, 46, 149, 32, 39, 139, 35, 16, 17, 59, 141,
148, 145, 30, 79, 19, 100, 11, 110, 84, 39, 32, 125, 35, 56, 82, 131,
84, 33, 39, 29, 65, 19, 1, 73, 84, 114, 33, 39, 81, 123, 19, 44,
39, 39, 33, 66, 42, 66, 70, 130, 39, 39, 32, 66, 130, 70, 130, 66,
31, 32, 33, 70, 70, 130, 70, 130, 28, 39, 32, 66, 70, 105, 130, 66,
38, 39, 33, 66, 70, 40, 130, 66, 69, 32, 39, 66, 70, 130, 70, 66,
69, 39, 39, 66, 130, 96, 130, 70, 83, 39, 39, 114, 130, 96, 130, 66,
130, 66, 42, 130, 130, 130, 166, 130, 130, 130, 130, 166, 130, 166, 130, 130,
130, 96, 130, 130, 130, 130, 130, 166, 96, 130, 130, 96, 130, 166, 130, 166,
130, 130, 166, 130, 130, 130, 166, 130, 70, 130, 169, 169, 130, 166, 130, 166,
130, 130, 42, 148, 148, 130, 130, 171, 70, 166, 32, 29, 171, 166, 171, 174,
166, 166, 166, 166, 166, 166, 166, 166, 166, 130, 166, 166, 166, 174, 174, 174,
130, 169, 166, 66, 171, 171, 129, 32, 130, 166, 171, 174, 171, 129, 32, 129,
166, 174, 171, 148, 148, 129, 69, 149, 171, 171, 148, 129, 69, 149, 146, 137,
148, 148, 34, 83, 146, 159, 159, 146, 148, 69, 141, 159, 159, 146, 146, 159,
171, 129, 139, 30, 139, 30, 139, 30, 129, 139, 32, 129, 30, 139, 29, 34,
129, 32, 34, 69, 83, 149, 141, 146, 69, 149, 141, 159, 137, 137, 159, 137,
146, 159, 137, 159, 159, 159, 159, 159, 159, 159, 159, 154, 159, 154, 159, 159,
146, 154, 159, 159, 159, 159, 137, 137, 154, 159, 159, 154, 146, 141, 111, 111,
30, 69, 115, 30, 139, 29, 139, 29, 43, 48, 83, 149, 83, 111, 83, 48,
146, 159, 137, 137, 137, 159, 137, 159, 159, 154, 159, 159, 159, 159, 159, 159,
154, 159, 159, 154, 159, 154, 159, 154, 159, 154, 159, 159, 159, 159, 159, 159,
137, 137, 137, 137, 137, 137, 137, 137, 37, 48, 48, 48, 48, 48, 111, 122,
139, 34, 139, 139, 34, 34, 34, 34, 83, 83, 43, 69, 69, 69, 69, 115,
159, 159, 159, 121, 121, 121, 141, 181, 159, 159, 159, 137, 137, 159, 137, 137,
137, 159, 154, 159, 159, 159, 159, 159, 159, 159, 159, 159, 154, 159, 154, 159,
137, 137, 137, 137, 159, 137, 159, 137, 141, 141, 121, 159, 137, 137, 137, 159,
69, 34, 34, 83, 73, 102, 21, 101, 34, 115, 34, 115, 149, 92, 35, 52,
83, 83, 69, 34, 69, 141, 182, 65, 154, 131, 121, 161, 111, 149, 155, 65,
159, 137, 137, 137, 159, 146, 154, 110, 154, 159, 159, 159, 154, 146, 146, 154,
159, 159, 154, 159, 159, 154, 146, 146, 159, 159, 159, 159, 121, 159, 121, 154,
74, 74, 101, 76, 71, 134, 81, 8, 74, 76, 74, 12, 12, 134, 68, 86,
76, 101, 76, 74, 25, 60, 73, 86, 52, 76, 74, 76, 76, 134, 73, 54,
92, 101, 76, 76, 25, 155, 131, 56, 150, 150, 60, 44, 76, 13, 134, 14,
154, 150, 151, 150, 116, 13, 126, 95, 146, 150, 151, 150, 150, 137, 137, 52,
54, 15, 15, 67, 1, 16, 15, 15, 15, 15, 15, 67, 45, 56, 15, 16,
54, 15, 15, 19, 35, 19, 18, 15, 15, 15, 15, 19, 35, 100, 15, 16,
86, 16, 15, 19, 35, 14, 16, 54, 54, 15, 16, 56, 36, 17, 16, 16,
86, 16, 15, 19, 35, 1, 16, 16, 18, 16, 15, 56, 36, 35, 56, 16,
16, 15, 15, 16, 16, 15, 15, 16, 15, 18, 15, 54, 15, 18, 15, 54,
15, 16, 15, 16, 16, 15, 16, 15, 15, 15, 54, 16, 54, 15, 18, 15,
15, 18, 15, 15, 16, 15, 15, 16, 15, 16, 16, 54, 16, 18, 15, 54,
15, 16, 15, 16, 15, 15, 16, 15, 15, 16, 18, 15, 18, 15, 18, 15,
2, 14, 123, 56, 56, 15, 8, 119, 123, 123, 19, 56, 16, 8, 119, 58,
14, 19, 19, 16, 15, 8, 58, 4, 56, 56, 56, 8, 8, 91, 4, 4,
56, 16, 54, 8, 119, 58, 4, 4, 54, 15, 8, 8, 119, 7, 4, 4,
8, 8, 119, 58, 4, 4, 7, 118, 8, 91, 91, 7, 4, 4, 118, 119,
7, 4, 7, 78, 119, 78, 78, 119, 5, 4, 118, 119, 58, 58, 78, 8,
4, 7, 7, 119, 118, 58, 119, 8, 4, 118, 119, 78, 78, 135, 8, 15,
7, 119, 118, 7, 58, 8, 8, 63, 118, 119, 7, 5, 91, 8, 86, 56,
119, 118, 5, 58, 8, 15, 54, 56, 58, 5, 78, 135, 8, 54, 16, 56,
8, 54, 56, 19, 14, 123, 17, 17, 8, 15, 19, 100, 14, 17, 17, 14,
54, 56, 19, 67, 136, 14, 136, 156, 56, 56, 14, 14, 14, 93, 110, 110,
56, 19, 136, 133, 93, 155, 81, 63, 56, 19, 133, 93, 155, 125, 4, 119,
100, 133, 93, 155, 81, 4, 108, 217, 132, 68, 155, 144, 4, 90, 217, 217,
156, 123, 156, 156, 156, 156, 156, 123, 136, 156, 162, 162, 162, 162, 156, 156,
110, 110, 177, 198, 162, 162, 162, 156, 125, 63, 191, 177, 204, 63, 162, 156,
4, 104, 6, 191, 177, 177, 177, 208, 193, 210, 104, 4, 104, 63, 162, 162,
217, 210, 210, 104, 104, 187, 162, 162, 217, 210, 47, 47, 47, 210, 204, 219,
123, 112, 112, 112, 112, 112, 152, 152, 123, 9, 112, 112, 112, 152, 112, 152,
123, 123, 112, 112, 112, 112, 152, 152, 123, 123, 23, 44, 116, 13, 116, 155,
208, 208, 128, 82, 112, 152, 152, 152, 123, 123, 9, 127, 112, 112, 152, 152,
123, 9, 112, 112, 197, 197, 197, 197, 219, 219, 219, 197, 197, 83, 83, 176,
152, 147, 147, 172, 172, 188, 62, 64, 147, 147, 147, 172, 172, 172, 124, 181,
152, 199, 200, 200, 200, 200, 37, 81, 155, 201, 205, 147, 172, 172, 80, 4,
152, 147, 4, 147, 147, 80, 56, 56, 152, 152, 147, 209, 209, 209, 209, 209,
197, 197, 197, 197, 197, 183, 183, 176, 176, 176, 176, 176, 176, 176, 183, 219,
164, 136, 164, 43, 111, 83, 83, 186, 110, 131, 131, 177, 191, 193, 184, 184,
56, 162, 162, 63, 4, 193, 108, 108, 56, 162, 162, 63, 104, 39, 194, 194,
209, 209, 209, 210, 31, 143, 211, 163, 209, 213, 47, 214, 167, 203, 28, 108,
176, 38, 204, 47, 210, 217, 217, 193, 219, 219, 219, 213, 213, 213, 6, 4,
186, 189, 108, 4, 4, 4, 4, 4, 194, 195, 189, 4, 4, 4, 4, 196,
4, 194, 186, 4, 4, 4, 196, 201, 184, 184, 206, 4, 4, 199, 201, 75,
184, 184, 206, 4, 199, 201, 144, 127, 4, 158, 83, 199, 37, 205, 5, 4,
184, 48, 139, 185, 179, 108, 193, 212, 192, 83, 199, 181, 132, 108, 212, 212,
4, 4, 4, 4, 8, 190, 173, 4, 155, 116, 140, 60, 68, 190, 142, 4,
75, 112, 9, 23, 116, 134, 68, 4, 127, 4, 4, 127, 1, 52, 116, 140,
4, 212, 153, 108, 135, 127, 1, 1, 212, 212, 212, 215, 185, 190, 190, 78,
212, 212, 153, 185, 43, 43, 215, 200, 150, 212, 200, 43, 199, 43, 43, 215,
4, 4, 4, 4, 135, 45, 102, 20, 4, 4, 4, 4, 135, 35, 22, 20,
4, 4, 4, 4, 135, 99, 22, 20, 140, 140, 140, 140, 140, 140, 140, 140,
1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 142, 99, 22, 20,
218, 153, 212, 153, 212, 153, 212, 153, 215, 200, 215, 215, 215, 215, 215, 215,
10, 99, 132, 78, 119, 135, 135, 119, 10, 35, 190, 78, 135, 135, 8, 90,
10, 35, 100, 135, 78, 135, 119, 135, 140, 140, 140, 140, 140, 140, 140, 140,
1, 1, 1, 1, 1, 1, 1, 1, 10, 99, 170, 142, 78, 135, 119, 90,
212, 153, 212, 153, 212, 153, 212, 153, 215, 215, 215, 215, 215, 215, 215, 200,
142, 135, 173, 16, 36, 157, 36, 23, 119, 90, 119, 56, 10, 82, 36, 68,
142, 68, 134, 140, 140, 140, 140, 116, 140, 116, 95, 1, 1, 1, 1, 1,
1, 1, 127, 123, 157, 82, 21, 59, 90, 119, 8, 212, 212, 212, 212, 212,
212, 212, 212, 212, 212, 212, 212, 200, 218, 200, 200, 153, 218, 215, 215, 215,
25, 50, 25, 25, 68, 134, 140, 140, 134, 140, 140, 140, 116, 95, 1, 1,
95, 1, 1, 1, 1, 127, 141, 38, 127, 128, 50, 24, 25, 49, 124, 191,
128, 212, 212, 212, 200, 124, 191, 191, 212, 150, 212, 215, 199, 191, 199, 43,
200, 218, 215, 43, 199, 43, 200, 212, 218, 200, 200, 200, 212, 212, 212, 6,
140, 134, 68, 28, 38, 29, 148, 109, 1, 95, 116, 68, 30, 29, 148, 66,
28, 127, 95, 134, 29, 29, 148, 158, 191, 34, 1, 140, 29, 30, 109, 96,
184, 127, 95, 134, 28, 30, 109, 96, 28, 1, 116, 68, 30, 30, 66, 96,
34, 1, 140, 29, 30, 30, 109, 169, 113, 95, 134, 29, 28, 32, 66, 207,
139, 35, 56, 15, 16, 16, 63, 56, 30, 79, 19, 15, 16, 15, 68, 134,
32, 81, 9, 62, 68, 134, 116, 52, 33, 27, 45, 68, 116, 95, 57, 127,
84, 115, 68, 116, 52, 127, 16, 56, 70, 139, 134, 95, 127, 86, 216, 110,
105, 68, 116, 1, 54, 216, 216, 37, 68, 116, 52, 127, 54, 216, 216, 81,
35, 20, 20, 20, 21, 20, 21, 35, 140, 140, 134, 68, 20, 94, 21, 94,
1, 57, 95, 116, 68, 21, 94, 21, 57, 94, 127, 95, 60, 94, 75, 35,
93, 191, 20, 57, 140, 94, 94, 21, 124, 191, 94, 57, 140, 94, 20, 94,
191, 125, 94, 112, 140, 94, 94, 94, 191, 196, 82, 103, 140, 94, 20, 94,
72, 87, 76, 76, 101, 141, 28, 163, 35, 87, 74, 76, 101, 141, 28, 163,
35, 87, 51, 76, 155, 161, 145, 145, 21, 87, 74, 180, 13, 161, 145, 145,
21, 52, 50, 180, 13, 149, 39, 145, 21, 52, 51, 12, 13, 161, 39, 145,
94, 95, 25, 50, 13, 83, 39, 39, 21, 88, 25, 26, 134, 83, 145, 39,
145, 178, 138, 84, 33, 34, 73, 35, 145, 178, 138, 40, 33, 30, 73, 94,
145, 40, 41, 138, 33, 39, 37, 53, 145, 178, 138, 42, 84, 145, 48, 87,
39, 178, 40, 96, 178, 33, 43, 101, 33, 70, 40, 42, 40, 163, 69, 71,
145, 70, 105, 42, 42, 178, 29, 46, 33, 105, 40, 42, 40, 40, 30, 68,
2, 93, 39, 145, 145, 178, 96, 165, 2, 48, 28, 145, 33, 70, 42, 96,
1, 37, 30, 145, 39, 105, 40, 41, 57, 43, 30, 145, 33, 40, 41, 105,
20, 37, 28, 33, 33, 40, 42, 42, 55, 48, 32, 145, 33, 40, 42, 165,
55, 48, 145, 33, 33, 105, 40, 42, 55, 48, 39, 33, 33, 105, 40, 41,
42, 105, 41, 105, 40, 41, 143, 69, 42, 42, 40, 40, 41, 41, 69, 83,
165, 42, 165, 41, 143, 69, 83, 148, 42, 40, 42, 202, 34, 69, 129, 207,
96, 40, 202, 34, 83, 139, 41, 138, 41, 202, 34, 83, 139, 202, 42, 42,
143, 34, 149, 139, 202, 40, 42, 42, 34, 161, 34, 202, 42, 41, 42, 42,
83, 129, 143, 42, 40, 40, 105, 42, 129, 143, 40, 42, 42, 40, 42, 96,
202, 42, 96, 40, 96, 42, 40, 40, 41, 42, 42, 42, 40, 42, 96, 40,
42, 42, 105, 42, 42, 96, 42, 40, 96, 42, 42, 42, 42, 40, 42, 96,
41, 42, 96, 40, 96, 42, 40, 40, 42, 42, 42, 96, 40, 42, 96, 40,
40, 109, 33, 39, 115, 35, 16, 46, 40, 70, 33, 39, 30, 79, 19, 61,
40, 66, 109, 33, 39, 125, 2, 133, 40, 70, 148, 33, 39, 139, 61, 19,
70, 40, 66, 33, 39, 31, 27, 112, 40, 40, 105, 114, 33, 39, 115, 21,
105, 40, 70, 84, 33, 39, 30, 48, 40, 40, 40, 66, 114, 33, 28, 83,
83, 31, 39, 66, 70, 42, 130, 96, 176, 31, 33, 148, 130, 96, 84, 32,
43, 47, 39, 109, 130, 32, 38, 31, 43, 28, 33, 39, 34, 38, 32, 66,
34, 38, 47, 38, 28, 70, 42, 66, 43, 176, 38, 29, 70, 130, 130, 203,
146, 83, 47, 33, 130, 70, 70, 70, 151, 149, 39, 33, 70, 130, 70, 69,
148, 32, 32, 166, 130, 171, 114, 32, 32, 148, 130, 130, 148, 114, 34, 149,
203, 66, 70, 203, 148, 69, 141, 159, 66, 203, 203, 32, 69, 121, 146, 146,
148, 84, 30, 83, 154, 146, 146, 146, 114, 29, 149, 146, 146, 146, 146, 154,
69, 161, 146, 146, 146, 146, 146, 48, 141, 146, 146, 146, 146, 146, 124, 192,
83, 146, 159, 146, 146, 146, 154, 159, 159, 146, 154, 146, 154, 137, 141, 48,
146, 146, 146, 159, 146, 48, 124, 48, 146, 154, 159, 111, 124, 43, 122, 121,
154, 141, 83, 124, 111, 146, 141, 122, 149, 115, 124, 141, 121, 122, 122, 121,
192, 48, 146, 141, 122, 141, 121, 146, 83, 121, 141, 122, 121, 121, 121, 122,
146, 122, 48, 43, 124, 93, 43, 27, 124, 48, 48, 122, 141, 121, 159, 154,
122, 146, 159, 121, 121, 121, 153, 121, 121, 153, 153, 153, 153, 153, 153, 153,
122, 141, 121, 121, 159, 146, 121, 159, 159, 121, 121, 121, 121, 153, 122, 153,
121, 153, 153, 153, 153, 153, 153, 153, 122, 153, 153, 153, 153, 153, 153, 153,
43, 48, 93, 27, 125, 191, 192, 191, 154, 159, 146, 154, 121, 122, 37, 27,
153, 153, 153, 121, 121, 146, 159, 159, 153, 153, 153, 153, 153, 153, 153, 121,
121, 121, 121, 121, 153, 153, 153, 153, 121, 121, 126, 121, 121, 126, 121, 121,
153, 153, 153, 153, 153, 121, 126, 121, 153, 153, 153, 153, 153, 153, 153, 153,
191, 191, 27, 124, 48, 122, 159, 159, 191, 192, 191, 192, 191, 191, 27, 48,
141, 48, 27, 191, 192, 191, 192, 191, 121, 159, 121, 37, 125, 191, 191, 191,
153, 153, 121, 159, 141, 48, 191, 191, 153, 153, 153, 153, 126, 121, 37, 191,
159, 121, 153, 153, 153, 153, 131, 68, 153, 121, 121, 121, 110, 153, 110, 126,
159, 159, 159, 146, 159, 159, 154, 121, 121, 159, 159, 159, 121, 159, 159, 159,
125, 37, 159, 126, 159, 159, 121, 154, 191, 191, 48, 159, 159, 121, 159, 159,
191, 162, 191, 37, 159, 159, 159, 154, 191, 191, 191, 191, 110, 137, 159, 159,
191, 191, 191, 192, 93, 159, 159, 159, 37, 191, 191, 191, 191, 122, 137, 154,
154, 154, 151, 150, 161, 141, 150, 68, 154, 159, 150, 150, 197, 92, 126, 92,
159, 154, 137, 150, 161, 50, 116, 73, 159, 159, 154, 154, 161, 71, 116, 73,
159, 154, 159, 146, 209, 37, 13, 73, 159, 159, 154, 141, 83, 37, 13, 131,
154, 159, 154, 121, 183, 37, 13, 131, 159, 159, 154, 141, 83, 83, 13, 126,
16, 15, 15, 19, 35, 35, 56, 15, 18, 18, 15, 56, 35, 36, 19, 18,
56, 15, 15, 56, 35, 82, 67, 16, 56, 18, 15, 56, 35, 20, 17, 16,
56, 54, 15, 56, 35, 22, 1, 16, 132, 15, 15, 56, 35, 20, 45, 56,
132, 54, 15, 56, 35, 22, 35, 56, 170, 86, 15, 16, 35, 22, 36, 19,
15, 15, 15, 16, 15, 16, 15, 16, 16, 18, 15, 18, 15, 18, 15, 54,
15, 15, 16, 15, 16, 15, 16, 15, 18, 15, 18, 15, 18, 15, 18, 15,
15, 16, 15, 16, 15, 16, 15, 16, 15, 15, 15, 18, 15, 18, 15, 54,
16, 15, 16, 15, 16, 15, 16, 15, 15, 15, 54, 15, 18, 15, 18, 15,
91, 91, 78, 4, 4, 4, 78, 119, 78, 78, 5, 4, 4, 7, 78, 7,
78, 5, 4, 4, 7, 118, 118, 7, 118, 4, 4, 6, 118, 78, 118, 7,
4, 4, 4, 118, 118, 118, 5, 7, 4, 4, 7, 118, 118, 7, 7, 78,
4, 4, 7, 119, 7, 5, 58, 78, 4, 118, 118, 6, 4, 5, 135, 78,
118, 7, 78, 91, 8, 15, 16, 19, 4, 78, 119, 119, 8, 54, 16, 100,
5, 119, 119, 8, 86, 54, 89, 89, 7, 119, 91, 8, 15, 54, 86, 89,
78, 91, 91, 119, 91, 91, 127, 89, 119, 58, 91, 91, 58, 113, 127, 117,
119, 91, 91, 58, 5, 113, 117, 117, 78, 58, 58, 7, 107, 113, 127, 117,
100, 60, 144, 108, 90, 217, 217, 217, 56, 155, 147, 4, 217, 217, 224, 224,
155, 144, 4, 106, 217, 224, 224, 224, 116, 152, 117, 183, 224, 224, 224, 224,
155, 205, 4, 108, 224, 224, 224, 224, 75, 71, 152, 5, 107, 108, 184, 224,
147, 205, 232, 147, 107, 4, 108, 224, 117, 152, 205, 232, 107, 108, 220, 224,
217, 220, 39, 39, 47, 47, 204, 47, 224, 225, 225, 33, 214, 214, 214, 204,
224, 224, 210, 47, 47, 204, 47, 204, 224, 217, 217, 217, 210, 213, 213, 213,
224, 224, 217, 217, 213, 213, 213, 219, 224, 217, 217, 217, 213, 213, 213, 162,
224, 224, 217, 213, 213, 213, 213, 156, 224, 217, 217, 217, 213, 213, 213, 156,
204, 204, 83, 204, 176, 176, 69, 176, 204, 204, 83, 83, 219, 219, 183, 209,
219, 219, 219, 219, 219, 183, 197, 197, 219, 219, 219, 197, 197, 197, 197, 197,
219, 219, 219, 141, 219, 141, 112, 152, 123, 9, 9, 9, 112, 112, 127, 112,
123, 9, 9, 112, 112, 112, 94, 13, 123, 208, 208, 208, 116, 116, 60, 182,
176, 176, 183, 209, 209, 209, 219, 209, 209, 209, 209, 209, 209, 209, 197, 219,
197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 9, 9, 9, 9,
152, 112, 112, 112, 127, 9, 9, 9, 112, 112, 112, 112, 10, 13, 208, 208,
116, 116, 116, 116, 208, 52, 9, 9, 112, 112, 112, 112, 112, 112, 112, 9,
219, 209, 219, 209, 213, 197, 104, 104, 219, 219, 219, 219, 63, 63, 6, 191,
197, 193, 193, 6, 6, 162, 125, 177, 6, 4, 156, 162, 227, 177, 177, 93,
123, 227, 208, 208, 177, 93, 156, 162, 208, 208, 198, 123, 156, 156, 156, 17,
9, 123, 9, 123, 123, 123, 123, 17, 9, 9, 9, 123, 9, 123, 17, 17,
111, 124, 111, 81, 4, 4, 212, 212, 111, 63, 110, 136, 4, 212, 212, 212,
43, 164, 131, 133, 6, 212, 212, 212, 136, 156, 126, 14, 4, 212, 212, 212,
156, 17, 134, 95, 113, 4, 77, 212, 136, 17, 93, 116, 95, 1, 127, 4,
17, 17, 170, 68, 134, 116, 95, 1, 17, 17, 133, 7, 4, 68, 134, 140,
212, 212, 218, 215, 215, 199, 215, 43, 212, 221, 212, 221, 221, 221, 221, 221,
212, 221, 221, 221, 212, 221, 212, 221, 212, 212, 212, 212, 212, 212, 212, 212,
212, 212, 212, 212, 212, 212, 212, 212, 4, 4, 4, 4, 3, 175, 190, 190,
1, 1, 1, 1, 1, 1, 1, 57, 140, 140, 140, 140, 140, 140, 140, 140,
215, 215, 215, 215, 215, 215, 215, 215, 221, 221, 221, 221, 221, 221, 221, 218,
212, 221, 212, 221, 212, 221, 212, 221, 212, 212, 212, 212, 221, 212, 221, 221,
212, 212, 212, 212, 212, 221, 221, 221, 175, 3, 4, 4, 80, 157, 23, 221,
1, 1, 1, 1, 1, 127, 82, 221, 140, 140, 140, 140, 1, 82, 221, 221,
215, 215, 215, 215, 215, 215, 215, 215, 218, 218, 226, 215, 226, 215, 226, 215,
221, 221, 221, 218, 218, 218, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221,
221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221,
221, 221, 221, 221, 218, 221, 221, 221, 221, 221, 221, 218, 218, 221, 221, 221,
215, 215, 218, 218, 218, 221, 221, 221, 218, 221, 221, 221, 212, 221, 212, 221,
221, 212, 221, 212, 221, 221, 212, 212, 221, 221, 221, 221, 212, 212, 212, 212,
221, 212, 221, 212, 157, 75, 52, 128, 90, 119, 170, 82, 127, 1, 1, 1,
90, 1, 1, 1, 95, 116, 140, 140, 8, 1, 140, 140, 134, 68, 59, 128,
221, 212, 212, 212, 212, 150, 212, 104, 212, 212, 212, 212, 212, 212, 104, 127,
212, 212, 212, 150, 128, 193, 127, 95, 212, 3, 50, 26, 127, 1, 95, 116,
51, 127, 1, 1, 95, 116, 134, 68, 1, 95, 116, 140, 134, 68, 69, 38,
140, 134, 68, 25, 128, 110, 69, 29, 25, 26, 24, 25, 49, 110, 38, 34,
1, 116, 68, 29, 30, 32, 109, 96, 52, 134, 29, 30, 30, 32, 66, 42,
116, 68, 29, 30, 30, 32, 109, 68, 68, 34, 29, 30, 30, 32, 109, 134,
28, 29, 28, 30, 39, 32, 68, 116, 29, 34, 29, 30, 30, 32, 134, 95,
34, 29, 30, 30, 39, 45, 140, 1, 28, 29, 29, 30, 30, 68, 116, 9,
134, 95, 127, 35, 216, 216, 222, 124, 140, 1, 139, 216, 222, 222, 60, 196,
116, 1, 148, 222, 222, 222, 92, 92, 52, 127, 66, 222, 228, 228, 229, 92,
1, 169, 222, 228, 228, 228, 68, 60, 127, 169, 222, 228, 228, 229, 229, 222,
169, 222, 228, 228, 228, 229, 60, 222, 169, 228, 228, 228, 234, 92, 92, 228,
196, 110, 94, 112, 140, 94, 94, 20, 110, 216, 10, 57, 116, 94, 20, 36,
222, 67, 127, 88, 60, 82, 94, 21, 222, 56, 112, 116, 68, 94, 82, 20,
216, 100, 112, 140, 10, 82, 82, 21, 222, 89, 9, 116, 82, 82, 21, 82,
216, 89, 9, 140, 94, 82, 82, 22, 89, 127, 88, 60, 82, 36, 21, 75,
94, 88, 25, 26, 134, 69, 145, 39, 94, 88, 25, 26, 131, 38, 145, 32,
94, 88, 12, 128, 126, 38, 145, 39, 21, 53, 76, 50, 131, 38, 145, 39,
94, 53, 59, 24, 131, 34, 145, 39, 22, 53, 59, 25, 131, 38, 145, 39,
21, 22, 59, 51, 155, 34, 145, 39, 22, 21, 68, 134, 140, 140, 140, 140,
33, 105, 40, 105, 42, 40, 145, 93, 33, 105, 40, 40, 96, 40, 163, 48,
33, 105, 40, 40, 42, 42, 178, 124, 33, 40, 40, 42, 40, 42, 178, 34,
32, 40, 105, 42, 138, 42, 40, 129, 33, 105, 40, 42, 105, 138, 40, 32,
33, 40, 105, 41, 40, 105, 138, 109, 140, 140, 140, 134, 68, 40, 42, 109,
26, 43, 145, 32, 33, 40, 41, 174, 49, 43, 33, 145, 109, 40, 42, 83,
49, 43, 39, 33, 33, 143, 69, 161, 44, 43, 33, 33, 178, 129, 141, 34,
73, 43, 145, 33, 84, 83, 83, 143, 73, 43, 33, 163, 69, 161, 174, 230,
37, 83, 84, 32, 161, 69, 202, 41, 48, 83, 178, 69, 83, 138, 41, 40,
149, 69, 42, 40, 105, 42, 41, 96, 83, 165, 41, 42, 42, 42, 42, 42,
174, 41, 105, 42, 138, 96, 42, 105, 41, 105, 41, 42, 105, 42, 41, 42,
41, 42, 105, 105, 42, 96, 42, 96, 40, 42, 41, 40, 41, 42, 41, 40,
42, 165, 42, 96, 40, 96, 42, 165, 96, 138, 42, 138, 42, 41, 42, 42,
41, 42, 96, 40, 42, 96, 42, 40, 42, 42, 40, 42, 96, 40, 40, 96,
41, 42, 42, 42, 42, 105, 42, 42, 96, 42, 42, 42, 42, 40, 105, 42,
41, 40, 42, 42, 42, 42, 42, 96, 42, 96, 42, 42, 105, 42, 40, 143,
41, 42, 42, 41, 42, 96, 41, 32, 42, 96, 42, 42, 42, 41, 30, 38,
40, 42, 70, 105, 40, 47, 38, 176, 42, 96, 42, 42, 30, 38, 38, 31,
105, 40, 42, 28, 38, 34, 145, 39, 42, 40, 30, 38, 30, 178, 33, 39,
40, 30, 38, 28, 40, 84, 33, 33, 30, 38, 32, 42, 130, 70, 114, 39,
38, 39, 41, 40, 40, 70, 84, 33, 39, 41, 42, 96, 105, 105, 70, 70,
121, 149, 28, 33, 70, 203, 34, 141, 83, 161, 30, 33, 70, 34, 141, 146,
69, 149, 31, 148, 28, 161, 146, 146, 38, 83, 39, 29, 161, 146, 146, 121,
34, 176, 29, 149, 146, 146, 146, 146, 31, 69, 83, 146, 146, 121, 146, 141,
39, 149, 146, 146, 141, 146, 121, 69, 38, 121, 121, 146, 146, 141, 83, 223,
146, 146, 146, 146, 122, 115, 223, 83, 121, 146, 146, 149, 115, 223, 111, 121,
146, 146, 141, 115, 167, 69, 146, 122, 146, 141, 115, 223, 115, 141, 141, 161,
141, 115, 223, 223, 111, 121, 122, 122, 115, 223, 223, 124, 121, 161, 122, 161,
223, 223, 192, 149, 146, 161, 122, 122, 223, 223, 115, 141, 122, 161, 161, 141,
159, 122, 122, 121, 121, 141, 153, 122, 122, 122, 141, 121, 141, 122, 153, 153,
153, 141, 121, 141, 153, 122, 122, 122, 122, 121, 141, 122, 122, 122, 153, 141,
121, 141, 122, 153, 122, 122, 122, 122, 121, 141, 122, 122, 122, 153, 122, 153,
141, 153, 122, 122, 122, 122, 122, 122, 121, 161, 122, 122, 153, 122, 122, 122,
153, 122, 153, 122, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153,
122, 153, 122, 153, 153, 122, 153, 153, 122, 153, 153, 122, 153, 153, 153, 153,
153, 122, 153, 153, 153, 153, 153, 153, 122, 122, 153, 122, 153, 153, 153, 153,
153, 122, 153, 153, 153, 122, 153, 153, 122, 153, 153, 122, 153, 153, 153, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 122,
153, 153, 153, 153, 153, 122, 122, 122, 153, 153, 153, 153, 153, 153, 231, 122,
153, 153, 153, 153, 200, 122, 231, 231, 153, 153, 153, 153, 122, 231, 231, 231,
153, 153, 153, 121, 121, 110, 153, 122, 122, 122, 122, 122, 131, 121, 131, 153,
153, 122, 122, 122, 122, 121, 121, 131, 122, 122, 122, 122, 122, 122, 131, 121,
122, 161, 122, 122, 122, 122, 122, 121, 231, 122, 161, 122, 122, 122, 153, 153,
231, 161, 231, 122, 122, 122, 122, 153, 231, 231, 122, 122, 122, 122, 153, 153,
126, 111, 191, 191, 192, 124, 146, 137, 153, 126, 37, 191, 191, 192, 48, 159,
122, 153, 159, 37, 191, 192, 191, 141, 153, 153, 153, 146, 93, 192, 192, 48,
131, 153, 153, 121, 121, 125, 191, 191, 121, 121, 153, 153, 159, 122, 191, 192,
153, 121, 153, 153, 153, 146, 43, 233, 153, 121, 121, 153, 153, 126, 141, 191,
159, 154, 159, 161, 176, 176, 73, 126, 159, 159, 146, 149, 176, 176, 73, 126,
137, 159, 154, 149, 69, 176, 48, 126, 137, 154, 121, 149, 69, 176, 69, 121,
122, 137, 121, 83, 69, 69, 69, 111, 124, 159, 146, 149, 69, 69, 69, 83,
192, 111, 146, 83, 69, 34, 69, 83, 233, 124, 122, 176, 69, 139, 139, 83,
179, 86, 15, 56, 35, 22, 36, 67, 27, 86, 15, 56, 35, 22, 22, 2,
93, 86, 18, 16, 35, 22, 22, 1, 93, 86, 15, 56, 35, 22, 82, 45,
93, 86, 15, 16, 35, 22, 22, 35, 93, 89, 15, 56, 35, 75, 22, 35,
37, 86, 86, 56, 35, 22, 22, 36, 37, 89, 15, 56, 35, 22, 22, 21,
16, 15, 16, 15, 15, 16, 15, 16, 16, 16, 16, 16, 54, 15, 18, 15,
16, 15, 15, 15, 16, 16, 15, 15, 56, 16, 18, 15, 18, 15, 54, 16,
19, 15, 15, 16, 15, 16, 15, 15, 19, 16, 15, 18, 15, 18, 16, 54,
67, 16, 16, 15, 16, 15, 15, 15, 2, 16, 54, 15, 18, 15, 18, 16,
7, 118, 118, 4, 4, 7, 78, 58, 7, 118, 118, 4, 5, 78, 78, 5,
78, 7, 4, 4, 78, 78, 6, 7, 7, 5, 4, 4, 118, 78, 4, 6,
118, 4, 4, 4, 118, 7, 5, 6, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
58, 58, 7, 5, 107, 127, 127, 117, 58, 58, 5, 4, 107, 127, 127, 117,
7, 4, 4, 4, 5, 113, 113, 117, 7, 4, 4, 4, 5, 4, 113, 127,
7, 4, 4, 4, 4, 4, 107, 127, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5,
117, 117, 152, 232, 5, 4, 224, 224, 117, 117, 235, 147, 4, 4, 220, 224,
117, 112, 235, 127, 4, 220, 224, 224, 117, 237, 152, 4, 4, 220, 224, 224,
113, 237, 147, 4, 225, 220, 224, 224, 168, 237, 147, 4, 220, 220, 224, 224,
237, 152, 4, 4, 220, 220, 220, 224, 244, 152, 4, 186, 220, 220, 224, 224,
224, 224, 217, 210, 213, 213, 162, 6, 224, 217, 210, 213, 213, 213, 63, 156,
224, 224, 210, 217, 213, 213, 63, 162, 224, 217, 210, 217, 213, 104, 6, 227,
224, 225, 210, 217, 213, 104, 162, 177, 224, 225, 225, 210, 213, 104, 63, 60,
224, 243, 47, 47, 47, 104, 63, 60, 220, 225, 243, 145, 6, 6, 63, 162,
227, 208, 9, 99, 9, 9, 112, 112, 208, 9, 9, 9, 9, 112, 112, 112,
208, 123, 9, 9, 112, 112, 103, 112, 208, 123, 123, 123, 112, 112, 103, 152,
198, 156, 67, 112, 67, 133, 152, 196, 56, 19, 196, 110, 155, 131, 155, 201,
60, 134, 73, 144, 100, 147, 147, 152, 162, 19, 100, 4, 100, 147, 147, 147,
112, 112, 112, 112, 112, 112, 112, 9, 112, 152, 112, 112, 112, 112, 112, 9,
112, 112, 112, 152, 112, 112, 112, 52, 152, 152, 152, 95, 13, 116, 116, 13,
155, 116, 116, 13, 94, 112, 9, 9, 205, 152, 152, 152, 127, 112, 112, 9,
106, 152, 112, 112, 112, 197, 83, 115, 152, 197, 197, 197, 197, 83, 125, 192,
9, 9, 9, 9, 9, 17, 9, 17, 9, 9, 9, 9, 9, 17, 1, 1,
208, 116, 208, 68, 9, 1, 1, 1, 22, 9, 23, 116, 68, 1, 1, 1,
127, 9, 127, 23, 134, 1, 1, 1, 9, 192, 1, 1, 140, 1, 1, 1,
192, 236, 9, 1, 140, 1, 1, 1, 192, 69, 1, 1, 140, 1, 1, 1,
1, 1, 14, 135, 4, 4, 135, 135, 1, 1, 160, 142, 4, 4, 135, 90,
1, 1, 17, 64, 4, 4, 119, 135, 1, 1, 160, 62, 4, 4, 135, 142,
1, 1, 1, 64, 4, 4, 135, 64, 1, 1, 1, 80, 4, 4, 135, 64,
1, 1, 1, 132, 5, 4, 5, 64, 1, 1, 1, 170, 118, 4, 3, 64,
4, 4, 4, 4, 4, 64, 190, 190, 4, 4, 4, 4, 4, 142, 170, 190,
4, 4, 4, 4, 4, 142, 170, 190, 4, 4, 4, 4, 4, 142, 190, 190,
4, 4, 4, 4, 4, 142, 190, 190, 4, 4, 4, 4, 4, 135, 190, 190,
5, 4, 4, 4, 4, 78, 190, 170, 5, 4, 4, 4, 4, 7, 190, 190,
190, 78, 4, 140, 1, 82, 221, 212, 170, 142, 4, 140, 1, 102, 221, 221,
190, 64, 4, 140, 1, 10, 212, 221, 190, 64, 68, 116, 1, 82, 221, 221,
170, 190, 134, 52, 127, 82, 221, 221, 190, 190, 140, 1, 62, 212, 221, 221,
190, 190, 140, 1, 172, 212, 221, 221, 190, 190, 140, 1, 142, 221, 221, 221,
221, 221, 221, 218, 218, 221, 212, 142, 221, 221, 221, 218, 218, 218, 212, 119,
221, 221, 221, 226, 215, 218, 212, 119, 221, 221, 221, 226, 215, 200, 212, 119,
221, 221, 221, 226, 215, 215, 153, 173, 221, 221, 221, 226, 215, 215, 212, 8,
221, 221, 218, 215, 215, 215, 153, 90, 221, 221, 218, 226, 215, 215, 212, 173,
127, 95, 134, 10, 20, 82, 76, 128, 1, 116, 68, 10, 20, 82, 76, 25,
1, 140, 45, 10, 82, 21, 12, 26, 1, 140, 35, 157, 82, 22, 12, 26,
1, 140, 99, 10, 82, 22, 12, 128, 1, 140, 10, 10, 82, 23, 74, 25,
1, 140, 99, 10, 82, 11, 25, 25, 1, 140, 10, 94, 36, 11, 50, 25,
50, 25, 24, 25, 49, 122, 38, 29, 25, 128, 25, 25, 49, 122, 34, 28,
50, 25, 50, 24, 49, 122, 38, 34, 24, 26, 50, 25, 13, 149, 34, 28,
25, 25, 24, 26, 13, 149, 34, 29, 25, 26, 50, 25, 13, 149, 29, 28,
25, 25, 24, 26, 116, 83, 34, 29, 26, 50, 25, 26, 60, 83, 29, 28,
38, 29, 29, 30, 32, 134, 95, 127, 29, 29, 30, 30, 32, 140, 9, 169,
34, 29, 31, 129, 68, 116, 9, 97, 29, 29, 30, 30, 134, 23, 127, 167,
29, 29, 31, 129, 140, 9, 171, 228, 29, 29, 129, 68, 116, 9, 203, 228,
29, 31, 32, 134, 23, 113, 171, 228, 29, 29, 31, 140, 9, 32, 228, 228,
169, 228, 228, 234, 234, 229, 208, 222, 228, 228, 228, 234, 229, 229, 60, 222,
228, 228, 234, 234, 229, 92, 228, 216, 228, 228, 234, 234, 229, 92, 222, 222,
228, 234, 234, 234, 229, 208, 222, 222, 228, 234, 234, 229, 92, 229, 60, 19,
234, 234, 234, 229, 229, 37, 37, 2, 234, 234, 234, 229, 93, 27, 27, 6,
86, 9, 116, 68, 82, 21, 22, 82, 18, 9, 140, 99, 22, 36, 68, 134,
89, 9, 140, 99, 68, 134, 116, 95, 18, 9, 140, 68, 116, 95, 1, 127,
54, 1, 140, 116, 23, 127, 21, 21, 127, 23, 95, 1, 127, 22, 216, 222,
1, 95, 127, 54, 17, 222, 222, 222, 1, 127, 54, 222, 222, 222, 228, 228,
68, 134, 116, 95, 1, 1, 1, 1, 116, 95, 1, 127, 110, 28, 39, 39,
1, 127, 52, 46, 216, 131, 93, 125, 21, 22, 216, 216, 126, 93, 125, 191,
216, 216, 222, 222, 93, 124, 93, 110, 222, 222, 134, 37, 37, 134, 216, 216,
228, 134, 229, 134, 222, 216, 216, 39, 234, 229, 228, 228, 222, 216, 39, 127,
1, 1, 1, 95, 116, 68, 42, 178, 109, 40, 40, 127, 95, 134, 41, 138,
191, 191, 125, 40, 1, 140, 42, 41, 27, 37, 105, 127, 95, 134, 40, 41,
216, 105, 127, 95, 116, 68, 42, 41, 84, 127, 95, 116, 68, 41, 105, 41,
127, 95, 116, 68, 105, 42, 42, 41, 95, 116, 68, 138, 40, 105, 41, 41,
43, 69, 30, 141, 69, 230, 40, 41, 69, 83, 83, 141, 32, 41, 41, 96,
115, 83, 141, 83, 138, 40, 41, 42, 30, 149, 141, 139, 40, 40, 138, 42,
148, 161, 83, 40, 178, 40, 41, 96, 109, 149, 34, 178, 109, 40, 41, 42,
34, 149, 30, 84, 85, 40, 41, 96, 69, 69, 31, 84, 40, 40, 40, 41,
165, 42, 105, 42, 96, 42, 96, 40, 42, 40, 41, 42, 138, 42, 42, 42,
165, 42, 138, 96, 41, 40, 105, 40, 42, 42, 41, 40, 42, 41, 96, 165,
42, 165, 40, 42, 96, 42, 41, 42, 41, 40, 42, 41, 138, 40, 84, 33,
42, 96, 138, 40, 85, 33, 145, 145, 165, 42, 96, 84, 39, 145, 32, 145,
96, 41, 105, 42, 143, 145, 38, 30, 41, 42, 42, 41, 109, 38, 38, 41,
42, 42, 96, 105, 38, 38, 163, 42, 96, 40, 163, 47, 38, 32, 143, 96,
84, 145, 47, 38, 145, 41, 165, 96, 145, 30, 38, 34, 138, 42, 40, 40,
39, 38, 38, 178, 41, 42, 42, 42, 28, 38, 163, 41, 42, 96, 42, 40,
41, 42, 96, 40, 42, 70, 42, 129, 42, 40, 42, 40, 70, 42, 70, 83,
40, 40, 96, 42, 40, 42, 69, 121, 42, 40, 42, 40, 143, 34, 141, 146,
40, 42, 42, 41, 148, 149, 146, 121, 40, 96, 42, 143, 69, 146, 121, 146,
96, 42, 41, 129, 161, 146, 141, 146, 42, 40, 143, 69, 146, 141, 141, 141,
161, 146, 146, 141, 146, 83, 223, 223, 146, 146, 146, 146, 141, 115, 223, 223,
146, 146, 141, 146, 69, 223, 223, 223, 141, 146, 146, 83, 223, 223, 223, 223,
146, 146, 161, 115, 223, 223, 223, 223, 141, 146, 69, 223, 223, 223, 236, 223,
146, 149, 236, 223, 223, 223, 223, 223, 141, 149, 223, 223, 223, 223, 223, 223,
223, 223, 69, 146, 122, 161, 141, 121, 223, 223, 48, 146, 141, 121, 146, 121,
223, 223, 83, 146, 146, 141, 48, 115, 223, 223, 141, 146, 161, 115, 238, 239,
223, 236, 141, 141, 139, 240, 239, 242, 192, 236, 141, 83, 239, 239, 239, 242,
223, 236, 149, 115, 240, 239, 242, 239, 223, 236, 83, 192, 240, 242, 242, 239,
121, 141, 141, 153, 161, 153, 122, 153, 141, 121, 121, 121, 141, 122, 122, 122,
236, 115, 48, 141, 121, 141, 122, 153, 240, 240, 241, 43, 141, 121, 122, 122,
239, 239, 239, 241, 185, 121, 141, 122, 241, 239, 239, 239, 43, 141, 121, 153,
239, 241, 239, 239, 124, 153, 141, 141, 242, 239, 239, 207, 48, 141, 121, 141,
122, 153, 122, 153, 153, 153, 153, 153, 122, 122, 153, 122, 153, 153, 153, 153,
141, 122, 122, 153, 122, 153, 153, 153, 122, 153, 122, 122, 153, 122, 153, 153,
153, 122, 122, 122, 153, 153, 153, 153, 122, 122, 153, 122, 153, 122, 141, 122,
122, 122, 122, 153, 122, 153, 153, 131, 122, 153, 122, 122, 122, 122, 131, 153,
153, 153, 153, 200, 231, 231, 231, 231, 153, 153, 153, 200, 200, 231, 231, 231,
153, 153, 153, 200, 231, 231, 215, 185, 153, 153, 200, 200, 200, 231, 231, 231,
153, 200, 200, 200, 200, 231, 200, 231, 153, 200, 200, 200, 200, 200, 231, 153,
200, 153, 200, 200, 200, 200, 200, 153, 155, 181, 200, 200, 200, 200, 200, 153,
231, 231, 231, 122, 122, 121, 153, 153, 231, 231, 122, 122, 153, 153, 153, 153,
231, 231, 231, 122, 153, 153, 153, 153, 231, 231, 200, 153, 153, 153, 153, 153,
231, 200, 122, 153, 122, 153, 153, 153, 231, 200, 153, 153, 215, 215, 200, 215,
141, 153, 122, 153, 231, 215, 215, 200, 121, 153, 153, 153, 215, 215, 200, 215,
153, 153, 126, 121, 153, 153, 146, 43, 153, 212, 153, 121, 153, 153, 121, 153,
153, 153, 153, 121, 121, 153, 153, 159, 153, 153, 153, 153, 126, 121, 153, 121,
153, 153, 153, 122, 153, 121, 153, 153, 215, 200, 215, 215, 200, 154, 121, 153,
215, 215, 200, 215, 215, 153, 121, 153, 215, 200, 215, 215, 200, 122, 159, 153,
233, 192, 83, 83, 34, 30, 30, 43, 192, 64, 115, 69, 34, 139, 139, 69,
43, 233, 139, 69, 29, 29, 129, 69, 141, 233, 192, 69, 34, 139, 139, 69,
159, 125, 233, 124, 34, 30, 29, 34, 121, 111, 233, 236, 29, 139, 30, 34,
121, 121, 191, 158, 30, 139, 30, 34, 153, 159, 124, 241, 30, 139, 30, 30,
93, 89, 15, 56, 36, 22, 21, 21, 93, 16, 86, 56, 36, 22, 21, 20,
95, 56, 15, 56, 36, 21, 22, 22, 93, 16, 62, 56, 36, 22, 21, 22,
65, 19, 86, 19, 21, 21, 22, 22, 93, 19, 8, 19, 36, 22, 21, 22,
27, 67, 62, 19, 36, 22, 22, 22, 27, 19, 8, 19, 21, 21, 22, 22,
2, 56, 16, 15, 15, 16, 15, 15, 57, 56, 15, 18, 15, 18, 15, 18,
1, 19, 15, 15, 16, 15, 16, 15, 35, 19, 16, 15, 18, 15, 18, 15,
35, 19, 15, 18, 15, 16, 15, 16, 35, 67, 16, 15, 16, 54, 16, 54,
21, 67, 15, 18, 15, 16, 15, 15, 21, 123, 16, 15, 16, 15, 54, 16,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 6, 4, 6, 118, 7, 7, 118, 4, 4, 4, 4,
118, 7, 7, 7, 6, 6, 4, 4, 7, 7, 4, 4, 4, 4, 4, 4,
58, 7, 4, 4, 4, 4, 4, 4, 7, 7, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 99, 4, 6, 6, 4, 4, 4, 4, 244,
6, 6, 6, 4, 4, 4, 4, 244, 4, 4, 6, 4, 4, 4, 227, 244,
4, 4, 4, 4, 4, 4, 244, 112, 4, 4, 4, 4, 4, 4, 244, 152,
4, 4, 4, 4, 4, 104, 244, 147, 4, 4, 4, 4, 4, 227, 244, 152,
237, 152, 4, 186, 220, 220, 224, 224, 112, 5, 4, 225, 220, 220, 220, 224,
152, 4, 69, 225, 220, 220, 224, 220, 152, 4, 69, 225, 220, 220, 220, 224,
107, 4, 38, 225, 220, 220, 220, 220, 4, 43, 69, 225, 220, 220, 220, 220,
6, 48, 38, 225, 220, 220, 220, 224, 4, 69, 69, 225, 220, 220, 224, 224,
243, 243, 189, 245, 4, 104, 104, 63, 220, 243, 189, 211, 42, 114, 47, 38,
224, 243, 225, 189, 33, 31, 31, 47, 224, 220, 220, 210, 210, 210, 210, 210,
224, 224, 217, 217, 213, 213, 209, 209, 224, 224, 217, 217, 213, 209, 213, 209,
224, 224, 217, 217, 209, 209, 209, 209, 224, 217, 217, 217, 8, 63, 162, 164,
56, 19, 56, 100, 209, 183, 209, 209, 183, 183, 209, 183, 183, 217, 176, 217,
210, 210, 217, 210, 224, 210, 224, 176, 210, 217, 176, 217, 209, 217, 217, 209,
209, 213, 213, 217, 217, 217, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209,
209, 209, 209, 209, 209, 172, 147, 147, 63, 64, 142, 64, 172, 108, 100, 170,
197, 197, 183, 183, 83, 69, 115, 69, 176, 176, 176, 183, 183, 183, 246, 246,
217, 209, 209, 246, 246, 246, 246, 246, 209, 197, 246, 246, 246, 246, 246, 113,
209, 197, 246, 246, 246, 113, 5, 127, 209, 103, 103, 5, 5, 127, 1, 95,
133, 113, 57, 57, 1, 95, 116, 134, 133, 95, 116, 140, 140, 134, 68, 1,
83, 183, 1, 1, 140, 1, 1, 1, 246, 7, 127, 95, 134, 1, 1, 1,
246, 1, 1, 116, 68, 1, 1, 1, 107, 127, 95, 134, 1, 1, 1, 1,
1, 95, 116, 68, 1, 1, 1, 1, 116, 134, 68, 1, 1, 1, 1, 1,
68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 136, 5, 4, 4, 64, 1, 1, 1, 133, 7, 4, 4, 64,
1, 1, 1, 170, 78, 4, 4, 64, 1, 1, 1, 133, 78, 4, 4, 64,
1, 1, 1, 170, 78, 4, 4, 8, 1, 1, 1, 14, 78, 4, 4, 78,
1, 1, 1, 160, 135, 4, 4, 77, 1, 1, 1, 2, 135, 4, 4, 3,
135, 4, 4, 4, 4, 3, 190, 190, 64, 4, 4, 4, 4, 5, 175, 190,
132, 4, 4, 4, 4, 5, 175, 170, 133, 4, 4, 4, 4, 4, 175, 190,
133, 58, 4, 4, 4, 4, 64, 190, 133, 135, 4, 4, 4, 4, 64, 190,
100, 8, 108, 4, 4, 4, 142, 170, 133, 86, 4, 4, 4, 4, 142, 190,
190, 190, 140, 1, 8, 221, 212, 221, 190, 68, 116, 1, 142, 221, 221, 221,
190, 134, 95, 127, 187, 221, 221, 221, 190, 140, 1, 64, 212, 221, 221, 221,
170, 140, 1, 175, 221, 212, 221, 221, 190, 140, 1, 175, 221, 221, 221, 221,
190, 140, 1, 190, 212, 221, 221, 221, 190, 140, 1, 190, 212, 221, 221, 221,
221, 221, 221, 226, 215, 215, 153, 119, 221, 221, 218, 215, 215, 218, 212, 119,
221, 221, 218, 215, 218, 154, 212, 135, 221, 221, 218, 218, 218, 212, 212, 119,
221, 221, 218, 218, 218, 212, 212, 119, 221, 221, 218, 218, 200, 212, 136, 106,
221, 221, 218, 215, 200, 212, 100, 1, 221, 218, 226, 215, 218, 212, 17, 1,
1, 140, 10, 10, 10, 52, 24, 128, 1, 140, 10, 10, 36, 52, 24, 25,
1, 140, 10, 10, 82, 87, 24, 50, 1, 140, 10, 94, 10, 52, 24, 26,
1, 140, 10, 10, 82, 87, 24, 50, 95, 134, 10, 10, 82, 52, 128, 25,
116, 68, 10, 10, 82, 87, 50, 12, 140, 35, 10, 10, 36, 87, 24, 26,
25, 24, 24, 26, 60, 83, 28, 29, 26, 50, 25, 128, 134, 83, 31, 29,
25, 26, 25, 25, 60, 69, 28, 31, 50, 25, 12, 24, 60, 69, 29, 31,
25, 26, 24, 24, 155, 69, 47, 31, 12, 74, 12, 12, 60, 69, 47, 31,
50, 24, 12, 12, 60, 176, 31, 31, 74, 74, 12, 12, 110, 69, 31, 31,
31, 31, 32, 134, 9, 114, 228, 228, 31, 32, 129, 134, 123, 214, 228, 234,
31, 31, 93, 116, 123, 39, 234, 234, 31, 32, 134, 72, 7, 114, 228, 234,
31, 31, 134, 156, 114, 228, 228, 234, 31, 32, 134, 156, 31, 228, 234, 234,
31, 31, 134, 156, 114, 228, 234, 234, 31, 31, 134, 156, 31, 228, 234, 234,
234, 234, 234, 229, 72, 27, 191, 6, 234, 234, 234, 229, 27, 125, 191, 115,
234, 234, 234, 229, 93, 27, 191, 125, 234, 234, 248, 229, 229, 93, 27, 27,
248, 234, 234, 234, 229, 229, 229, 229, 234, 248, 248, 248, 248, 229, 229, 229,
248, 248, 248, 248, 234, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 234,
127, 54, 222, 222, 228, 228, 234, 229, 123, 134, 228, 228, 228, 234, 234, 234,
93, 234, 234, 234, 234, 234, 234, 222, 229, 229, 229, 234, 234, 234, 234, 228,
229, 229, 229, 248, 234, 234, 222, 228, 229, 229, 248, 234, 234, 234, 228, 228,
248, 248, 229, 234, 234, 228, 228, 35, 248, 248, 229, 229, 234, 228, 64, 127,
228, 228, 228, 222, 216, 145, 127, 95, 234, 228, 216, 222, 83, 127, 95, 116,
228, 228, 222, 46, 127, 95, 116, 68, 228, 222, 21, 106, 95, 116, 68, 39,
222, 53, 127, 95, 116, 68, 39, 39, 65, 127, 95, 116, 68, 39, 145, 145,
127, 95, 116, 68, 83, 33, 32, 39, 95, 116, 68, 92, 149, 145, 145, 145,
116, 68, 40, 40, 105, 40, 41, 109, 68, 138, 40, 40, 40, 138, 42, 66,
105, 42, 40, 105, 40, 105, 138, 42, 84, 165, 40, 40, 105, 40, 105, 42,
109, 41, 40, 105, 40, 40, 40, 41, 84, 41, 40, 40, 40, 105, 138, 42,
85, 42, 40, 105, 40, 40, 105, 41, 84, 42, 42, 40, 105, 40, 40, 41,
34, 129, 28, 84, 85, 40, 42, 165, 109, 109, 32, 84, 178, 40, 41, 96,
41, 85, 33, 109, 84, 40, 41, 41, 41, 105, 33, 84, 178, 105, 42, 96,
165, 40, 84, 148, 178, 42, 41, 41, 41, 41, 105, 84, 178, 42, 165, 42,
42, 42, 40, 84, 178, 42, 41, 96, 42, 165, 40, 178, 105, 40, 42, 165,
96, 138, 40, 33, 39, 145, 145, 145, 41, 42, 178, 39, 32, 145, 33, 29,
42, 41, 84, 145, 145, 39, 39, 38, 41, 105, 33, 39, 145, 145, 30, 28,
41, 105, 33, 145, 145, 39, 29, 178, 138, 40, 33, 145, 32, 30, 145, 41,
41, 40, 109, 145, 145, 33, 40, 41, 41, 42, 109, 33, 33, 85, 40, 165,
38, 34, 138, 165, 42, 96, 40, 41, 38, 163, 138, 42, 40, 42, 41, 42,
33, 143, 105, 42, 41, 42, 96, 96, 41, 165, 41, 96, 165, 40, 41, 42,
165, 42, 40, 165, 41, 40, 41, 96, 42, 41, 42, 41, 40, 41, 42, 165,
138, 42, 138, 42, 41, 105, 40, 41, 42, 41, 42, 138, 42, 41, 42, 138,
42, 41, 66, 83, 141, 141, 141, 146, 42, 143, 34, 161, 197, 161, 197, 141,
41, 247, 183, 161, 161, 161, 161, 161, 42, 129, 83, 183, 161, 197, 161, 197,
41, 38, 69, 38, 83, 83, 161, 161, 84, 69, 28, 39, 183, 83, 183, 183,
30, 38, 145, 145, 38, 183, 83, 83, 30, 29, 145, 33, 30, 176, 83, 183,
146, 149, 236, 223, 223, 192, 223, 223, 141, 149, 223, 223, 223, 223, 223, 223,
146, 149, 236, 223, 223, 223, 223, 223, 161, 149, 236, 223, 223, 223, 223, 223,
161, 149, 139, 223, 223, 223, 192, 223, 83, 149, 115, 223, 223, 223, 223, 223,
83, 83, 69, 223, 223, 223, 223, 167, 176, 69, 69, 223, 167, 223, 223, 223,
223, 223, 83, 166, 238, 239, 239, 242, 223, 223, 83, 192, 239, 242, 239, 242,
223, 223, 83, 115, 240, 238, 242, 239, 223, 167, 83, 149, 242, 240, 238, 239,
223, 167, 69, 146, 83, 169, 240, 238, 223, 167, 236, 141, 121, 83, 43, 69,
167, 167, 167, 83, 141, 141, 121, 146, 223, 167, 239, 69, 141, 161, 161, 141,
239, 239, 239, 192, 185, 153, 141, 122, 239, 242, 240, 115, 161, 141, 121, 122,
239, 239, 239, 48, 122, 121, 141, 122, 240, 240, 124, 161, 141, 121, 141, 161,
242, 115, 231, 122, 121, 161, 122, 231, 48, 161, 141, 141, 141, 141, 161, 185,
146, 121, 141, 141, 161, 231, 231, 206, 141, 141, 161, 161, 122, 161, 206, 185,
153, 161, 153, 122, 153, 122, 121, 110, 122, 122, 122, 122, 122, 181, 110, 110,
122, 122, 122, 122, 122, 181, 110, 131, 122, 122, 161, 122, 149, 181, 111, 110,
231, 161, 161, 149, 111, 111, 181, 177, 185, 161, 149, 149, 149, 111, 111, 111,
206, 83, 83, 149, 83, 111, 111, 111, 186, 186, 176, 83, 83, 83, 149, 111,
181, 200, 181, 200, 200, 200, 200, 153, 181, 155, 200, 200, 200, 153, 153, 200,
181, 181, 181, 155, 153, 200, 200, 121, 110, 181, 181, 181, 200, 122, 141, 154,
110, 131, 110, 122, 121, 121, 121, 153, 181, 110, 121, 131, 121, 153, 141, 153,
181, 181, 181, 122, 122, 122, 122, 122, 181, 122, 122, 122, 122, 122, 122, 153,
121, 153, 153, 122, 200, 215, 215, 200, 121, 122, 153, 215, 215, 200, 215, 43,
154, 153, 153, 215, 200, 215, 215, 215, 122, 153, 122, 200, 215, 200, 48, 43,
122, 153, 215, 215, 215, 43, 192, 233, 153, 122, 200, 215, 200, 124, 90, 118,
122, 215, 185, 200, 215, 43, 192, 191, 231, 185, 215, 215, 185, 215, 43, 43,
185, 215, 200, 215, 215, 122, 154, 153, 43, 199, 215, 215, 200, 122, 121, 121,
215, 215, 185, 200, 215, 215, 121, 154, 37, 37, 215, 215, 215, 122, 153, 146,
43, 122, 185, 215, 200, 122, 153, 121, 192, 111, 122, 215, 215, 122, 122, 121,
43, 122, 215, 185, 200, 122, 153, 121, 122, 231, 200, 215, 231, 153, 122, 141,
122, 154, 48, 241, 139, 30, 129, 29, 153, 121, 141, 192, 174, 30, 129, 30,
122, 153, 121, 191, 174, 30, 129, 30, 121, 153, 121, 43, 174, 129, 129, 30,
121, 122, 154, 48, 166, 129, 129, 148, 121, 122, 121, 122, 139, 129, 174, 109,
121, 122, 141, 121, 139, 148, 174, 109, 121, 122, 122, 121, 69, 174, 174, 105,
27, 67, 18, 67, 20, 22, 22, 21, 27, 67, 8, 67, 20, 22, 21, 22,
125, 57, 8, 123, 20, 22, 21, 21, 125, 57, 54, 133, 82, 22, 22, 22,
125, 35, 54, 133, 20, 22, 21, 22, 125, 45, 8, 14, 20, 21, 21, 22,
191, 35, 54, 67, 20, 22, 21, 21, 191, 61, 54, 67, 20, 20, 21, 22,
22, 9, 16, 15, 18, 15, 16, 15, 22, 2, 16, 15, 15, 18, 15, 18,
22, 1, 18, 18, 16, 15, 16, 15, 22, 1, 16, 15, 15, 15, 18, 15,
22, 45, 16, 16, 18, 15, 15, 16, 22, 35, 16, 15, 16, 18, 15, 54,
22, 35, 56, 18, 15, 15, 16, 15, 22, 35, 56, 15, 16, 15, 18, 15,
6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 244, 9, 4, 4, 4, 4, 4, 4, 244, 89, 4,
4, 4, 4, 4, 6, 244, 117, 4, 4, 4, 4, 4, 6, 244, 113, 4,
4, 4, 4, 4, 4, 227, 6, 4, 4, 4, 4, 4, 104, 156, 6, 4,
4, 4, 4, 6, 162, 6, 4, 4, 4, 4, 4, 6, 162, 6, 4, 204,
4, 204, 69, 225, 225, 220, 224, 224, 198, 124, 47, 38, 210, 224, 225, 220,
198, 204, 38, 38, 176, 224, 186, 217, 204, 198, 124, 176, 210, 176, 186, 176,
198, 204, 204, 38, 176, 186, 176, 176, 204, 198, 204, 176, 213, 69, 176, 176,
204, 204, 204, 204, 183, 176, 69, 176, 204, 204, 204, 213, 213, 69, 34, 176,
224, 217, 108, 8, 6, 156, 156, 162, 217, 217, 86, 19, 72, 60, 134, 131,
183, 209, 89, 156, 134, 93, 156, 156, 209, 209, 19, 123, 134, 156, 156, 156,
209, 197, 67, 123, 134, 123, 156, 156, 209, 67, 113, 21, 60, 156, 123, 156,
183, 123, 9, 208, 93, 156, 123, 156, 43, 19, 9, 208, 68, 6, 123, 123,
164, 164, 132, 132, 132, 81, 155, 131, 110, 110, 131, 110, 131, 110, 196, 133,
162, 162, 164, 136, 136, 133, 133, 14, 162, 136, 136, 136, 136, 14, 14, 160,
156, 136, 136, 14, 14, 14, 17, 17, 123, 156, 14, 14, 17, 17, 17, 1,
17, 136, 17, 17, 17, 17, 68, 134, 17, 93, 134, 140, 140, 140, 116, 95,
140, 60, 68, 1, 1, 1, 1, 1, 133, 160, 1, 1, 1, 1, 1, 1,
17, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1,
17, 1, 1, 1, 1, 68, 134, 140, 1, 1, 68, 134, 140, 116, 95, 1,
140, 140, 116, 95, 1, 1, 127, 1, 1, 1, 1, 127, 1, 1, 1, 246,
1, 1, 1, 1, 1, 1, 1, 68, 1, 1, 1, 1, 1, 68, 134, 116,
1, 1, 1, 68, 134, 116, 95, 1, 68, 134, 140, 116, 95, 1, 127, 1,
116, 95, 1, 1, 127, 1, 1, 83, 1, 127, 1, 1, 1, 246, 209, 69,
1, 1, 246, 246, 246, 246, 115, 115, 246, 246, 246, 246, 209, 69, 176, 183,
134, 140, 134, 68, 8, 4, 4, 4, 95, 1, 95, 116, 68, 4, 4, 4,
127, 1, 127, 95, 116, 68, 4, 91, 1, 139, 1, 127, 95, 134, 4, 3,
115, 236, 236, 132, 1, 140, 1, 108, 236, 115, 1, 127, 95, 134, 4, 108,
69, 83, 1, 1, 116, 68, 4, 4, 246, 246, 1, 1, 140, 4, 4, 4,
170, 56, 4, 4, 4, 4, 135, 190, 19, 67, 3, 4, 4, 4, 135, 190,
45, 78, 4, 4, 4, 5, 64, 190, 57, 8, 108, 4, 4, 4, 142, 190,
2, 15, 108, 4, 4, 4, 142, 190, 62, 19, 135, 4, 4, 4, 135, 190,
90, 67, 90, 4, 4, 4, 135, 190, 135, 14, 8, 4, 4, 4, 5, 190,
190, 140, 1, 190, 221, 221, 221, 221, 170, 140, 1, 190, 221, 221, 221, 221,
68, 116, 1, 170, 221, 221, 221, 221, 134, 95, 127, 190, 221, 221, 221, 221,
140, 1, 190, 221, 212, 221, 221, 221, 140, 1, 6, 221, 221, 221, 221, 221,
140, 1, 190, 212, 221, 221, 221, 221, 140, 1, 190, 212, 221, 221, 221, 221,
221, 221, 226, 215, 218, 212, 1, 1, 221, 218, 226, 215, 215, 153, 35, 1,
221, 218, 215, 215, 215, 212, 120, 1, 221, 221, 226, 215, 215, 153, 45, 1,
221, 218, 226, 215, 218, 212, 45, 1, 221, 218, 215, 226, 218, 212, 10, 1,
221, 218, 218, 215, 154, 212, 99, 1, 221, 218, 218, 218, 212, 212, 10, 1,
140, 99, 10, 10, 82, 87, 12, 74, 140, 10, 99, 94, 20, 87, 74, 12,
140, 99, 10, 10, 52, 76, 76, 76, 140, 99, 94, 10, 52, 76, 76, 76,
140, 99, 10, 35, 52, 46, 76, 76, 140, 99, 94, 99, 88, 76, 76, 55,
140, 99, 10, 35, 52, 76, 55, 46, 140, 99, 94, 99, 52, 76, 182, 55,
76, 25, 76, 74, 110, 38, 31, 31, 76, 76, 76, 74, 110, 176, 31, 31,
76, 76, 46, 74, 176, 30, 31, 31, 76, 46, 46, 71, 69, 31, 39, 39,
55, 46, 182, 71, 69, 28, 39, 39, 76, 182, 87, 71, 186, 39, 39, 145,
55, 182, 182, 71, 69, 39, 39, 39, 182, 182, 52, 68, 176, 39, 145, 39,
39, 93, 60, 156, 39, 228, 234, 248, 31, 110, 79, 6, 32, 228, 234, 248,
31, 134, 156, 39, 228, 234, 234, 248, 39, 126, 136, 39, 228, 234, 234, 248,
39, 134, 14, 31, 228, 234, 234, 248, 39, 126, 14, 39, 228, 234, 234, 248,
39, 134, 14, 39, 228, 234, 234, 248, 145, 126, 14, 39, 228, 234, 234, 248,
248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248,
248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248,
248, 248, 248, 248, 248, 248, 248, 234, 248, 248, 248, 248, 248, 248, 248, 234,
248, 248, 248, 248, 248, 248, 234, 234, 248, 248, 229, 248, 248, 248, 118, 249,
248, 229, 229, 229, 229, 64, 127, 95, 248, 229, 229, 27, 27, 16, 15, 127,
234, 229, 229, 27, 191, 191, 191, 16, 234, 234, 229, 27, 125, 192, 191, 191,
234, 234, 228, 229, 27, 191, 191, 191, 234, 234, 222, 228, 134, 93, 125, 191,
234, 228, 228, 228, 228, 228, 68, 27, 222, 228, 228, 228, 228, 228, 228, 134,
116, 68, 36, 92, 83, 145, 145, 39, 95, 116, 134, 68, 83, 145, 32, 39,
127, 1, 95, 116, 134, 68, 39, 33, 56, 20, 127, 1, 95, 116, 68, 33,
125, 124, 22, 121, 127, 95, 116, 134, 191, 125, 125, 124, 69, 127, 1, 95,
125, 191, 125, 125, 125, 39, 39, 127, 93, 125, 191, 191, 125, 125, 124, 33,
84, 165, 40, 105, 40, 40, 40, 96, 109, 42, 40, 40, 40, 105, 40, 41,
84, 96, 40, 40, 40, 40, 40, 41, 84, 96, 40, 40, 40, 40, 40, 41,
68, 96, 40, 40, 40, 40, 40, 41, 116, 134, 68, 40, 40, 40, 40, 41,
1, 95, 116, 68, 40, 40, 40, 41, 33, 127, 95, 116, 134, 68, 40, 41,
138, 41, 40, 85, 40, 42, 41, 42, 42, 165, 138, 40, 40, 138, 96, 41,
42, 41, 138, 40, 40, 41, 41, 41, 42, 41, 41, 40, 40, 41, 41, 41,
42, 41, 41, 40, 40, 41, 41, 41, 42, 41, 41, 42, 41, 41, 41, 41,
42, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 40, 41, 40, 105, 40, 41, 41, 96, 41, 42, 96, 41, 41, 42, 165,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
42, 41, 40, 41, 42, 165, 42, 105, 40, 41, 42, 41, 40, 42, 42, 105,
42, 41, 41, 41, 41, 40, 96, 40, 41, 41, 41, 41, 41, 40, 42, 40,
41, 41, 41, 41, 41, 42, 42, 40, 41, 41, 41, 41, 42, 41, 41, 40,
41, 41, 41, 42, 42, 165, 41, 40, 41, 41, 41, 41, 41, 41, 42, 40,
33, 33, 145, 33, 39, 176, 176, 83, 84, 33, 145, 33, 145, 34, 176, 176,
33, 33, 33, 33, 33, 145, 176, 176, 33, 33, 32, 33, 33, 145, 38, 176,
33, 33, 33, 33, 33, 33, 38, 176, 33, 163, 109, 109, 84, 109, 38, 176,
33, 40, 85, 84, 84, 109, 34, 176, 40, 40, 178, 40, 178, 84, 28, 38,
176, 115, 69, 223, 223, 192, 167, 166, 176, 236, 69, 223, 166, 223, 167, 167,
69, 223, 69, 174, 167, 167, 223, 167, 34, 223, 236, 223, 167, 167, 169, 167,
28, 171, 223, 223, 166, 167, 167, 167, 145, 66, 223, 166, 167, 169, 169, 167,
32, 109, 167, 166, 167, 167, 167, 166, 145, 109, 169, 167, 167, 169, 167, 242,
167, 167, 167, 236, 141, 161, 161, 231, 167, 167, 241, 242, 83, 141, 161, 161,
169, 167, 167, 239, 115, 141, 161, 161, 167, 167, 167, 242, 223, 149, 141, 161,
167, 241, 242, 242, 239, 83, 141, 161, 169, 242, 166, 242, 238, 236, 141, 161,
242, 242, 242, 242, 242, 242, 149, 141, 167, 242, 167, 242, 242, 238, 115, 141,
141, 141, 161, 161, 231, 185, 206, 206, 141, 141, 161, 161, 231, 206, 206, 186,
161, 141, 141, 231, 215, 206, 206, 186, 161, 141, 161, 231, 231, 215, 195, 195,
161, 141, 141, 231, 185, 206, 206, 195, 161, 231, 122, 122, 215, 226, 226, 195,
231, 231, 111, 181, 215, 226, 195, 195, 161, 111, 37, 37, 68, 226, 226, 226,
186, 186, 225, 186, 83, 83, 149, 111, 243, 186, 225, 186, 176, 176, 83, 149,
243, 243, 243, 225, 186, 186, 83, 206, 243, 243, 243, 225, 186, 186, 206, 206,
243, 243, 189, 243, 28, 186, 185, 83, 195, 189, 243, 243, 189, 195, 69, 43,
195, 189, 195, 186, 189, 195, 199, 199, 195, 195, 186, 199, 195, 139, 199, 199,
122, 122, 122, 122, 122, 122, 122, 231, 122, 122, 122, 122, 122, 231, 215, 215,
185, 185, 185, 231, 231, 215, 185, 231, 185, 185, 185, 185, 185, 185, 215, 185,
185, 185, 185, 215, 185, 185, 43, 199, 43, 43, 43, 43, 199, 199, 199, 199,
199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199,
215, 215, 200, 185, 43, 185, 185, 215, 185, 231, 185, 43, 199, 199, 226, 185,
215, 185, 43, 199, 199, 199, 199, 185, 185, 199, 199, 199, 199, 199, 43, 185,
199, 199, 199, 199, 199, 215, 215, 215, 199, 199, 199, 199, 43, 185, 161, 121,
199, 199, 199, 185, 122, 141, 121, 141, 199, 43, 111, 141, 141, 141, 122, 161,
43, 185, 215, 215, 141, 122, 122, 141, 215, 215, 185, 231, 122, 122, 141, 121,
185, 200, 215, 231, 141, 121, 121, 141, 185, 185, 161, 121, 121, 141, 153, 231,
122, 121, 121, 141, 161, 122, 161, 141, 141, 141, 122, 161, 161, 153, 121, 121,
122, 161, 161, 122, 121, 121, 149, 69, 161, 141, 121, 121, 83, 115, 171, 143,
141, 153, 122, 121, 124, 96, 249, 66, 121, 122, 122, 121, 69, 96, 66, 96,
122, 161, 122, 141, 43, 169, 66, 158, 122, 153, 141, 121, 43, 96, 66, 158,
141, 121, 161, 83, 139, 96, 96, 96, 231, 69, 174, 207, 96, 130, 96, 105,
169, 97, 96, 96, 105, 96, 130, 105, 96, 105, 66, 96, 130, 96, 96, 42,
192, 61, 18, 14, 22, 21, 21, 22, 192, 61, 18, 123, 20, 22, 21, 22,
174, 61, 16, 19, 20, 21, 22, 22, 174, 61, 56, 67, 20, 20, 20, 23,
236, 65, 56, 19, 36, 22, 21, 52, 174, 21, 16, 19, 36, 21, 36, 52,
174, 61, 56, 56, 36, 22, 36, 95, 174, 21, 56, 132, 36, 20, 21, 52,
22, 35, 16, 18, 15, 18, 15, 16, 22, 35, 16, 16, 15, 15, 16, 54,
23, 35, 56, 54, 16, 18, 15, 15, 87, 35, 56, 16, 15, 15, 15, 16,
49, 35, 16, 15, 18, 16, 18, 15, 13, 35, 16, 15, 15, 15, 15, 18,
13, 94, 18, 18, 15, 18, 16, 15, 116, 72, 18, 15, 15, 16, 15, 15,
4, 4, 4, 4, 162, 104, 4, 204, 4, 4, 4, 6, 227, 4, 4, 204,
4, 4, 4, 6, 227, 4, 104, 204, 4, 4, 4, 6, 162, 104, 4, 104,
4, 4, 4, 4, 239, 227, 6, 4, 4, 4, 4, 6, 6, 198, 7, 4,
4, 4, 4, 4, 6, 93, 164, 4, 4, 4, 4, 4, 4, 198, 92, 1,
204, 204, 204, 213, 219, 204, 38, 115, 204, 219, 213, 213, 213, 176, 34, 125,
177, 204, 213, 219, 213, 183, 115, 214, 219, 219, 219, 213, 213, 213, 204, 115,
219, 219, 219, 209, 209, 209, 209, 176, 219, 197, 209, 219, 209, 209, 219, 209,
7, 197, 197, 246, 219, 209, 209, 209, 5, 107, 246, 246, 246, 209, 209, 219,
115, 156, 113, 65, 134, 134, 140, 134, 236, 236, 19, 9, 9, 9, 123, 17,
192, 223, 19, 123, 123, 9, 9, 17, 192, 223, 236, 115, 69, 83, 183, 246,
115, 236, 236, 34, 69, 176, 176, 176, 219, 183, 115, 176, 115, 69, 204, 176,
209, 219, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, 209,
140, 134, 79, 17, 17, 1, 1, 127, 123, 17, 113, 17, 1, 1, 1, 1,
17, 17, 17, 246, 246, 246, 246, 246, 246, 246, 246, 246, 209, 209, 183, 183,
183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 209, 209, 209, 209, 209,
209, 209, 209, 209, 209, 209, 209, 209, 246, 209, 246, 246, 246, 246, 246, 246,
1, 17, 17, 17, 246, 246, 246, 246, 246, 246, 246, 246, 246, 209, 209, 209,
246, 209, 209, 209, 183, 183, 197, 209, 183, 183, 183, 209, 209, 209, 209, 209,
209, 209, 209, 209, 246, 209, 209, 246, 209, 209, 209, 209, 246, 246, 246, 246,
246, 246, 246, 246, 246, 17, 17, 17, 246, 1, 1, 17, 17, 127, 1, 1,
209, 209, 209, 183, 183, 246, 246, 246, 183, 183, 209, 209, 246, 246, 246, 246,
209, 246, 209, 246, 246, 246, 246, 5, 209, 246, 246, 246, 246, 5, 5, 127,
246, 246, 246, 7, 17, 127, 1, 95, 17, 17, 17, 127, 1, 95, 116, 134,
127, 1, 1, 95, 116, 134, 68, 1, 95, 116, 140, 134, 68, 1, 17, 17,
246, 5, 127, 95, 134, 4, 4, 4, 5, 127, 95, 116, 68, 4, 4, 4,
127, 95, 116, 68, 16, 4, 4, 4, 95, 116, 68, 1, 132, 4, 4, 4,
116, 68, 17, 1, 132, 4, 4, 4, 68, 17, 1, 1, 132, 4, 4, 4,
17, 1, 17, 17, 100, 4, 4, 4, 1, 17, 17, 17, 14, 4, 4, 4,
3, 67, 8, 4, 4, 4, 4, 190, 108, 170, 64, 4, 4, 4, 4, 190,
3, 170, 64, 78, 4, 4, 4, 190, 4, 190, 142, 8, 193, 4, 4, 175,
4, 64, 80, 16, 173, 4, 4, 64, 4, 64, 190, 62, 135, 4, 4, 142,
4, 8, 132, 62, 135, 4, 4, 142, 4, 4, 175, 8, 8, 4, 4, 135,
140, 1, 190, 221, 221, 221, 221, 221, 140, 1, 190, 212, 221, 221, 221, 221,
140, 1, 190, 221, 221, 221, 221, 221, 140, 1, 190, 212, 221, 221, 221, 221,
140, 1, 170, 221, 221, 221, 221, 221, 140, 1, 160, 212, 221, 221, 221, 221,
140, 1, 45, 212, 221, 221, 221, 221, 140, 1, 10, 212, 221, 212, 221, 212,
221, 218, 218, 218, 212, 212, 94, 57, 221, 218, 218, 218, 150, 52, 127, 95,
218, 218, 215, 218, 212, 52, 57, 116, 221, 226, 215, 153, 212, 46, 1, 140,
221, 221, 218, 212, 212, 59, 57, 140, 221, 221, 212, 212, 212, 59, 57, 140,
221, 212, 212, 212, 212, 87, 57, 140, 212, 212, 212, 212, 212, 59, 112, 140,
140, 99, 99, 99, 52, 182, 55, 182, 134, 99, 94, 99, 52, 182, 182, 55,
68, 99, 99, 99, 52, 182, 182, 182, 168, 168, 99, 205, 250, 182, 55, 182,
168, 235, 99, 168, 52, 55, 182, 182, 168, 168, 99, 205, 250, 55, 182, 182,
168, 168, 168, 168, 182, 55, 182, 55, 168, 235, 168, 168, 250, 55, 51, 55,
182, 182, 52, 182, 185, 28, 145, 39, 182, 182, 95, 68, 141, 176, 145, 145,
182, 182, 182, 68, 146, 83, 145, 145, 182, 182, 182, 68, 121, 183, 186, 39,
55, 182, 182, 182, 121, 83, 83, 38, 182, 182, 182, 182, 121, 200, 176, 149,
182, 182, 182, 182, 121, 71, 183, 176, 51, 55, 55, 101, 154, 110, 92, 83,
32, 134, 14, 30, 228, 234, 234, 248, 133, 126, 2, 29, 228, 234, 234, 248,
93, 116, 14, 149, 234, 234, 234, 248, 60, 79, 113, 129, 222, 234, 248, 248,
140, 160, 30, 228, 234, 234, 234, 248, 131, 2, 32, 228, 228, 234, 234, 234,
140, 2, 30, 228, 228, 222, 234, 234, 140, 2, 30, 228, 228, 228, 228, 228,
248, 248, 229, 248, 248, 234, 34, 127, 248, 248, 229, 229, 234, 234, 96, 1,
248, 229, 229, 229, 234, 228, 96, 1, 234, 248, 229, 229, 228, 228, 96, 1,
234, 234, 234, 228, 228, 216, 96, 1, 234, 234, 222, 222, 222, 222, 96, 1,
234, 228, 228, 222, 222, 96, 127, 95, 222, 222, 222, 216, 216, 96, 1, 116,
97, 228, 228, 222, 228, 228, 228, 228, 127, 40, 178, 228, 222, 228, 228, 228,
95, 1, 127, 105, 222, 228, 216, 228, 140, 116, 95, 127, 85, 84, 228, 228,
140, 68, 116, 95, 1, 127, 108, 222, 140, 42, 68, 134, 116, 95, 127, 27,
134, 42, 42, 42, 68, 116, 95, 127, 68, 42, 96, 42, 40, 68, 116, 95,
228, 229, 27, 125, 191, 125, 125, 125, 228, 228, 228, 93, 27, 191, 191, 191,
228, 228, 228, 228, 229, 93, 125, 191, 228, 228, 228, 228, 228, 134, 68, 27,
228, 228, 222, 228, 228, 228, 228, 134, 222, 228, 228, 228, 228, 228, 228, 228,
144, 15, 222, 228, 228, 228, 222, 222, 1, 127, 62, 216, 222, 222, 216, 222,
125, 42, 127, 1, 95, 116, 68, 41, 125, 125, 40, 40, 127, 95, 116, 68,
192, 191, 191, 125, 40, 127, 95, 134, 191, 125, 27, 93, 48, 40, 1, 140,
73, 110, 134, 126, 40, 127, 95, 134, 222, 216, 216, 216, 40, 1, 116, 68,
222, 216, 216, 40, 127, 95, 134, 42, 216, 216, 40, 127, 95, 116, 68, 42,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 138, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
40, 40, 40, 40, 40, 40, 145, 38, 41, 138, 40, 41, 40, 40, 33, 29,
41, 42, 40, 41, 40, 40, 84, 39, 41, 41, 138, 41, 40, 138, 109, 145,
41, 41, 41, 41, 105, 41, 33, 33, 41, 41, 41, 138, 42, 41, 33, 33,
41, 41, 41, 41, 42, 41, 84, 33, 41, 41, 41, 41, 138, 41, 40, 84,
33, 109, 66, 167, 167, 166, 242, 169, 84, 84, 33, 169, 167, 169, 242, 242,
84, 109, 33, 166, 241, 169, 242, 169, 178, 105, 84, 130, 169, 242, 167, 242,
178, 105, 178, 84, 169, 242, 242, 242, 40, 96, 40, 178, 96, 242, 242, 242,
40, 96, 40, 178, 105, 207, 242, 242, 40, 40, 138, 40, 40, 207, 202, 242,
242, 242, 242, 242, 242, 242, 240, 43, 167, 242, 242, 169, 238, 242, 104, 223,
242, 242, 242, 242, 242, 240, 240, 104, 242, 242, 238, 242, 240, 240, 104, 6,
242, 242, 242, 240, 240, 193, 6, 6, 242, 240, 240, 240, 184, 6, 4, 4,
240, 238, 184, 108, 4, 4, 4, 4, 240, 240, 108, 108, 4, 4, 4, 4,
141, 111, 37, 37, 37, 226, 226, 226, 111, 111, 68, 68, 68, 68, 226, 226,
204, 177, 68, 93, 93, 92, 68, 215, 104, 177, 198, 93, 93, 68, 37, 37,
104, 125, 177, 198, 68, 37, 181, 181, 4, 104, 198, 177, 93, 48, 177, 122,
4, 6, 104, 177, 48, 111, 111, 149, 4, 4, 6, 223, 177, 111, 149, 161,
226, 206, 206, 206, 206, 199, 199, 199, 226, 226, 206, 206, 206, 185, 206, 43,
215, 215, 185, 215, 185, 185, 185, 185, 111, 231, 231, 231, 231, 185, 185, 231,
231, 231, 161, 161, 161, 161, 161, 141, 122, 231, 231, 161, 161, 141, 141, 121,
141, 161, 161, 141, 141, 141, 161, 161, 141, 141, 141, 141, 161, 161, 161, 161,
199, 199, 199, 199, 199, 199, 199, 185, 43, 43, 43, 43, 43, 231, 161, 141,
185, 185, 185, 231, 161, 141, 121, 161, 185, 231, 161, 141, 141, 161, 161, 161,
141, 121, 141, 161, 161, 161, 161, 121, 141, 161, 161, 161, 161, 121, 141, 83,
161, 231, 161, 141, 141, 83, 139, 97, 161, 141, 141, 83, 34, 66, 42, 42,
141, 121, 121, 141, 161, 231, 161, 141, 121, 161, 161, 231, 122, 121, 141, 149,
161, 161, 161, 141, 121, 83, 34, 96, 161, 141, 141, 83, 34, 105, 207, 42,
141, 83, 139, 42, 143, 42, 70, 40, 139, 42, 42, 42, 70, 130, 70, 130,
97, 42, 70, 70, 66, 40, 70, 70, 70, 66, 70, 70, 70, 70, 70, 66,
121, 141, 43, 236, 138, 41, 42, 66, 69, 174, 42, 40, 70, 130, 96, 96,
143, 42, 70, 130, 42, 130, 40, 32, 40, 70, 96, 70, 130, 158, 32, 47,
130, 130, 70, 42, 96, 84, 47, 32, 96, 105, 70, 105, 130, 31, 31, 96,
70, 70, 130, 40, 33, 47, 203, 42, 70, 70, 130, 114, 31, 32, 42, 70,
96, 130, 105, 96, 105, 96, 66, 42, 130, 130, 96, 130, 96, 96, 105, 40,
70, 96, 42, 105, 96, 130, 105, 96, 70, 96, 105, 130, 96, 40, 40, 40,
105, 40, 70, 40, 42, 40, 42, 42, 42, 42, 130, 40, 70, 96, 105, 41,
66, 84, 105, 40, 40, 40, 40, 148, 32, 32, 40, 70, 40, 42, 32, 38,
174, 21, 19, 56, 36, 22, 21, 52, 174, 35, 56, 56, 21, 22, 36, 52,
249, 144, 19, 56, 36, 22, 36, 23, 174, 65, 19, 56, 36, 22, 21, 52,
129, 75, 56, 16, 36, 22, 21, 88, 148, 23, 19, 56, 36, 22, 36, 52,
129, 95, 56, 16, 36, 21, 21, 23, 139, 23, 56, 63, 36, 22, 21, 11,
116, 21, 18, 15, 18, 15, 18, 15, 116, 72, 18, 16, 15, 16, 15, 18,
116, 79, 18, 54, 16, 54, 16, 15, 13, 65, 18, 16, 15, 16, 15, 15,
13, 79, 18, 15, 18, 15, 16, 16, 116, 79, 89, 15, 15, 18, 15, 54,
73, 95, 18, 18, 16, 15, 16, 15, 155, 95, 18, 15, 15, 15, 18, 15,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 6, 6,
4, 4, 4, 4, 6, 4, 6, 6, 4, 4, 4, 4, 6, 6, 4, 6,
4, 4, 4, 4, 6, 6, 4, 6, 4, 4, 4, 4, 6, 6, 6, 4,
5, 5, 107, 107, 107, 107, 27, 13, 107, 91, 127, 127, 127, 86, 127, 68,
91, 86, 86, 86, 86, 86, 86, 117, 91, 86, 86, 18, 89, 89, 100, 80,
91, 8, 62, 16, 56, 56, 100, 147, 7, 86, 62, 80, 56, 147, 67, 67,
5, 8, 86, 62, 100, 100, 100, 100, 4, 91, 127, 62, 147, 100, 133, 133,
144, 113, 107, 197, 197, 246, 197, 246, 116, 75, 127, 90, 127, 18, 18, 246,
196, 116, 75, 112, 112, 9, 127, 19, 56, 147, 155, 140, 140, 116, 53, 9,
100, 100, 100, 152, 56, 68, 60, 140, 152, 67, 67, 67, 67, 112, 123, 123,
67, 152, 67, 67, 67, 67, 67, 2, 133, 103, 103, 112, 103, 2, 2, 2,
246, 246, 246, 246, 246, 246, 246, 246, 246, 246, 246, 246, 246, 246, 1, 1,
19, 19, 123, 123, 2, 2, 127, 1, 9, 9, 9, 17, 1, 1, 95, 116,
140, 140, 140, 140, 140, 140, 134, 68, 14, 2, 2, 17, 1, 17, 1, 17,
2, 2, 2, 17, 17, 1, 17, 1, 1, 17, 17, 17, 1, 1, 17, 1,
246, 246, 246, 246, 246, 1, 1, 1, 17, 1, 1, 17, 1, 127, 1, 1,
1, 1, 1, 1, 1, 95, 116, 140, 140, 140, 140, 140, 140, 134, 68, 17,
17, 1, 17, 1, 17, 1, 1, 1, 1, 17, 1, 17, 1, 17, 17, 17,
17, 1, 17, 1, 17, 1, 1, 1, 17, 1, 17, 1, 17, 1, 17, 17,
1, 127, 1, 1, 1, 95, 116, 140, 1, 95, 116, 140, 140, 134, 68, 17,
140, 134, 68, 17, 17, 1, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17,
1, 17, 17, 1, 17, 2, 17, 57, 1, 2, 17, 2, 1, 17, 1, 17,
17, 1, 17, 1, 17, 1, 17, 2, 1, 17, 1, 17, 17, 17, 57, 17,
134, 68, 17, 1, 17, 17, 1, 17, 1, 17, 17, 17, 1, 2, 17, 57,
17, 57, 17, 57, 17, 1, 17, 17, 2, 17, 1, 17, 17, 17, 17, 1,
17, 1, 17, 1, 17, 1, 2, 17, 1, 2, 17, 2, 1, 17, 1, 17,
17, 1, 17, 1, 17, 17, 17, 1, 1, 17, 1, 17, 1, 2, 1, 2,
17, 57, 17, 1, 160, 4, 4, 4, 17, 17, 1, 1, 17, 4, 4, 4,
1, 2, 17, 1, 1, 4, 4, 4, 17, 17, 1, 17, 1, 78, 4, 4,
2, 1, 17, 17, 1, 142, 4, 4, 1, 17, 17, 1, 1, 8, 4, 4,
2, 17, 1, 17, 17, 62, 78, 4, 1, 17, 1, 17, 1, 15, 173, 4,
4, 4, 64, 8, 142, 4, 4, 107, 4, 4, 78, 62, 15, 4, 4, 4,
4, 4, 4, 132, 15, 5, 4, 4, 4, 4, 4, 100, 16, 78, 4, 4,
4, 4, 4, 120, 56, 135, 4, 4, 4, 4, 108, 160, 45, 8, 107, 4,
4, 4, 108, 14, 72, 62, 58, 4, 4, 4, 4, 142, 94, 132, 135, 5,
140, 1, 45, 212, 212, 212, 212, 212, 134, 95, 127, 250, 190, 190, 190, 190,
68, 116, 95, 1, 1, 57, 1, 57, 142, 68, 134, 140, 140, 140, 140, 140,
135, 132, 100, 94, 45, 132, 190, 132, 4, 64, 175, 120, 250, 170, 132, 100,
4, 64, 132, 103, 180, 57, 100, 132, 4, 142, 175, 133, 180, 11, 100, 100,
212, 212, 212, 150, 212, 7, 9, 116, 120, 10, 99, 5, 6, 127, 75, 60,
57, 1, 9, 9, 9, 75, 116, 182, 140, 140, 140, 140, 116, 60, 95, 11,
133, 57, 10, 168, 112, 237, 244, 55, 100, 67, 10, 168, 112, 99, 237, 55,
19, 67, 168, 168, 112, 168, 244, 244, 19, 67, 99, 99, 99, 9, 237, 244,
168, 168, 168, 205, 250, 55, 55, 55, 168, 168, 168, 168, 250, 55, 51, 55,
168, 168, 168, 168, 250, 55, 55, 51, 168, 168, 168, 168, 250, 55, 180, 180,
168, 168, 168, 168, 94, 180, 180, 180, 168, 168, 168, 168, 10, 55, 180, 51,
168, 168, 168, 168, 10, 55, 180, 51, 168, 168, 168, 168, 10, 55, 180, 180,
182, 180, 182, 101, 121, 201, 180, 149, 51, 51, 180, 101, 154, 116, 101, 25,
55, 51, 180, 101, 146, 60, 101, 26, 180, 51, 180, 51, 126, 131, 25, 24,
180, 51, 51, 25, 126, 131, 25, 24, 180, 51, 25, 25, 116, 134, 25, 26,
180, 51, 25, 180, 116, 131, 50, 25, 180, 25, 25, 25, 73, 134, 26, 25,
131, 95, 127, 30, 228, 228, 228, 222, 68, 116, 95, 127, 30, 30, 139, 30,
83, 68, 116, 95, 1, 1, 1, 1, 92, 83, 68, 134, 140, 140, 140, 140,
26, 149, 176, 139, 30, 30, 30, 30, 50, 25, 83, 69, 139, 139, 30, 30,
25, 26, 197, 83, 29, 139, 129, 30, 50, 12, 98, 161, 34, 139, 139, 139,
222, 222, 216, 216, 216, 66, 1, 140, 158, 158, 66, 130, 158, 127, 95, 134,
1, 1, 1, 1, 1, 95, 116, 68, 140, 140, 140, 140, 140, 134, 68, 32,
174, 166, 166, 166, 166, 129, 129, 30, 174, 158, 174, 148, 30, 34, 38, 38,
174, 166, 139, 34, 38, 176, 69, 34, 34, 69, 38, 34, 129, 105, 166, 174,
96, 96, 42, 42, 40, 42, 68, 134, 32, 33, 66, 70, 42, 42, 40, 105,
32, 39, 32, 40, 42, 105, 42, 40, 129, 32, 32, 32, 33, 42, 42, 40,
39, 32, 39, 32, 32, 70, 40, 96, 38, 34, 29, 109, 96, 42, 42, 40,
34, 66, 105, 66, 130, 42, 143, 97, 66, 130, 97, 171, 139, 83, 149, 121,
116, 95, 127, 68, 149, 222, 222, 222, 68, 116, 95, 1, 127, 39, 222, 39,
70, 68, 134, 116, 95, 127, 39, 127, 70, 70, 30, 68, 116, 95, 1, 95,
40, 70, 33, 10, 68, 134, 140, 134, 42, 70, 33, 125, 95, 33, 39, 33,
40, 42, 40, 33, 125, 33, 39, 33, 146, 146, 141, 83, 149, 69, 29, 39,
216, 40, 127, 95, 116, 68, 40, 42, 84, 127, 95, 116, 68, 40, 40, 42,
1, 95, 116, 68, 40, 40, 40, 42, 116, 134, 68, 42, 42, 42, 42, 42,
68, 96, 42, 42, 42, 42, 42, 42, 84, 41, 42, 42, 42, 42, 41, 42,
109, 105, 42, 42, 42, 42, 42, 42, 109, 42, 42, 42, 42, 42, 42, 42,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 138, 178, 41, 41, 41, 41, 41, 41, 138, 138,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
40, 40, 41, 105, 40, 42, 143, 242, 40, 40, 138, 96, 42, 40, 207, 240,
138, 138, 138, 138, 138, 40, 143, 238, 41, 41, 41, 138, 42, 138, 97, 240,
41, 41, 41, 41, 138, 42, 143, 242, 41, 41, 41, 41, 169, 143, 242, 240,
41, 41, 41, 40, 143, 238, 239, 104, 41, 41, 41, 202, 242, 238, 104, 104,
240, 108, 4, 4, 4, 4, 4, 4, 184, 4, 4, 4, 4, 4, 4, 4,
193, 4, 4, 4, 4, 4, 4, 4, 193, 4, 4, 4, 4, 4, 4, 4,
104, 4, 4, 4, 4, 4, 4, 4, 104, 6, 4, 4, 4, 4, 4, 4,
104, 104, 4, 4, 4, 4, 4, 4, 104, 6, 6, 4, 4, 4, 4, 4,
4, 4, 4, 6, 115, 149, 149, 231, 4, 4, 4, 4, 104, 83, 141, 231,
4, 4, 4, 4, 4, 241, 149, 141, 4, 4, 4, 4, 4, 6, 158, 185,
4, 4, 4, 4, 108, 184, 108, 174, 4, 4, 4, 4, 184, 240, 245, 202,
4, 4, 4, 108, 184, 238, 97, 40, 4, 4, 108, 251, 202, 41, 41, 40,
161, 141, 161, 161, 161, 161, 161, 141, 231, 161, 231, 161, 161, 121, 141, 83,
161, 161, 161, 141, 231, 83, 34, 41, 141, 161, 231, 69, 129, 42, 97, 40,
83, 69, 129, 40, 138, 70, 70, 66, 249, 40, 41, 105, 40, 84, 70, 84,
41, 42, 70, 40, 66, 70, 66, 114, 40, 105, 40, 70, 66, 70, 114, 148,
161, 69, 129, 42, 42, 42, 70, 70, 148, 40, 42, 70, 130, 70, 70, 66,
42, 70, 70, 70, 70, 66, 70, 148, 70, 70, 66, 114, 66, 84, 203, 31,
66, 70, 109, 114, 114, 114, 32, 31, 114, 114, 114, 114, 114, 114, 31, 32,
114, 148, 114, 148, 114, 31, 47, 148, 114, 114, 114, 114, 39, 47, 32, 148,
66, 70, 70, 66, 70, 70, 66, 70, 70, 70, 66, 70, 70, 70, 70, 203,
31, 114, 84, 148, 114, 114, 66, 70, 31, 66, 114, 31, 31, 109, 114, 148,
114, 114, 32, 47, 32, 109, 114, 70, 114, 148, 31, 47, 148, 114, 148, 114,
148, 33, 47, 39, 114, 114, 109, 31, 114, 31, 28, 114, 114, 148, 114, 47,
84, 70, 70, 32, 31, 66, 40, 114, 66, 70, 114, 47, 32, 70, 40, 32,
70, 70, 31, 31, 105, 70, 84, 47, 70, 32, 47, 114, 70, 70, 32, 31,
114, 47, 31, 66, 66, 84, 31, 39, 31, 47, 84, 203, 84, 33, 47, 114,
47, 114, 109, 114, 66, 31, 31, 84, 31, 114, 114, 66, 33, 31, 33, 66,
47, 148, 42, 70, 40, 40, 47, 31, 31, 105, 130, 40, 96, 32, 47, 42,
32, 42, 70, 105, 33, 47, 148, 41, 84, 105, 40, 70, 31, 32, 138, 41,
105, 70, 40, 39, 31, 40, 40, 42, 66, 70, 114, 31, 114, 40, 40, 41,
70, 70, 32, 114, 40, 40, 40, 138, 70, 114, 33, 66, 70, 40, 40, 138,
139, 52, 56, 56, 36, 21, 82, 95, 139, 95, 16, 16, 36, 22, 36, 52,
139, 52, 56, 56, 36, 22, 21, 46, 139, 52, 56, 16, 35, 22, 21, 52,
129, 88, 56, 16, 21, 22, 82, 46, 139, 52, 56, 16, 36, 20, 82, 71,
139, 53, 89, 56, 36, 22, 20, 71, 115, 65, 86, 100, 36, 82, 21, 73,
110, 95, 16, 18, 15, 18, 15, 16, 122, 95, 56, 15, 16, 15, 16, 54,
111, 79, 56, 18, 15, 18, 15, 15, 83, 27, 19, 15, 16, 16, 15, 16,
83, 125, 19, 86, 15, 16, 15, 16, 69, 125, 2, 16, 54, 16, 54, 15,
69, 191, 2, 15, 16, 15, 16, 15, 38, 191, 2, 54, 18, 15, 18, 15,
4, 4, 4, 4, 6, 4, 6, 4, 4, 4, 4, 4, 6, 6, 6, 7,
4, 4, 4, 4, 6, 6, 7, 91, 4, 4, 4, 4, 6, 6, 7, 91,
4, 4, 4, 4, 6, 6, 91, 8, 4, 4, 4, 4, 6, 91, 8, 18,
4, 4, 4, 4, 7, 91, 8, 15, 4, 4, 4, 4, 6, 91, 8, 15,
5, 91, 62, 62, 56, 56, 152, 133, 58, 127, 62, 80, 56, 100, 100, 133,
91, 86, 80, 80, 80, 100, 133, 133, 8, 16, 80, 80, 56, 100, 133, 133,
54, 16, 56, 56, 100, 100, 133, 133, 15, 100, 56, 100, 100, 133, 133, 103,
16, 56, 133, 100, 133, 133, 133, 14, 56, 19, 100, 133, 133, 133, 14, 2,
103, 103, 2, 2, 57, 2, 1, 1, 103, 57, 103, 57, 2, 57, 17, 1,
103, 2, 57, 2, 57, 17, 1, 17, 2, 2, 2, 57, 2, 1, 17, 1,
2, 57, 57, 2, 1, 17, 1, 17, 2, 2, 17, 1, 17, 57, 17, 1,
2, 17, 1, 2, 1, 17, 1, 17, 2, 17, 1, 17, 1, 17, 1, 17,
17, 1, 1, 1, 17, 17, 1, 17, 17, 1, 17, 17, 1, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17,
1, 17, 1, 17, 1, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17,
17, 1, 2, 1, 2, 1, 17, 1, 17, 17, 1, 17, 1, 17, 17, 2,
1, 1, 17, 17, 17, 57, 17, 1, 17, 17, 57, 17, 57, 17, 1, 17,
1, 2, 17, 1, 17, 17, 17, 1, 17, 1, 17, 17, 1, 2, 1, 17,
1, 2, 1, 2, 17, 1, 17, 1, 1, 17, 17, 17, 1, 17, 17, 2,
17, 17, 2, 1, 2, 1, 17, 17, 1, 17, 1, 17, 17, 17, 1, 17,
17, 1, 17, 1, 2, 1, 2, 1, 1, 2, 17, 2, 1, 17, 17, 17,
2, 1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 2, 17, 57, 17,
2, 1, 2, 1, 17, 1, 17, 17, 1, 17, 17, 17, 1, 17, 17, 1,
17, 1, 17, 57, 17, 56, 142, 4, 57, 17, 1, 17, 1, 100, 91, 4,
17, 17, 1, 1, 17, 133, 91, 4, 1, 17, 1, 17, 1, 1, 8, 4,
17, 57, 1, 17, 1, 1, 64, 4, 17, 17, 1, 17, 17, 1, 64, 4,
1, 17, 1, 17, 1, 1, 160, 4, 17, 57, 17, 1, 17, 1, 17, 4,
4, 4, 4, 78, 160, 100, 8, 4, 4, 4, 4, 4, 170, 57, 16, 4,
4, 4, 4, 4, 64, 99, 56, 4, 4, 4, 4, 4, 4, 180, 9, 58,
4, 4, 4, 4, 4, 180, 99, 173, 4, 4, 4, 4, 4, 11, 94, 173,
4, 4, 4, 4, 4, 75, 11, 54, 4, 4, 4, 4, 5, 45, 180, 132,
4, 135, 190, 136, 26, 180, 16, 100, 4, 4, 190, 132, 180, 180, 67, 56,
4, 4, 132, 56, 180, 180, 9, 18, 4, 4, 56, 16, 180, 244, 237, 19,
4, 4, 63, 132, 237, 180, 244, 9, 4, 4, 54, 132, 11, 180, 180, 9,
4, 4, 86, 63, 10, 244, 244, 244, 7, 4, 58, 54, 35, 244, 237, 244,
19, 67, 99, 168, 112, 112, 237, 237, 19, 67, 112, 99, 112, 99, 237, 244,
19, 67, 9, 99, 112, 9, 237, 244, 56, 67, 67, 99, 9, 99, 10, 237,
18, 67, 19, 9, 9, 9, 10, 244, 56, 19, 67, 9, 99, 112, 168, 11,
18, 56, 67, 112, 9, 9, 99, 10, 19, 162, 19, 123, 9, 99, 99, 10,
237, 168, 168, 168, 10, 55, 25, 180, 237, 10, 168, 168, 10, 180, 180, 25,
237, 10, 168, 10, 168, 59, 25, 25, 244, 244, 10, 10, 10, 59, 180, 25,
244, 11, 168, 10, 10, 11, 25, 25, 244, 59, 168, 10, 10, 23, 25, 25,
59, 244, 10, 168, 10, 22, 25, 25, 244, 180, 10, 10, 10, 23, 25, 25,
25, 25, 25, 25, 44, 134, 128, 25, 25, 25, 25, 25, 13, 116, 24, 25,
25, 25, 25, 25, 44, 116, 74, 25, 25, 25, 25, 25, 98, 13, 74, 25,
25, 25, 25, 25, 24, 13, 98, 25, 25, 25, 25, 25, 24, 13, 98, 25,
25, 25, 25, 25, 25, 44, 44, 50, 25, 25, 25, 25, 25, 13, 13, 24,
25, 25, 25, 122, 69, 139, 30, 34, 24, 24, 26, 26, 83, 69, 69, 69,
25, 50, 50, 24, 149, 176, 69, 34, 24, 50, 25, 50, 25, 122, 34, 139,
12, 25, 50, 25, 26, 44, 69, 139, 25, 50, 50, 25, 25, 24, 83, 34,
25, 50, 26, 50, 25, 24, 181, 83, 25, 25, 25, 24, 26, 24, 128, 141,
69, 69, 158, 166, 158, 166, 158, 66, 139, 174, 166, 166, 166, 174, 174, 174,
139, 174, 174, 166, 192, 109, 148, 69, 139, 174, 192, 174, 174, 174, 139, 154,
139, 174, 249, 192, 148, 174, 111, 146, 139, 236, 174, 174, 174, 34, 121, 146,
139, 139, 174, 174, 236, 83, 146, 154, 115, 129, 174, 174, 129, 141, 159, 159,
66, 42, 236, 83, 141, 146, 146, 146, 139, 141, 146, 146, 121, 146, 146, 121,
149, 154, 146, 146, 146, 146, 146, 141, 146, 146, 146, 146, 141, 124, 115, 236,
146, 146, 146, 122, 124, 223, 223, 223, 146, 146, 146, 124, 223, 223, 223, 124,
159, 141, 48, 192, 236, 223, 223, 121, 159, 111, 191, 191, 192, 223, 236, 146,
146, 146, 83, 69, 69, 183, 34, 145, 121, 121, 141, 32, 32, 163, 33, 39,
141, 141, 121, 69, 33, 32, 39, 33, 223, 115, 83, 161, 69, 32, 39, 33,
236, 69, 69, 141, 149, 32, 39, 39, 149, 141, 146, 141, 141, 34, 39, 32,
141, 141, 141, 141, 141, 121, 83, 33, 161, 161, 161, 141, 141, 161, 161, 38,
109, 42, 42, 42, 42, 42, 42, 42, 33, 42, 42, 42, 42, 42, 42, 42,
33, 42, 42, 42, 42, 42, 42, 42, 39, 42, 42, 42, 42, 42, 42, 42,
33, 40, 42, 42, 42, 42, 42, 42, 39, 40, 42, 42, 42, 42, 42, 42,
33, 84, 40, 40, 42, 42, 42, 42, 39, 33, 84, 40, 42, 42, 42, 42,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 230,
41, 41, 41, 41, 41, 41, 230, 230, 41, 41, 41, 41, 41, 41, 230, 211,
41, 41, 41, 41, 41, 41, 230, 194, 41, 41, 41, 41, 41, 41, 211, 194,
41, 41, 202, 202, 240, 118, 6, 6, 41, 41, 202, 245, 184, 4, 4, 4,
230, 211, 245, 251, 108, 4, 4, 4, 230, 245, 194, 251, 184, 4, 4, 4,
211, 194, 251, 251, 108, 4, 4, 4, 194, 194, 194, 251, 184, 4, 4, 4,
194, 194, 194, 194, 184, 108, 4, 4, 194, 194, 194, 194, 251, 251, 184, 184,
6, 104, 104, 6, 4, 4, 4, 4, 104, 6, 104, 104, 6, 6, 6, 193,
4, 6, 104, 104, 104, 240, 240, 238, 4, 6, 104, 104, 240, 242, 202, 230,
5, 6, 104, 104, 97, 143, 41, 138, 4, 4, 104, 238, 242, 41, 165, 42,
4, 108, 238, 238, 41, 41, 138, 41, 184, 251, 238, 202, 143, 41, 41, 41,
108, 108, 245, 238, 143, 138, 41, 105, 251, 202, 143, 202, 138, 105, 40, 40,
202, 202, 230, 42, 41, 42, 105, 40, 143, 165, 40, 138, 138, 105, 40, 40,
41, 42, 138, 42, 40, 138, 40, 40, 165, 138, 138, 105, 138, 105, 96, 40,
41, 41, 40, 138, 40, 40, 40, 40, 138, 96, 41, 138, 105, 40, 105, 105,
40, 105, 40, 109, 70, 114, 114, 109, 40, 70, 70, 70, 70, 70, 203, 114,
40, 42, 97, 238, 240, 240, 97, 130, 96, 242, 184, 4, 4, 193, 242, 70,
207, 193, 4, 4, 4, 239, 130, 70, 143, 4, 4, 4, 184, 169, 42, 130,
238, 4, 4, 240, 97, 169, 96, 130, 238, 4, 240, 97, 97, 42, 42, 70,
114, 148, 114, 148, 47, 28, 114, 114, 114, 148, 114, 31, 47, 33, 114, 148,
70, 109, 203, 47, 31, 148, 148, 114, 130, 130, 31, 47, 114, 148, 148, 33,
130, 148, 47, 32, 148, 33, 114, 32, 96, 31, 31, 114, 33, 148, 33, 39,
203, 47, 33, 114, 148, 114, 148, 32, 31, 32, 114, 114, 33, 148, 33, 33,
114, 47, 31, 114, 148, 84, 31, 47, 39, 47, 32, 114, 114, 39, 47, 32,
31, 28, 33, 114, 148, 47, 28, 70, 31, 31, 114, 33, 31, 47, 33, 148,
47, 33, 148, 33, 47, 31, 148, 114, 31, 148, 148, 31, 31, 32, 114, 109,
32, 84, 39, 47, 33, 114, 114, 84, 148, 114, 47, 31, 114, 109, 114, 114,
33, 109, 84, 70, 31, 31, 84, 66, 114, 109, 114, 114, 31, 32, 70, 66,
114, 66, 84, 32, 31, 114, 109, 70, 114, 114, 114, 29, 39, 70, 70, 70,
114, 114, 33, 31, 114, 70, 70, 84, 114, 109, 32, 32, 70, 109, 84, 70,
84, 114, 33, 114, 70, 84, 84, 70, 109, 84, 114, 84, 84, 70, 105, 40,
70, 84, 109, 40, 40, 40, 40, 138, 70, 84, 40, 40, 40, 40, 105, 40,
70, 70, 105, 70, 40, 40, 40, 40, 85, 70, 40, 105, 70, 40, 40, 163,
66, 40, 70, 40, 40, 40, 40, 33, 70, 70, 105, 70, 40, 105, 42, 109,
85, 40, 70, 40, 40, 40, 138, 148, 70, 105, 40, 40, 105, 40, 138, 129,
124, 72, 8, 67, 20, 21, 22, 37, 124, 61, 86, 133, 22, 21, 52, 73,
93, 61, 8, 123, 22, 36, 59, 111, 93, 45, 8, 14, 22, 36, 46, 48,
68, 57, 8, 14, 102, 36, 73, 83, 93, 160, 86, 1, 22, 82, 92, 83,
93, 67, 15, 1, 22, 22, 73, 83, 68, 19, 54, 35, 22, 102, 155, 69,
30, 125, 123, 54, 15, 15, 16, 15, 145, 125, 133, 15, 18, 15, 15, 18,
163, 125, 14, 16, 15, 16, 15, 16, 163, 115, 14, 15, 16, 15, 18, 15,
163, 139, 160, 18, 15, 16, 15, 16, 70, 139, 45, 15, 18, 15, 18, 15,
178, 139, 179, 18, 15, 16, 15, 15, 40, 139, 179, 15, 15, 15, 16, 16,
4, 4, 4, 4, 6, 7, 8, 63, 4, 4, 4, 4, 6, 104, 8, 54,
4, 4, 4, 4, 6, 104, 8, 63, 4, 4, 4, 4, 6, 118, 8, 63,
4, 4, 4, 4, 193, 104, 8, 63, 4, 4, 4, 4, 193, 118, 8, 63,
4, 4, 4, 4, 118, 104, 54, 63, 4, 4, 4, 4, 118, 118, 54, 63,
16, 19, 133, 133, 133, 133, 14, 2, 56, 19, 133, 133, 133, 14, 14, 2,
56, 19, 133, 133, 14, 14, 2, 2, 56, 136, 14, 14, 2, 14, 2, 2,
16, 136, 123, 2, 2, 2, 17, 17, 16, 123, 123, 123, 17, 17, 2, 17,
16, 123, 2, 9, 2, 17, 17, 1, 56, 123, 9, 2, 17, 17, 1, 17,
17, 1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17,
17, 57, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 2, 17, 57, 17,
17, 57, 17, 1, 17, 1, 17, 1, 17, 17, 57, 17, 1, 17, 17, 17,
17, 1, 17, 2, 17, 57, 17, 57, 1, 2, 1, 17, 1, 17, 1, 17,
17, 1, 17, 1, 17, 1, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17,
17, 1, 17, 1, 17, 1, 17, 1, 2, 17, 57, 17, 2, 17, 57, 17,
17, 1, 17, 1, 17, 1, 17, 1, 1, 17, 17, 17, 1, 17, 17, 17,
17, 57, 17, 57, 17, 57, 17, 57, 17, 17, 1, 17, 17, 17, 1, 17,
17, 1, 17, 1, 17, 1, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17,
17, 1, 17, 17, 1, 17, 1, 17, 2, 17, 2, 1, 2, 1, 17, 1,
17, 1, 17, 17, 17, 1, 2, 17, 1, 17, 1, 17, 1, 17, 1, 2,
17, 57, 17, 2, 17, 1, 17, 1, 17, 17, 1, 17, 1, 2, 1, 17,
17, 1, 17, 1, 17, 1, 2, 1, 1, 2, 17, 2, 1, 17, 1, 17,
1, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1,
1, 2, 1, 17, 1, 17, 1, 17, 17, 17, 2, 1, 2, 17, 2, 1,
17, 1, 1, 17, 1, 1, 17, 1, 1, 17, 17, 1, 17, 17, 1, 17,
17, 1, 17, 1, 17, 2, 1, 2, 2, 17, 57, 17, 1, 17, 17, 1,
1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 1,
57, 17, 1, 17, 1, 17, 1, 17, 17, 2, 17, 57, 17, 1, 17, 1,
17, 1, 1, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 17, 2, 1,
17, 17, 1, 17, 1, 17, 1, 4, 17, 1, 17, 1, 1, 1, 1, 4,
1, 17, 1, 17, 17, 1, 1, 78, 17, 1, 17, 1, 1, 17, 1, 135,
1, 17, 1, 17, 1, 17, 1, 90, 17, 1, 17, 1, 2, 17, 17, 135,
1, 17, 1, 17, 17, 2, 2, 173, 2, 1, 2, 17, 2, 2, 14, 132,
4, 4, 4, 4, 4, 136, 76, 14, 4, 4, 4, 4, 4, 107, 68, 36,
4, 4, 4, 4, 4, 4, 179, 23, 4, 4, 4, 4, 4, 4, 54, 68,
4, 4, 4, 4, 4, 4, 108, 92, 4, 4, 4, 4, 4, 4, 4, 68,
108, 4, 4, 4, 4, 4, 4, 93, 108, 4, 4, 4, 4, 4, 4, 196,
119, 4, 4, 187, 156, 102, 82, 102, 54, 4, 4, 104, 162, 102, 227, 227,
63, 104, 4, 6, 63, 227, 102, 227, 136, 6, 4, 6, 187, 156, 244, 227,
72, 104, 4, 4, 239, 63, 87, 227, 198, 63, 4, 4, 240, 187, 87, 23,
68, 162, 4, 4, 239, 239, 23, 87, 111, 125, 108, 4, 104, 239, 23, 229,
10, 63, 19, 19, 9, 9, 99, 10, 237, 19, 156, 123, 9, 99, 9, 99,
59, 82, 19, 19, 9, 9, 9, 99, 59, 244, 19, 19, 9, 9, 99, 99,
244, 59, 123, 19, 9, 2, 45, 99, 227, 12, 1, 19, 2, 57, 99, 99,
198, 23, 59, 45, 2, 17, 45, 45, 227, 23, 24, 11, 14, 57, 45, 99,
59, 59, 11, 10, 10, 102, 12, 25, 59, 59, 87, 82, 10, 82, 12, 25,
59, 59, 12, 11, 10, 82, 25, 25, 87, 59, 76, 87, 10, 82, 25, 25,
102, 12, 76, 12, 10, 21, 74, 25, 82, 59, 76, 12, 10, 36, 50, 25,
99, 52, 76, 59, 23, 36, 25, 25, 99, 11, 46, 76, 59, 94, 46, 25,
25, 25, 25, 25, 25, 98, 13, 74, 25, 25, 25, 25, 26, 24, 13, 74,
25, 25, 25, 25, 50, 49, 13, 98, 25, 25, 25, 25, 50, 24, 13, 44,
25, 25, 25, 25, 50, 26, 13, 13, 25, 25, 25, 25, 50, 25, 13, 13,
25, 25, 25, 25, 25, 24, 13, 13, 25, 25, 50, 50, 25, 25, 13, 13,
50, 25, 24, 50, 24, 25, 25, 24, 50, 25, 25, 25, 24, 74, 26, 26,
24, 50, 50, 50, 50, 50, 50, 50, 25, 50, 50, 50, 50, 50, 50, 25,
25, 50, 50, 50, 50, 50, 50, 50, 25, 50, 50, 50, 50, 50, 50, 50,
25, 50, 50, 50, 50, 50, 50, 74, 25, 50, 50, 50, 50, 50, 50, 25,
176, 34, 236, 129, 129, 121, 159, 154, 83, 69, 236, 139, 139, 121, 137, 159,
92, 183, 236, 139, 139, 141, 137, 154, 128, 111, 115, 139, 139, 141, 137, 159,
25, 26, 176, 115, 129, 141, 159, 159, 25, 50, 149, 69, 139, 141, 137, 159,
25, 50, 128, 111, 176, 122, 137, 154, 25, 24, 26, 13, 83, 122, 159, 159,
159, 115, 192, 192, 192, 223, 115, 121, 159, 115, 192, 191, 192, 223, 115, 141,
121, 125, 192, 192, 192, 223, 115, 141, 159, 115, 191, 192, 191, 192, 115, 141,
146, 125, 192, 192, 192, 192, 192, 121, 159, 124, 192, 191, 192, 191, 192, 146,
159, 48, 192, 192, 192, 192, 192, 111, 159, 122, 125, 192, 191, 191, 191, 124,
141, 161, 161, 161, 161, 161, 141, 161, 141, 161, 161, 231, 161, 161, 161, 197,
141, 161, 161, 161, 161, 161, 231, 161, 141, 231, 161, 161, 161, 161, 161, 161,
121, 141, 111, 83, 83, 161, 161, 161, 146, 43, 139, 158, 236, 149, 231, 161,
83, 241, 158, 241, 242, 207, 43, 161, 115, 241, 158, 158, 241, 238, 139, 161,
83, 39, 33, 84, 40, 42, 42, 42, 161, 38, 33, 84, 40, 40, 42, 42,
161, 83, 176, 33, 84, 70, 40, 42, 161, 183, 38, 38, 33, 84, 41, 42,
161, 161, 83, 31, 38, 33, 70, 42, 161, 161, 161, 30, 145, 30, 84, 40,
231, 161, 161, 161, 69, 33, 33, 70, 161, 161, 161, 141, 83, 33, 84, 109,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
42, 41, 41, 42, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
42, 42, 42, 42, 41, 41, 41, 41, 42, 42, 42, 42, 42, 41, 41, 41,
40, 42, 42, 42, 42, 41, 41, 41, 109, 42, 42, 42, 41, 42, 41, 41,
41, 41, 41, 41, 41, 41, 211, 194, 41, 41, 41, 41, 41, 41, 211, 194,
41, 41, 41, 143, 143, 143, 202, 194, 41, 41, 143, 143, 143, 143, 245, 245,
41, 143, 143, 242, 242, 242, 238, 238, 41, 143, 143, 242, 239, 242, 242, 238,
143, 143, 242, 239, 239, 239, 239, 242, 143, 238, 239, 239, 104, 239, 239, 242,
194, 194, 194, 194, 251, 251, 251, 251, 194, 194, 194, 194, 194, 194, 194, 194,
194, 194, 194, 194, 194, 194, 194, 211, 194, 194, 194, 194, 194, 194, 194, 211,
251, 194, 194, 194, 194, 194, 211, 138, 245, 245, 194, 194, 211, 211, 211, 41,
202, 202, 230, 211, 211, 230, 230, 41, 242, 143, 41, 41, 41, 41, 138, 41,
251, 245, 230, 230, 138, 41, 138, 138, 194, 211, 41, 41, 41, 41, 41, 138,
211, 138, 41, 138, 41, 138, 41, 41, 211, 230, 41, 41, 138, 41, 41, 138,
230, 138, 41, 138, 41, 41, 138, 41, 41, 41, 41, 41, 41, 138, 41, 138,
230, 41, 138, 230, 41, 41, 41, 41, 138, 41, 41, 41, 41, 41, 138, 41,
138, 138, 138, 105, 40, 40, 105, 40, 165, 138, 138, 40, 138, 40, 40, 84,
138, 138, 138, 105, 40, 40, 40, 178, 41, 138, 40, 138, 105, 40, 178, 70,
138, 138, 138, 138, 40, 40, 40, 85, 138, 165, 40, 105, 40, 105, 178, 40,
138, 138, 138, 138, 40, 40, 105, 178, 138, 41, 40, 138, 40, 40, 105, 70,
105, 242, 165, 70, 42, 70, 70, 148, 84, 70, 70, 70, 70, 66, 84, 31,
84, 84, 84, 84, 109, 109, 33, 31, 109, 84, 84, 114, 109, 114, 31, 33,
84, 84, 84, 109, 84, 33, 32, 109, 84, 84, 84, 85, 84, 31, 114, 84,
66, 84, 70, 84, 33, 32, 84, 84, 178, 85, 84, 84, 33, 84, 84, 84,
31, 33, 114, 114, 114, 148, 114, 148, 39, 84, 148, 109, 33, 114, 114, 109,
114, 114, 114, 114, 114, 84, 114, 84, 109, 84, 109, 84, 109, 114, 109, 33,
114, 109, 114, 84, 114, 84, 114, 32, 109, 84, 84, 109, 84, 109, 114, 33,
84, 84, 84, 84, 84, 84, 148, 84, 84, 85, 84, 85, 84, 84, 84, 84,
109, 31, 31, 84, 109, 114, 84, 109, 33, 31, 33, 70, 114, 84, 109, 66,
31, 39, 109, 109, 84, 109, 84, 84, 31, 114, 84, 84, 84, 84, 84, 84,
32, 85, 84, 109, 84, 84, 109, 84, 70, 109, 70, 84, 84, 105, 40, 40,
84, 70, 105, 178, 84, 40, 84, 40, 40, 178, 70, 40, 105, 40, 105, 40,
84, 114, 84, 109, 66, 40, 70, 40, 84, 70, 84, 105, 40, 70, 40, 40,
109, 84, 70, 178, 70, 105, 178, 40, 70, 70, 40, 40, 40, 40, 40, 40,
40, 40, 40, 105, 40, 40, 40, 40, 70, 105, 40, 40, 40, 40, 105, 138,
105, 40, 105, 40, 105, 138, 42, 40, 40, 40, 40, 138, 138, 105, 138, 138,
105, 40, 40, 40, 40, 42, 41, 129, 40, 40, 105, 138, 96, 41, 41, 139,
105, 40, 40, 40, 40, 96, 41, 139, 40, 105, 138, 40, 41, 41, 41, 34,
40, 138, 96, 40, 40, 42, 138, 115, 165, 42, 96, 138, 41, 41, 41, 115,
42, 138, 165, 41, 40, 138, 41, 124, 41, 41, 42, 138, 41, 41, 138, 124,
93, 16, 16, 35, 21, 23, 110, 34, 93, 56, 18, 35, 22, 52, 122, 30,
95, 18, 56, 36, 21, 52, 122, 32, 79, 89, 19, 22, 21, 46, 111, 32,
95, 86, 14, 22, 36, 71, 83, 163, 72, 8, 14, 22, 36, 92, 69, 109,
61, 8, 17, 22, 82, 60, 69, 178, 35, 8, 1, 22, 102, 131, 69, 163,
40, 139, 160, 18, 16, 18, 16, 15, 163, 139, 179, 18, 15, 15, 15, 18,
178, 139, 160, 18, 15, 16, 16, 15, 178, 236, 179, 16, 15, 18, 15, 16,
163, 129, 61, 56, 15, 16, 16, 15, 163, 129, 160, 18, 15, 15, 16, 54,
84, 129, 17, 16, 15, 15, 16, 15, 84, 236, 45, 18, 15, 16, 15, 15,
4, 4, 4, 4, 118, 118, 54, 63, 4, 4, 4, 4, 118, 119, 54, 16,
4, 4, 4, 4, 6, 118, 54, 15, 4, 4, 4, 4, 6, 119, 54, 15,
4, 4, 4, 4, 7, 119, 86, 15, 4, 4, 4, 4, 5, 119, 8, 16,
4, 4, 4, 4, 7, 135, 8, 16, 4, 4, 4, 4, 5, 58, 8, 15,
56, 136, 9, 2, 9, 17, 17, 57, 56, 123, 2, 9, 17, 57, 17, 17,
56, 123, 123, 2, 17, 17, 1, 17, 56, 14, 123, 2, 17, 1, 17, 2,
56, 123, 123, 2, 17, 2, 17, 1, 56, 14, 14, 2, 1, 17, 1, 17,
56, 67, 14, 14, 17, 1, 17, 1, 56, 19, 123, 123, 17, 1, 17, 1,
17, 17, 17, 57, 17, 17, 17, 1, 1, 17, 1, 17, 57, 17, 57, 17,
2, 1, 17, 17, 17, 1, 17, 17, 1, 17, 1, 2, 1, 17, 1, 17,
17, 17, 17, 1, 17, 2, 17, 57, 57, 17, 1, 17, 1, 17, 1, 17,
17, 1, 2, 17, 17, 1, 17, 17, 17, 17, 1, 17, 1, 2, 1, 2,
17, 1, 17, 1, 17, 1, 17, 1, 57, 17, 2, 17, 57, 17, 2, 17,
17, 1, 17, 1, 17, 1, 17, 1, 1, 17, 1, 17, 17, 17, 1, 17,
17, 2, 17, 57, 17, 57, 17, 57, 1, 17, 1, 17, 1, 17, 17, 17,
17, 1, 17, 17, 17, 1, 17, 1, 1, 2, 1, 2, 1, 2, 1, 2,
17, 1, 17, 1, 17, 17, 17, 57, 57, 17, 2, 17, 1, 17, 1, 17,
17, 1, 17, 1, 2, 1, 17, 17, 17, 17, 1, 17, 17, 17, 57, 17,
17, 57, 17, 57, 17, 1, 17, 1, 1, 17, 17, 17, 57, 17, 17, 17,
17, 1, 17, 1, 17, 57, 17, 57, 17, 2, 1, 2, 17, 17, 1, 17,
17, 2, 1, 2, 17, 57, 17, 2, 1, 17, 17, 1, 17, 17, 1, 17,
17, 1, 17, 17, 1, 17, 17, 1, 57, 17, 2, 1, 2, 17, 57, 17,
17, 17, 1, 17, 17, 1, 17, 17, 1, 17, 17, 1, 17, 17, 1, 17,
17, 57, 17, 2, 1, 2, 17, 57, 17, 17, 17, 1, 17, 17, 1, 17,
17, 57, 17, 2, 1, 2, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1,
17, 17, 17, 17, 1, 2, 17, 2, 2, 1, 2, 1, 2, 1, 17, 1,
1, 17, 17, 17, 1, 17, 1, 2, 17, 1, 17, 1, 17, 2, 17, 57,
17, 2, 1, 2, 17, 1, 2, 9, 17, 1, 17, 17, 1, 17, 9, 2,
17, 17, 1, 2, 2, 14, 133, 80, 17, 57, 2, 2, 2, 133, 133, 175,
1, 2, 2, 2, 103, 133, 100, 100, 17, 2, 2, 103, 133, 133, 152, 147,
2, 2, 2, 103, 67, 152, 147, 147, 9, 2, 112, 67, 133, 152, 147, 147,
2, 2, 103, 152, 152, 147, 147, 147, 9, 112, 112, 67, 152, 152, 147, 117,
108, 4, 4, 4, 4, 4, 4, 184, 108, 4, 4, 4, 4, 4, 4, 184,
188, 4, 4, 4, 4, 4, 4, 251, 188, 4, 4, 4, 4, 4, 4, 251,
90, 4, 4, 4, 4, 4, 4, 184, 188, 4, 4, 4, 4, 4, 4, 108,
127, 4, 4, 4, 4, 4, 4, 184, 172, 4, 4, 4, 4, 4, 4, 184,
93, 93, 108, 4, 240, 240, 179, 46, 115, 111, 6, 4, 108, 239, 191, 87,
108, 83, 233, 4, 108, 239, 233, 23, 251, 124, 125, 108, 108, 251, 241, 72,
251, 251, 48, 142, 4, 184, 119, 170, 184, 251, 185, 170, 4, 184, 233, 64,
251, 251, 37, 37, 4, 108, 233, 175, 251, 251, 68, 161, 4, 4, 142, 175,
72, 72, 71, 24, 160, 120, 45, 45, 72, 72, 12, 98, 45, 57, 45, 45,
23, 65, 52, 12, 11, 45, 99, 45, 65, 23, 95, 59, 87, 45, 45, 45,
55, 72, 95, 52, 98, 10, 120, 99, 59, 95, 23, 52, 49, 87, 45, 45,
180, 52, 23, 52, 102, 26, 45, 45, 76, 87, 23, 52, 35, 55, 82, 35,
99, 10, 74, 76, 76, 52, 52, 50, 10, 94, 74, 76, 12, 87, 11, 50,
99, 10, 87, 12, 12, 76, 102, 12, 10, 10, 87, 12, 12, 12, 88, 59,
99, 10, 102, 46, 76, 25, 52, 52, 99, 10, 82, 87, 12, 25, 87, 52,
10, 10, 10, 23, 25, 76, 12, 87, 99, 10, 10, 82, 12, 12, 25, 76,
25, 25, 25, 25, 26, 25, 13, 13, 25, 25, 25, 25, 26, 25, 13, 13,
25, 25, 25, 25, 25, 50, 98, 13, 25, 25, 25, 25, 25, 50, 24, 13,
25, 26, 25, 25, 25, 24, 50, 13, 25, 25, 25, 25, 25, 24, 50, 13,
12, 25, 25, 26, 25, 25, 50, 98, 12, 25, 25, 26, 25, 25, 50, 74,
25, 50, 50, 50, 50, 50, 50, 50, 25, 25, 50, 50, 50, 50, 50, 50,
50, 25, 50, 50, 50, 50, 50, 24, 24, 12, 50, 50, 50, 50, 50, 24,
49, 25, 50, 50, 50, 50, 50, 50, 49, 25, 50, 50, 50, 50, 50, 50,
49, 25, 50, 50, 50, 50, 50, 50, 49, 25, 50, 50, 50, 50, 50, 50,
74, 25, 25, 26, 44, 69, 141, 137, 25, 26, 74, 25, 26, 176, 83, 137,
24, 24, 25, 74, 26, 92, 176, 83, 25, 24, 25, 50, 25, 26, 83, 69,
50, 50, 50, 50, 50, 128, 26, 176, 50, 50, 50, 50, 50, 50, 26, 83,
50, 50, 50, 50, 50, 24, 26, 26, 50, 50, 50, 50, 50, 74, 25, 26,
159, 159, 122, 192, 192, 192, 192, 192, 159, 154, 121, 191, 191, 192, 192, 192,
149, 146, 159, 111, 191, 191, 192, 223, 69, 149, 146, 141, 124, 192, 192, 192,
69, 69, 183, 121, 146, 192, 192, 192, 69, 34, 176, 161, 159, 191, 191, 192,
73, 34, 129, 176, 83, 141, 115, 192, 71, 69, 236, 34, 69, 121, 111, 233,
192, 241, 241, 241, 158, 238, 236, 161, 192, 241, 158, 241, 241, 242, 139, 161,
192, 192, 241, 241, 158, 115, 83, 161, 223, 124, 236, 158, 158, 83, 141, 231,
223, 43, 146, 161, 161, 141, 121, 161, 223, 192, 111, 121, 141, 141, 121, 161,
192, 241, 192, 121, 121, 146, 141, 161, 192, 192, 207, 141, 146, 141, 161, 161,
161, 161, 161, 161, 141, 28, 33, 84, 161, 161, 161, 161, 161, 83, 32, 109,
231, 161, 231, 161, 161, 141, 149, 84, 161, 161, 161, 161, 231, 141, 141, 33,
161, 161, 121, 231, 161, 231, 161, 69, 161, 161, 141, 141, 161, 231, 161, 161,
161, 141, 161, 121, 141, 231, 161, 141, 161, 141, 141, 141, 121, 161, 231, 141,
40, 40, 42, 40, 42, 42, 41, 41, 84, 42, 42, 42, 41, 42, 41, 41,
84, 40, 42, 41, 42, 42, 41, 41, 84, 40, 42, 42, 42, 42, 41, 41,
109, 40, 40, 42, 40, 41, 41, 41, 129, 40, 42, 40, 41, 42, 41, 41,
141, 40, 40, 96, 41, 42, 42, 41, 121, 42, 42, 41, 41, 42, 42, 41,
41, 41, 41, 41, 41, 41, 41, 143, 41, 41, 41, 41, 41, 41, 230, 202,
41, 41, 41, 41, 41, 230, 230, 230, 41, 41, 41, 41, 230, 230, 202, 245,
41, 41, 41, 230, 230, 211, 245, 245, 41, 41, 41, 230, 211, 211, 194, 245,
41, 41, 230, 211, 211, 194, 194, 194, 41, 230, 230, 211, 194, 194, 194, 194,
202, 242, 240, 104, 104, 239, 239, 242, 238, 238, 240, 239, 104, 104, 239, 242,
238, 240, 240, 104, 239, 240, 239, 242, 245, 238, 240, 240, 240, 240, 242, 242,
251, 240, 240, 240, 240, 242, 242, 143, 251, 251, 238, 238, 238, 238, 143, 143,
245, 251, 251, 238, 238, 238, 143, 41, 194, 245, 245, 202, 202, 143, 41, 41,
242, 143, 41, 41, 230, 138, 41, 41, 242, 143, 41, 41, 41, 41, 230, 41,
143, 143, 41, 41, 230, 41, 41, 41, 143, 41, 41, 41, 41, 230, 41, 230,
143, 41, 41, 230, 41, 41, 41, 41, 41, 41, 41, 41, 138, 41, 230, 41,
41, 41, 41, 41, 230, 41, 41, 41, 41, 41, 41, 41, 41, 230, 230, 230,
41, 41, 41, 138, 41, 138, 41, 41, 230, 41, 138, 41, 230, 41, 41, 138,
41, 230, 41, 138, 41, 230, 41, 41, 41, 41, 41, 230, 41, 41, 138, 41,
41, 41, 230, 41, 41, 230, 41, 41, 230, 41, 41, 41, 230, 41, 41, 230,
230, 230, 230, 41, 41, 41, 41, 41, 41, 41, 41, 41, 230, 41, 230, 41,
138, 138, 138, 138, 40, 105, 40, 178, 138, 165, 138, 105, 40, 40, 40, 105,
138, 138, 138, 138, 105, 40, 40, 40, 41, 41, 138, 40, 138, 105, 40, 105,
138, 165, 138, 41, 138, 105, 138, 40, 41, 41, 41, 138, 138, 138, 138, 138,
230, 138, 41, 41, 138, 41, 138, 40, 41, 41, 138, 41, 41, 41, 138, 41,
40, 40, 70, 109, 109, 70, 85, 84, 40, 178, 40, 114, 84, 178, 84, 40,
105, 40, 85, 84, 40, 40, 40, 40, 40, 40, 40, 40, 40, 105, 40, 40,
40, 105, 40, 105, 40, 40, 40, 105, 40, 40, 40, 138, 138, 138, 105, 138,
138, 138, 138, 40, 138, 40, 138, 40, 138, 41, 138, 41, 138, 41, 138, 41,
85, 40, 84, 40, 84, 40, 178, 105, 70, 40, 105, 40, 105, 40, 40, 40,
85, 40, 178, 40, 178, 40, 105, 40, 40, 40, 105, 40, 105, 40, 40, 105,
40, 105, 40, 105, 40, 40, 105, 40, 138, 138, 138, 138, 138, 105, 138, 138,
138, 40, 138, 40, 138, 41, 105, 41, 138, 41, 138, 41, 138, 41, 41, 138,
178, 178, 40, 105, 178, 105, 40, 40, 40, 105, 40, 40, 40, 40, 40, 105,
40, 40, 105, 40, 105, 40, 138, 40, 40, 105, 40, 40, 138, 138, 42, 138,
138, 138, 138, 138, 165, 40, 41, 41, 105, 41, 96, 138, 42, 41, 41, 138,
41, 138, 41, 41, 138, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
105, 40, 105, 40, 105, 41, 105, 41, 138, 138, 138, 41, 138, 40, 138, 41,
165, 40, 138, 105, 41, 165, 41, 105, 40, 41, 41, 41, 41, 138, 41, 41,
138, 41, 138, 96, 138, 41, 41, 138, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
40, 138, 41, 41, 165, 41, 138, 43, 41, 41, 42, 138, 41, 41, 105, 43,
41, 138, 41, 41, 165, 41, 42, 27, 41, 165, 138, 41, 41, 41, 85, 27,
41, 138, 41, 41, 41, 230, 109, 79, 41, 41, 41, 165, 41, 41, 129, 95,
41, 41, 41, 41, 41, 202, 129, 79, 41, 41, 41, 41, 41, 230, 236, 79,
45, 62, 1, 20, 52, 121, 69, 178, 17, 86, 1, 82, 46, 146, 129, 178,
133, 18, 45, 22, 13, 149, 163, 84, 19, 63, 35, 36, 13, 83, 138, 84,
56, 16, 35, 82, 131, 69, 143, 84, 56, 56, 35, 102, 110, 34, 41, 163,
16, 19, 35, 87, 131, 129, 138, 84, 16, 67, 99, 46, 122, 85, 70, 163,
84, 139, 61, 15, 18, 16, 15, 16, 84, 236, 45, 16, 15, 15, 18, 15,
163, 236, 45, 15, 16, 16, 15, 15, 163, 115, 1, 15, 18, 15, 16, 16,
33, 191, 120, 16, 15, 16, 15, 54, 163, 125, 160, 15, 18, 15, 16, 15,
33, 191, 14, 16, 15, 15, 16, 15, 163, 125, 14, 15, 16, 15, 16, 15,
4, 4, 4, 4, 4, 78, 8, 15, 4, 4, 4, 4, 4, 58, 8, 15,
4, 4, 4, 4, 4, 7, 119, 8, 4, 4, 4, 4, 4, 4, 119, 8,
4, 4, 4, 4, 4, 4, 91, 8, 4, 4, 4, 4, 4, 4, 91, 119,
4, 4, 4, 4, 4, 4, 78, 119, 4, 4, 4, 4, 4, 4, 78, 119,
16, 19, 14, 123, 2, 9, 17, 17, 16, 19, 67, 123, 2, 2, 17, 17,
15, 56, 19, 67, 2, 2, 17, 1, 15, 56, 19, 67, 2, 2, 17, 17,
8, 56, 19, 19, 14, 2, 17, 17, 8, 16, 56, 19, 123, 123, 2, 2,
91, 15, 16, 56, 67, 14, 14, 17, 119, 8, 15, 56, 19, 123, 14, 2,
1, 2, 17, 1, 17, 17, 17, 1, 17, 1, 2, 17, 1, 17, 1, 17,
17, 17, 1, 17, 2, 1, 17, 1, 17, 17, 17, 17, 1, 17, 1, 17,
17, 17, 1, 2, 17, 1, 17, 57, 17, 2, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 2, 17, 17, 17, 17, 17, 1, 17,
17, 17, 17, 1, 17, 17, 17, 1, 1, 17, 1, 17, 1, 17, 1, 17,
17, 1, 2, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 57, 17, 1,
17, 1, 2, 17, 1, 17, 1, 2, 17, 17, 17, 17, 17, 17, 17, 17,
17, 1, 17, 1, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 17,
17, 1, 17, 1, 17, 57, 17, 1, 1, 17, 17, 17, 1, 17, 2, 17,
1, 17, 1, 1, 17, 17, 1, 1, 17, 1, 17, 17, 2, 1, 17, 17,
1, 2, 1, 2, 1, 17, 2, 1, 17, 17, 17, 17, 17, 1, 17, 17,
17, 17, 1, 2, 1, 17, 17, 1, 17, 17, 17, 1, 17, 2, 1, 2,
17, 1, 17, 17, 17, 1, 17, 17, 57, 17, 57, 17, 57, 17, 57, 17,
17, 17, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17, 1, 17, 17, 1,
2, 1, 2, 17, 2, 1, 2, 17, 17, 17, 1, 17, 1, 17, 1, 17,
17, 1, 17, 1, 17, 17, 17, 1, 1, 2, 17, 2, 1, 2, 9, 2,
1, 17, 17, 1, 17, 9, 2, 9, 2, 1, 2, 9, 17, 9, 9, 9,
1, 17, 17, 17, 9, 9, 9, 9, 17, 17, 1, 9, 9, 9, 9, 112,
2, 1, 9, 9, 9, 9, 112, 9, 9, 17, 9, 9, 9, 9, 9, 112,
17, 9, 9, 9, 9, 9, 9, 112, 9, 9, 9, 9, 9, 123, 112, 123,
112, 112, 112, 152, 152, 147, 147, 147, 112, 112, 112, 152, 152, 152, 147, 147,
112, 112, 152, 152, 152, 152, 152, 147, 112, 112, 112, 152, 152, 152, 152, 147,
112, 112, 152, 152, 152, 152, 152, 147, 112, 112, 152, 152, 152, 152, 152, 152,
67, 112, 112, 152, 152, 152, 152, 152, 112, 152, 152, 152, 152, 152, 152, 152,
172, 4, 4, 4, 4, 4, 4, 108, 147, 4, 4, 4, 4, 4, 4, 4,
147, 4, 4, 4, 4, 4, 4, 4, 147, 4, 4, 4, 4, 4, 4, 4,
147, 4, 4, 4, 4, 4, 4, 4, 152, 4, 4, 4, 4, 4, 4, 4,
152, 152, 4, 4, 4, 4, 4, 4, 152, 152, 4, 4, 4, 4, 4, 4,
251, 251, 190, 201, 62, 4, 175, 175, 251, 251, 188, 92, 205, 108, 64, 175,
184, 252, 90, 144, 92, 133, 142, 190, 184, 252, 90, 170, 155, 35, 173, 132,
184, 188, 188, 175, 116, 46, 90, 64, 4, 188, 188, 172, 44, 71, 142, 64,
4, 172, 132, 175, 46, 140, 100, 90, 4, 188, 100, 175, 88, 116, 14, 142,
55, 180, 23, 52, 61, 57, 49, 82, 55, 51, 52, 52, 45, 160, 26, 101,
103, 180, 23, 52, 45, 120, 99, 26, 170, 55, 11, 52, 45, 133, 35, 87,
190, 45, 87, 23, 120, 120, 57, 99, 132, 160, 76, 23, 103, 14, 35, 120,
190, 100, 26, 55, 170, 160, 120, 45, 190, 190, 180, 55, 133, 160, 120, 45,
10, 94, 10, 10, 12, 51, 25, 25, 99, 10, 10, 250, 76, 180, 25, 25,
99, 10, 10, 10, 23, 12, 76, 25, 55, 99, 10, 10, 82, 12, 12, 12,
13, 55, 10, 10, 10, 23, 25, 12, 13, 44, 10, 10, 10, 102, 25, 12,
10, 51, 11, 10, 10, 10, 25, 12, 99, 11, 74, 250, 10, 10, 46, 25,
25, 25, 26, 25, 50, 25, 50, 98, 12, 25, 26, 25, 50, 50, 50, 98,
25, 25, 25, 25, 50, 25, 50, 25, 25, 25, 25, 25, 25, 25, 50, 25,
25, 25, 25, 25, 25, 26, 50, 25, 25, 25, 25, 25, 12, 25, 25, 50,
25, 25, 25, 25, 50, 50, 12, 98, 25, 25, 12, 50, 25, 25, 50, 26,
49, 76, 50, 50, 50, 50, 50, 50, 98, 87, 50, 50, 50, 50, 50, 50,
13, 52, 24, 26, 24, 50, 25, 50, 13, 52, 74, 24, 25, 50, 50, 50,
13, 87, 23, 74, 26, 25, 50, 50, 13, 71, 102, 87, 25, 128, 50, 50,
13, 49, 36, 22, 49, 25, 25, 50, 44, 13, 36, 21, 74, 50, 25, 25,
50, 50, 50, 50, 50, 25, 24, 74, 50, 50, 50, 50, 50, 74, 50, 26,
50, 50, 50, 50, 50, 50, 50, 25, 50, 50, 50, 50, 50, 50, 50, 25,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
128, 83, 38, 139, 139, 139, 69, 115, 98, 92, 176, 129, 236, 139, 129, 43,
25, 26, 92, 34, 129, 129, 129, 174, 25, 25, 26, 176, 139, 174, 129, 236,
50, 25, 74, 74, 69, 236, 174, 174, 50, 50, 50, 128, 37, 192, 174, 174,
50, 74, 12, 131, 13, 124, 174, 192, 50, 50, 25, 134, 131, 68, 129, 174,
192, 241, 241, 115, 141, 121, 141, 161, 192, 241, 241, 241, 48, 121, 141, 161,
192, 233, 241, 239, 169, 121, 121, 161, 192, 233, 241, 241, 239, 141, 141, 141,
174, 192, 233, 241, 241, 192, 149, 146, 174, 192, 241, 241, 241, 240, 124, 146,
174, 174, 192, 169, 241, 241, 238, 141, 192, 174, 174, 158, 241, 241, 241, 83,
161, 161, 141, 149, 141, 161, 231, 185, 231, 161, 161, 141, 141, 161, 161, 231,
161, 161, 161, 161, 121, 161, 161, 185, 161, 231, 161, 161, 161, 161, 231, 69,
141, 231, 185, 161, 161, 161, 161, 141, 141, 185, 185, 231, 161, 161, 161, 141,
146, 231, 185, 185, 231, 231, 231, 185, 146, 141, 185, 185, 185, 185, 185, 185,
161, 83, 96, 109, 41, 42, 42, 42, 161, 141, 34, 41, 40, 42, 42, 42,
43, 141, 141, 202, 40, 41, 42, 41, 174, 161, 121, 41, 138, 41, 42, 41,
83, 185, 141, 83, 105, 42, 42, 42, 121, 185, 231, 161, 129, 41, 42, 42,
185, 185, 185, 146, 83, 41, 41, 41, 43, 185, 185, 141, 146, 143, 41, 165,
42, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 42, 41, 41, 41, 41, 41, 41,
42, 42, 41, 41, 41, 41, 41, 41, 42, 42, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 143, 143, 41, 41, 41, 41, 41, 143, 143, 143,
41, 230, 230, 211, 194, 194, 194, 194, 41, 230, 211, 194, 194, 194, 194, 194,
41, 230, 211, 194, 194, 194, 194, 194, 41, 230, 230, 194, 194, 194, 194, 194,
41, 230, 211, 211, 194, 194, 194, 194, 41, 230, 230, 211, 211, 211, 211, 211,
143, 202, 230, 211, 211, 211, 211, 230, 143, 143, 230, 230, 230, 230, 230, 230,
194, 245, 245, 202, 143, 41, 41, 41, 194, 245, 211, 230, 41, 230, 41, 41,
194, 211, 230, 230, 41, 41, 41, 41, 211, 230, 230, 41, 41, 41, 41, 41,
211, 230, 230, 41, 41, 41, 41, 41, 230, 230, 41, 41, 41, 41, 41, 41,
230, 41, 41, 41, 41, 41, 41, 41, 230, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 230, 41, 230, 41, 41, 230, 41, 41, 41, 230, 41, 230, 41,
41, 41, 41, 41, 230, 41, 230, 230, 41, 41, 41, 41, 41, 230, 41, 41,
41, 41, 41, 41, 230, 41, 230, 230, 41, 41, 41, 41, 230, 41, 230, 41,
41, 41, 41, 41, 230, 41, 230, 41, 230, 230, 230, 41, 230, 41, 230, 41,
230, 230, 41, 230, 41, 41, 41, 41, 41, 41, 230, 41, 230, 230, 230, 230,
230, 41, 41, 41, 41, 41, 41, 41, 41, 230, 230, 41, 230, 41, 230, 41,
41, 230, 41, 41, 230, 41, 230, 41, 230, 41, 230, 230, 41, 230, 41, 230,
230, 41, 230, 230, 230, 230, 230, 230, 41, 230, 41, 230, 41, 230, 230, 41,
230, 138, 41, 41, 41, 138, 41, 41, 41, 41, 230, 41, 41, 41, 41, 138,
230, 41, 41, 230, 41, 230, 41, 230, 41, 41, 230, 41, 230, 41, 41, 41,
230, 230, 230, 41, 230, 41, 230, 41, 41, 41, 41, 41, 41, 230, 41, 230,
230, 230, 230, 230, 230, 41, 230, 41, 230, 41, 41, 230, 41, 230, 41, 230,
41, 138, 138, 138, 138, 138, 138, 138, 41, 41, 41, 41, 41, 41, 41, 41,
41, 230, 41, 138, 41, 138, 41, 138, 41, 41, 230, 41, 230, 41, 230, 41,
230, 41, 41, 41, 41, 41, 41, 41, 41, 230, 230, 41, 230, 41, 230, 41,
230, 41, 230, 230, 41, 230, 41, 230, 41, 230, 230, 41, 230, 230, 230, 41,
138, 138, 138, 138, 138, 41, 138, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 230, 41, 230, 41, 230, 41, 230, 41,
230, 41, 230, 41, 230, 41, 41, 41, 230, 41, 230, 41, 230, 41, 230, 41,
41, 230, 41, 230, 41, 230, 41, 230, 230, 41, 230, 41, 230, 41, 230, 230,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 230, 41, 41, 41, 230, 41, 230, 41, 41, 41, 230, 41,
41, 41, 41, 41, 41, 230, 41, 41, 230, 41, 230, 41, 230, 41, 41, 230,
41, 230, 41, 41, 41, 41, 230, 41, 230, 41, 230, 230, 230, 41, 41, 41,
41, 41, 41, 41, 41, 41, 236, 61, 41, 41, 41, 41, 41, 143, 191, 160,
41, 41, 41, 41, 41, 138, 125, 160, 41, 41, 41, 41, 41, 138, 27, 123,
41, 41, 41, 41, 41, 85, 81, 19, 41, 41, 41, 41, 41, 249, 81, 19,
41, 41, 41, 41, 41, 174, 61, 56, 41, 41, 41, 41, 230, 174, 61, 16,
54, 123, 99, 92, 83, 202, 178, 84, 15, 1, 10, 116, 69, 230, 84, 84,
16, 57, 22, 131, 34, 230, 84, 163, 18, 1, 87, 141, 109, 41, 109, 84,
56, 45, 71, 122, 143, 138, 84, 163, 56, 99, 73, 149, 41, 40, 84, 84,
19, 35, 73, 83, 41, 40, 109, 84, 123, 10, 60, 69, 238, 40, 84, 163,
84, 125, 67, 15, 18, 16, 15, 18, 33, 125, 67, 54, 15, 16, 15, 15,
33, 125, 19, 16, 15, 16, 15, 16, 163, 179, 19, 15, 15, 16, 16, 63,
33, 125, 56, 16, 18, 15, 54, 56, 163, 191, 19, 15, 15, 16, 15, 56,
33, 191, 16, 16, 18, 16, 15, 56, 109, 191, 56, 18, 15, 15, 15, 19,
4, 4, 4, 4, 4, 4, 7, 119, 4, 4, 4, 4, 4, 4, 7, 119,
4, 4, 4, 4, 4, 4, 4, 119, 4, 4, 4, 4, 4, 4, 4, 118,
4, 4, 4, 4, 4, 4, 4, 7, 4, 4, 4, 4, 4, 4, 4, 7,
4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4,
119, 8, 8, 54, 56, 19, 14, 14, 119, 119, 8, 8, 56, 56, 19, 123,
119, 119, 119, 8, 18, 56, 56, 123, 119, 119, 119, 91, 8, 15, 16, 19,
119, 119, 119, 119, 8, 8, 15, 56, 119, 119, 119, 119, 119, 8, 8, 16,
119, 119, 119, 119, 119, 119, 119, 8, 118, 119, 119, 119, 119, 119, 119, 119,
2, 9, 17, 17, 17, 17, 17, 2, 14, 123, 17, 17, 17, 17, 17, 17,
123, 123, 2, 17, 17, 17, 17, 17, 19, 67, 123, 123, 2, 2, 17, 17,
56, 19, 133, 14, 14, 2, 2, 2, 56, 56, 19, 67, 14, 123, 14, 2,
8, 15, 56, 56, 56, 19, 19, 19, 8, 8, 15, 16, 56, 56, 56, 19,
17, 17, 1, 2, 17, 1, 17, 57, 17, 2, 17, 1, 17, 2, 17, 17,
1, 17, 1, 2, 17, 1, 17, 1, 17, 1, 17, 17, 1, 17, 1, 17,
2, 2, 2, 17, 17, 17, 2, 2, 2, 2, 2, 2, 14, 14, 14, 123,
67, 67, 67, 67, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 56, 56,
17, 1, 17, 2, 17, 1, 17, 17, 57, 17, 1, 17, 1, 17, 1, 2,
17, 1, 17, 17, 2, 17, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 14, 14, 2, 123, 133, 67, 123, 123, 123, 14, 67, 67, 67, 56,
19, 19, 19, 19, 56, 18, 18, 18, 56, 56, 56, 56, 54, 86, 86, 86,
17, 1, 17, 9, 2, 9, 2, 9, 9, 2, 2, 2, 9, 14, 123, 123,
17, 2, 9, 2, 14, 67, 67, 67, 123, 67, 67, 67, 67, 19, 56, 18,
67, 67, 19, 56, 89, 56, 89, 18, 56, 56, 89, 18, 86, 86, 86, 86,
86, 86, 86, 127, 113, 113, 5, 4, 127, 91, 107, 5, 5, 5, 4, 4,
9, 123, 9, 123, 123, 9, 123, 112, 67, 123, 67, 67, 67, 19, 67, 19,
67, 67, 67, 19, 19, 19, 67, 56, 56, 18, 18, 18, 54, 54, 86, 86,
86, 86, 54, 54, 86, 91, 91, 58, 86, 91, 58, 7, 7, 7, 7, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
67, 112, 152, 152, 152, 152, 152, 152, 67, 100, 152, 147, 152, 147, 147, 147,
89, 89, 89, 147, 147, 147, 147, 117, 86, 89, 127, 117, 117, 127, 117, 117,
91, 91, 127, 113, 113, 127, 127, 127, 5, 5, 107, 107, 113, 113, 127, 107,
4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 5,
152, 147, 4, 4, 4, 4, 4, 4, 147, 147, 107, 4, 4, 4, 4, 4,
147, 117, 107, 4, 4, 4, 4, 4, 117, 117, 107, 4, 4, 4, 4, 4,
127, 127, 127, 4, 4, 4, 4, 4, 113, 113, 113, 4, 4, 4, 4, 4,
107, 107, 7, 4, 4, 4, 4, 4, 5, 5, 5, 4, 4, 4, 4, 4,
4, 175, 100, 100, 45, 44, 87, 132, 4, 175, 132, 132, 133, 46, 98, 14,
4, 62, 190, 190, 170, 102, 116, 87, 4, 64, 190, 190, 190, 61, 116, 44,
4, 64, 190, 190, 190, 17, 98, 116, 4, 64, 190, 190, 190, 120, 98, 13,
4, 64, 190, 190, 132, 136, 87, 98, 4, 64, 190, 190, 132, 132, 52, 74,
132, 190, 55, 180, 170, 120, 120, 45, 175, 132, 94, 180, 160, 160, 120, 120,
64, 100, 133, 55, 103, 160, 45, 45, 142, 132, 136, 250, 45, 103, 120, 120,
8, 175, 190, 103, 55, 160, 120, 45, 56, 62, 190, 100, 55, 45, 120, 120,
55, 86, 175, 190, 55, 55, 45, 120, 49, 132, 190, 132, 11, 180, 160, 120,
45, 99, 13, 74, 10, 94, 23, 12, 10, 99, 101, 13, 10, 10, 157, 59,
99, 10, 99, 76, 52, 36, 10, 88, 10, 99, 10, 82, 50, 157, 10, 82,
99, 99, 10, 88, 101, 13, 36, 10, 10, 99, 10, 102, 157, 13, 20, 10,
45, 10, 10, 52, 10, 88, 98, 82, 35, 99, 99, 87, 10, 10, 13, 46,
25, 25, 25, 25, 25, 25, 50, 25, 25, 25, 50, 25, 25, 25, 50, 50,
25, 25, 50, 25, 25, 25, 50, 50, 25, 25, 50, 25, 25, 25, 50, 50,
46, 50, 25, 50, 25, 25, 25, 50, 52, 50, 25, 50, 25, 25, 25, 50,
82, 87, 25, 25, 25, 25, 25, 25, 82, 23, 25, 25, 25, 25, 25, 50,
98, 13, 53, 21, 23, 12, 25, 50, 98, 13, 102, 21, 21, 87, 25, 50,
98, 49, 102, 82, 22, 21, 50, 50, 26, 128, 46, 157, 22, 21, 46, 50,
24, 59, 13, 92, 22, 65, 65, 46, 50, 59, 13, 13, 21, 75, 21, 52,
50, 76, 13, 49, 87, 36, 65, 21, 24, 12, 13, 51, 44, 102, 21, 21,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
24, 25, 50, 50, 25, 50, 50, 50, 25, 25, 24, 25, 25, 50, 50, 50,
74, 24, 25, 50, 50, 50, 50, 50, 87, 24, 25, 25, 25, 50, 50, 50,
50, 50, 50, 116, 131, 98, 48, 192, 50, 50, 24, 13, 126, 98, 37, 192,
50, 50, 50, 98, 131, 128, 92, 115, 50, 50, 50, 24, 131, 26, 98, 69,
50, 50, 25, 24, 13, 50, 26, 183, 50, 50, 24, 24, 44, 128, 26, 183,
50, 50, 98, 50, 98, 24, 50, 37, 50, 50, 50, 26, 98, 98, 74, 92,
192, 192, 166, 166, 158, 241, 241, 240, 158, 192, 166, 166, 166, 241, 241, 239,
174, 192, 192, 166, 166, 174, 241, 207, 139, 192, 192, 166, 166, 166, 158, 242,
38, 192, 158, 166, 166, 166, 174, 158, 176, 192, 192, 192, 166, 166, 166, 166,
183, 158, 192, 166, 174, 166, 166, 174, 83, 139, 166, 174, 192, 166, 166, 166,
124, 121, 141, 185, 43, 43, 199, 199, 241, 146, 146, 185, 43, 43, 199, 199,
241, 43, 141, 121, 231, 43, 199, 43, 241, 192, 122, 146, 141, 185, 185, 185,
242, 239, 241, 121, 146, 141, 231, 231, 158, 239, 238, 149, 141, 141, 161, 141,
166, 169, 242, 167, 83, 141, 121, 141, 166, 166, 158, 240, 115, 141, 146, 141,
199, 199, 185, 141, 141, 139, 41, 105, 199, 43, 231, 161, 141, 69, 165, 40,
43, 161, 141, 231, 161, 141, 34, 41, 185, 141, 141, 161, 141, 83, 139, 42,
141, 141, 161, 141, 141, 42, 41, 42, 141, 161, 161, 141, 69, 41, 40, 42,
161, 141, 146, 148, 42, 70, 97, 109, 161, 146, 161, 41, 70, 70, 70, 42,
41, 42, 42, 143, 143, 143, 143, 143, 41, 138, 42, 143, 238, 143, 143, 143,
42, 138, 97, 143, 240, 242, 242, 143, 105, 138, 97, 242, 240, 242, 143, 143,
97, 97, 207, 239, 240, 238, 143, 242, 42, 97, 169, 238, 240, 238, 143, 143,
41, 42, 143, 29, 242, 240, 242, 143, 130, 41, 238, 38, 166, 240, 242, 143,
143, 143, 41, 41, 41, 41, 41, 41, 143, 143, 143, 41, 41, 41, 41, 41,
143, 143, 143, 41, 41, 41, 41, 41, 143, 143, 143, 41, 41, 41, 41, 41,
143, 143, 143, 41, 41, 41, 41, 41, 143, 143, 41, 41, 41, 41, 41, 41,
143, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
230, 230, 230, 41, 230, 41, 230, 41, 230, 230, 230, 230, 41, 230, 41, 230,
230, 230, 230, 41, 230, 41, 230, 41, 230, 230, 230, 230, 41, 230, 230, 41,
230, 230, 230, 230, 41, 230, 41, 41, 230, 230, 230, 41, 230, 41, 230, 230,
230, 230, 230, 41, 230, 230, 41, 230, 230, 230, 230, 230, 41, 41, 230, 230,
230, 41, 230, 230, 230, 41, 230, 230, 41, 230, 41, 230, 41, 230, 230, 41,
230, 41, 230, 41, 230, 230, 41, 230, 230, 41, 230, 230, 41, 230, 230, 41,
230, 230, 230, 41, 230, 41, 230, 230, 41, 230, 41, 230, 230, 230, 230, 230,
230, 230, 230, 41, 230, 230, 230, 230, 41, 230, 41, 230, 230, 41, 230, 230,
41, 230, 41, 230, 41, 230, 41, 230, 230, 230, 230, 230, 230, 41, 230, 41,
230, 41, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230, 41, 230, 230,
41, 230, 230, 41, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
41, 230, 41, 230, 230, 41, 230, 230, 230, 41, 230, 230, 230, 230, 41, 230,
230, 230, 230, 41, 230, 41, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 41, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 41, 230, 41, 230, 41, 230, 41, 41, 230, 41, 230, 41, 230, 41, 230,
41, 230, 230, 41, 230, 41, 230, 41, 230, 230, 41, 230, 230, 230, 41, 230,
202, 41, 230, 230, 41, 41, 230, 202, 230, 230, 202, 230, 202, 230, 230, 230,
41, 230, 230, 41, 230, 143, 230, 41, 230, 41, 230, 230, 230, 230, 202, 230,
41, 230, 41, 41, 230, 41, 230, 41, 41, 230, 41, 230, 41, 230, 41, 230,
230, 41, 230, 41, 230, 41, 230, 41, 41, 230, 41, 230, 41, 230, 41, 230,
41, 230, 41, 230, 41, 230, 41, 230, 230, 230, 230, 41, 230, 41, 41, 230,
202, 41, 230, 230, 41, 230, 41, 230, 230, 230, 202, 230, 41, 230, 41, 230,
230, 41, 230, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 230, 41, 230, 41, 41, 41, 41, 41, 41, 41, 41, 230, 41, 41, 41,
41, 41, 230, 41, 41, 41, 41, 41, 41, 41, 41, 41, 230, 41, 230, 41,
230, 41, 230, 230, 41, 41, 41, 41, 41, 230, 41, 230, 41, 230, 143, 230,
41, 41, 41, 41, 41, 174, 45, 18, 41, 41, 41, 41, 230, 192, 160, 16,
41, 41, 41, 41, 138, 192, 14, 16, 41, 41, 41, 41, 138, 179, 14, 16,
41, 41, 41, 202, 178, 179, 67, 56, 230, 41, 41, 143, 85, 179, 56, 19,
41, 230, 230, 41, 249, 61, 16, 67, 143, 41, 41, 230, 249, 35, 56, 57,
9, 52, 110, 30, 202, 84, 163, 84, 57, 46, 149, 165, 230, 178, 33, 84,
99, 71, 83, 230, 143, 84, 109, 163, 82, 73, 34, 202, 42, 85, 163, 84,
102, 110, 30, 202, 138, 85, 33, 163, 87, 37, 247, 143, 138, 84, 84, 163,
46, 83, 230, 41, 41, 84, 84, 163, 92, 69, 202, 41, 96, 163, 84, 33,
109, 191, 16, 15, 16, 15, 15, 19, 109, 191, 19, 16, 16, 15, 15, 133,
148, 179, 56, 54, 15, 16, 15, 123, 148, 179, 56, 15, 16, 18, 15, 1,
148, 179, 56, 15, 16, 15, 16, 1, 148, 179, 56, 15, 15, 15, 16, 1,
148, 179, 16, 15, 16, 15, 16, 45, 174, 179, 56, 15, 54, 16, 16, 35,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 7,
4, 4, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 119, 119, 119, 119, 119, 119, 119, 4, 119, 119, 119, 58, 119, 119, 119,
4, 119, 119, 119, 119, 119, 119, 119, 4, 78, 119, 119, 119, 119, 119, 119,
4, 7, 78, 119, 119, 119, 119, 119, 7, 5, 7, 119, 119, 119, 119, 119,
7, 7, 7, 7, 119, 119, 119, 119, 7, 118, 118, 7, 119, 58, 58, 119,
119, 8, 8, 15, 15, 16, 56, 56, 119, 91, 91, 119, 8, 8, 8, 8,
119, 119, 119, 58, 135, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119,
119, 119, 58, 119, 119, 119, 119, 78, 119, 58, 58, 58, 119, 119, 119, 118,
119, 58, 119, 119, 58, 119, 119, 118, 119, 119, 119, 119, 119, 119, 119, 118,
56, 56, 56, 56, 56, 56, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8,
86, 8, 86, 8, 86, 8, 91, 119, 119, 58, 58, 119, 91, 91, 91, 119,
4, 4, 118, 78, 7, 7, 119, 118, 4, 118, 78, 7, 7, 58, 119, 7,
4, 7, 78, 58, 58, 119, 7, 7, 7, 118, 119, 119, 119, 78, 118, 119,
16, 15, 54, 86, 86, 127, 91, 107, 8, 8, 91, 91, 58, 7, 5, 4,
91, 119, 58, 5, 7, 5, 4, 4, 119, 7, 6, 5, 5, 5, 4, 4,
7, 6, 58, 7, 5, 4, 4, 4, 5, 58, 78, 7, 5, 4, 4, 4,
7, 58, 7, 5, 4, 4, 4, 4, 58, 5, 7, 6, 4, 4, 4, 4,
107, 107, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4,
4, 4, 4, 142, 4, 4, 4, 4, 4, 7, 119, 64, 4, 4, 4, 4,
4, 64, 132, 190, 190, 190, 157, 52, 4, 64, 132, 190, 190, 190, 36, 11,
4, 142, 190, 190, 190, 190, 10, 82, 4, 142, 190, 190, 190, 190, 10, 10,
4, 135, 190, 100, 190, 190, 94, 10, 4, 78, 190, 100, 190, 190, 99, 10,
4, 5, 190, 190, 190, 190, 35, 10, 4, 4, 190, 132, 190, 190, 45, 10,
49, 55, 132, 170, 120, 180, 120, 120, 12, 26, 175, 132, 133, 55, 45, 120,
59, 128, 120, 175, 170, 45, 11, 45, 87, 24, 250, 190, 190, 103, 180, 45,
102, 52, 180, 94, 170, 170, 180, 157, 20, 52, 55, 55, 100, 170, 11, 55,
10, 22, 112, 57, 61, 170, 14, 55, 157, 82, 100, 127, 180, 120, 103, 157,
45, 99, 10, 87, 10, 10, 52, 13, 35, 99, 10, 87, 10, 10, 82, 98,
45, 10, 10, 59, 10, 10, 10, 10, 120, 45, 20, 59, 10, 10, 20, 10,
99, 45, 22, 46, 10, 10, 82, 36, 1, 45, 102, 76, 10, 10, 10, 82,
144, 99, 23, 46, 10, 10, 94, 94, 157, 45, 11, 76, 10, 10, 10, 82,
82, 36, 50, 26, 50, 25, 25, 128, 87, 36, 76, 26, 25, 25, 25, 128,
13, 46, 23, 74, 25, 25, 25, 50, 49, 49, 82, 46, 25, 25, 25, 50,
82, 46, 76, 21, 50, 25, 25, 25, 10, 102, 13, 11, 24, 50, 25, 25,
10, 10, 87, 13, 11, 74, 25, 50, 82, 20, 102, 98, 23, 46, 26, 26,
50, 50, 44, 44, 13, 13, 36, 21, 50, 25, 44, 44, 12, 116, 21, 20,
24, 25, 49, 13, 25, 74, 13, 102, 25, 25, 128, 13, 25, 24, 13, 46,
50, 24, 12, 13, 24, 26, 98, 13, 24, 25, 12, 13, 24, 25, 50, 98,
50, 50, 26, 128, 44, 25, 26, 74, 25, 50, 12, 74, 13, 98, 50, 50,
36, 52, 24, 50, 50, 50, 50, 50, 21, 22, 25, 50, 50, 50, 50, 50,
36, 36, 46, 128, 24, 25, 25, 25, 21, 22, 52, 12, 24, 25, 25, 25,
22, 21, 36, 52, 12, 50, 25, 50, 46, 36, 36, 82, 87, 24, 25, 50,
13, 46, 22, 21, 21, 74, 24, 50, 44, 13, 35, 22, 36, 46, 128, 50,
50, 50, 25, 25, 128, 44, 25, 26, 50, 50, 25, 25, 50, 13, 128, 24,
24, 25, 24, 24, 24, 13, 98, 25, 25, 25, 24, 24, 25, 13, 44, 50,
25, 24, 12, 50, 25, 13, 13, 24, 25, 25, 24, 50, 25, 13, 116, 50,
25, 24, 74, 25, 74, 49, 116, 25, 74, 26, 50, 24, 12, 24, 13, 128,
37, 38, 192, 192, 174, 166, 166, 166, 24, 176, 139, 192, 192, 166, 166, 166,
25, 176, 176, 233, 192, 192, 166, 166, 98, 83, 176, 192, 192, 192, 166, 166,
50, 98, 176, 139, 174, 192, 192, 166, 25, 26, 37, 69, 174, 192, 192, 158,
50, 12, 26, 176, 34, 158, 192, 166, 12, 12, 26, 176, 69, 174, 192, 166,
166, 166, 96, 169, 238, 149, 161, 161, 166, 166, 130, 66, 97, 43, 149, 141,
166, 166, 66, 130, 66, 97, 166, 83, 166, 166, 166, 66, 66, 130, 42, 32,
166, 166, 166, 174, 171, 66, 70, 97, 166, 166, 166, 171, 174, 171, 66, 242,
174, 174, 174, 171, 174, 130, 130, 130, 109, 174, 171, 171, 171, 174, 130, 169,
141, 83, 33, 66, 169, 41, 42, 70, 146, 139, 84, 242, 184, 66, 105, 42,
83, 143, 240, 4, 239, 40, 70, 70, 171, 240, 108, 108, 238, 66, 70, 66,
193, 4, 4, 240, 138, 40, 178, 109, 193, 4, 4, 238, 40, 40, 85, 178,
143, 184, 108, 238, 41, 40, 109, 84, 97, 39, 178, 202, 138, 40, 178, 84,
42, 143, 143, 38, 96, 240, 143, 242, 42, 97, 242, 176, 114, 240, 143, 143,
40, 42, 207, 38, 97, 240, 242, 41, 66, 42, 97, 38, 97, 238, 143, 41,
70, 42, 40, 34, 143, 242, 41, 41, 84, 40, 114, 28, 143, 242, 41, 41,
84, 40, 32, 30, 238, 242, 41, 41, 84, 70, 28, 148, 242, 143, 41, 40,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 230, 41, 41, 41, 41, 41, 41, 41, 230,
230, 230, 230, 41, 230, 230, 230, 41, 230, 230, 230, 41, 230, 41, 230, 230,
41, 41, 230, 41, 230, 230, 230, 41, 41, 41, 230, 230, 230, 230, 230, 230,
41, 41, 230, 230, 230, 230, 230, 230, 41, 41, 230, 230, 230, 230, 230, 230,
41, 41, 230, 230, 230, 230, 230, 230, 41, 41, 230, 230, 230, 230, 230, 230,
230, 41, 230, 41, 230, 230, 230, 230, 230, 230, 41, 230, 230, 41, 230, 230,
230, 230, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
202, 41, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 202, 230, 202, 202, 202, 230, 230, 230,
202, 230, 230, 138, 178, 230, 230, 230, 230, 230, 138, 33, 33, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 143, 230, 202, 41, 230, 230, 41, 202, 230, 230, 41, 230, 41, 230,
230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
41, 230, 230, 41, 202, 41, 230, 41, 230, 41, 230, 230, 41, 230, 41, 230,
202, 230, 41, 230, 230, 41, 230, 41, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
202, 41, 230, 41, 230, 41, 41, 41, 41, 230, 41, 230, 41, 41, 230, 41,
230, 41, 230, 41, 41, 41, 143, 41, 230, 230, 230, 230, 41, 41, 41, 41,
230, 230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 230, 41, 41, 41, 41,
230, 230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 230, 41, 41, 41, 41,
41, 41, 41, 41, 192, 35, 16, 35, 230, 41, 230, 230, 236, 1, 56, 22,
143, 41, 143, 230, 192, 57, 56, 87, 41, 41, 41, 143, 174, 61, 16, 1,
41, 41, 41, 143, 191, 35, 16, 102, 41, 41, 41, 41, 179, 36, 19, 87,
41, 41, 41, 230, 179, 1, 1, 73, 41, 41, 41, 202, 179, 123, 61, 73,
73, 129, 202, 41, 138, 109, 84, 178, 37, 109, 230, 41, 40, 109, 33, 178,
48, 105, 41, 41, 85, 84, 84, 163, 111, 139, 41, 143, 143, 33, 84, 84,
69, 42, 41, 41, 41, 84, 84, 84, 34, 41, 41, 41, 41, 84, 84, 84,
109, 41, 143, 41, 40, 109, 84, 84, 105, 202, 41, 41, 40, 109, 33, 84,
174, 179, 18, 15, 16, 15, 56, 35, 174, 179, 18, 15, 16, 15, 56, 36,
236, 179, 16, 15, 18, 15, 19, 36, 163, 191, 17, 15, 15, 15, 15, 35,
178, 125, 2, 15, 15, 16, 15, 35, 40, 125, 45, 15, 15, 16, 15, 36,
41, 125, 1, 18, 15, 18, 16, 36, 138, 125, 1, 18, 15, 16, 56, 82,
7, 7, 118, 118, 118, 118, 7, 7, 5, 7, 118, 118, 118, 118, 118, 118,
7, 7, 7, 118, 118, 118, 78, 78, 118, 118, 7, 118, 118, 78, 119, 119,
119, 78, 118, 7, 118, 78, 119, 119, 119, 119, 119, 78, 78, 78, 119, 119,
119, 119, 119, 119, 191, 124, 233, 119, 119, 119, 233, 121, 151, 151, 151, 137,
118, 118, 78, 118, 78, 119, 119, 58, 118, 78, 78, 118, 118, 119, 119, 58,
78, 119, 119, 119, 118, 7, 7, 119, 119, 119, 119, 119, 78, 7, 4, 78,
119, 119, 119, 119, 119, 7, 7, 7, 119, 58, 119, 119, 119, 119, 119, 3,
119, 119, 119, 119, 119, 119, 119, 78, 191, 119, 119, 119, 119, 119, 119, 78,
119, 119, 119, 119, 119, 119, 119, 7, 119, 119, 119, 119, 119, 119, 119, 7,
119, 119, 58, 58, 119, 78, 7, 5, 119, 119, 58, 119, 119, 7, 4, 7,
7, 78, 119, 119, 119, 5, 4, 7, 4, 4, 7, 118, 119, 118, 119, 119,
7, 7, 4, 119, 187, 119, 233, 233, 78, 192, 146, 151, 48, 43, 151, 151,
58, 58, 119, 119, 7, 7, 119, 58, 58, 119, 119, 7, 5, 7, 58, 119,
119, 119, 7, 78, 119, 119, 119, 119, 119, 58, 7, 119, 119, 119, 78, 7,
119, 7, 7, 119, 119, 119, 4, 4, 119, 119, 119, 58, 7, 4, 4, 4,
119, 119, 119, 5, 4, 4, 4, 4, 78, 7, 7, 4, 4, 4, 4, 4,
119, 58, 4, 4, 4, 4, 4, 4, 58, 6, 4, 4, 4, 4, 4, 4,
6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 233, 233, 192, 233, 192, 4, 4, 6, 154, 151, 151, 121, 137,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
192, 4, 192, 192, 192, 233, 192, 191, 151, 125, 151, 151, 151, 151, 151, 151,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 108, 187, 4, 4, 4, 4, 124, 111, 150, 122, 4, 4, 4, 4,
4, 78, 118, 132, 4, 4, 4, 4, 4, 7, 4, 132, 4, 4, 4, 4,
4, 4, 4, 132, 4, 4, 4, 4, 4, 4, 4, 132, 4, 4, 4, 4,
4, 4, 4, 4, 142, 4, 4, 4, 4, 4, 4, 4, 62, 4, 4, 4,
4, 4, 4, 4, 132, 4, 4, 4, 4, 4, 4, 4, 175, 4, 4, 4,
4, 4, 190, 132, 190, 190, 120, 10, 4, 4, 190, 132, 190, 190, 120, 10,
4, 4, 190, 190, 190, 132, 120, 10, 4, 4, 190, 190, 100, 132, 160, 10,
4, 4, 190, 132, 190, 190, 170, 99, 4, 4, 190, 190, 190, 190, 170, 10,
4, 4, 190, 190, 190, 190, 170, 45, 4, 4, 175, 190, 190, 190, 190, 99,
10, 157, 90, 193, 98, 13, 170, 45, 10, 157, 173, 108, 95, 49, 120, 103,
94, 10, 142, 4, 135, 65, 157, 103, 250, 10, 62, 4, 90, 62, 180, 35,
55, 157, 142, 4, 7, 78, 50, 26, 180, 157, 142, 4, 5, 78, 253, 49,
49, 157, 64, 4, 4, 4, 142, 253, 13, 55, 64, 4, 4, 4, 135, 170,
180, 99, 87, 76, 10, 10, 10, 10, 50, 157, 52, 76, 10, 10, 10, 94,
76, 180, 52, 76, 10, 10, 10, 10, 11, 49, 87, 76, 10, 235, 10, 10,
120, 52, 26, 76, 82, 10, 10, 10, 35, 10, 49, 76, 20, 10, 10, 94,
180, 45, 13, 74, 82, 10, 10, 10, 50, 10, 13, 49, 10, 10, 10, 94,
157, 36, 36, 82, 13, 76, 25, 25, 82, 20, 20, 82, 50, 49, 25, 128,
20, 20, 20, 36, 22, 76, 50, 25, 20, 36, 22, 20, 36, 102, 49, 98,
82, 82, 82, 20, 82, 20, 76, 13, 82, 82, 82, 20, 82, 22, 22, 74,
10, 82, 82, 20, 36, 20, 22, 21, 10, 82, 82, 20, 36, 20, 20, 22,
26, 50, 12, 12, 13, 98, 24, 50, 25, 50, 12, 25, 13, 44, 24, 24,
25, 24, 50, 24, 13, 13, 25, 50, 12, 25, 50, 25, 13, 44, 25, 24,
24, 50, 12, 12, 44, 73, 26, 50, 98, 24, 24, 24, 13, 13, 26, 50,
49, 13, 74, 24, 50, 44, 50, 50, 87, 13, 74, 25, 50, 44, 98, 50,
50, 24, 71, 65, 21, 36, 87, 24, 12, 12, 13, 46, 35, 65, 23, 128,
50, 24, 24, 13, 98, 36, 22, 87, 128, 25, 25, 98, 13, 22, 21, 52,
50, 50, 50, 50, 24, 13, 23, 21, 50, 50, 50, 50, 50, 13, 44, 21,
50, 50, 50, 50, 50, 24, 98, 71, 50, 50, 50, 50, 50, 50, 12, 134,
25, 50, 50, 24, 74, 50, 13, 98, 25, 24, 50, 25, 24, 25, 44, 98,
128, 25, 50, 25, 24, 25, 98, 98, 74, 25, 50, 50, 50, 25, 24, 13,
23, 24, 25, 50, 50, 24, 12, 13, 21, 50, 24, 24, 50, 24, 25, 13,
22, 52, 12, 25, 25, 25, 50, 73, 87, 65, 87, 25, 25, 25, 50, 44,
50, 50, 50, 92, 176, 192, 158, 192, 50, 50, 50, 50, 83, 174, 174, 174,
50, 74, 26, 98, 37, 115, 192, 192, 50, 24, 26, 24, 71, 38, 236, 174,
98, 24, 26, 24, 25, 83, 176, 192, 98, 12, 25, 24, 74, 37, 176, 192,
13, 25, 24, 50, 76, 44, 83, 139, 13, 25, 24, 50, 76, 26, 37, 69,
192, 166, 174, 47, 34, 31, 47, 70, 192, 174, 166, 38, 28, 47, 47, 70,
166, 174, 129, 47, 32, 47, 31, 130, 166, 174, 34, 47, 129, 47, 31, 203,
129, 129, 28, 29, 171, 47, 30, 32, 174, 129, 38, 31, 33, 47, 39, 32,
192, 34, 38, 32, 174, 28, 31, 114, 192, 38, 38, 32, 171, 47, 32, 32,
42, 47, 40, 41, 40, 178, 84, 84, 70, 39, 40, 40, 40, 84, 84, 84,
31, 70, 40, 84, 178, 84, 84, 84, 31, 84, 70, 163, 178, 84, 84, 114,
39, 84, 84, 84, 84, 84, 84, 114, 31, 84, 84, 84, 84, 114, 148, 114,
32, 114, 148, 114, 114, 114, 114, 70, 114, 148, 148, 114, 114, 114, 114, 70,
84, 148, 28, 105, 242, 143, 207, 207, 114, 148, 38, 42, 242, 40, 40, 40,
114, 148, 34, 38, 38, 33, 33, 33, 114, 70, 70, 176, 176, 38, 29, 145,
114, 70, 40, 40, 145, 38, 176, 176, 84, 70, 66, 42, 42, 33, 39, 28,
70, 70, 84, 40, 40, 42, 41, 41, 70, 70, 40, 40, 40, 41, 42, 42,
40, 40, 40, 178, 178, 84, 178, 178, 84, 84, 33, 109, 33, 33, 33, 33,
33, 33, 33, 33, 145, 33, 33, 33, 145, 145, 145, 33, 145, 145, 145, 33,
38, 34, 33, 33, 145, 145, 145, 145, 38, 38, 38, 28, 145, 145, 145, 145,
41, 138, 33, 33, 145, 33, 33, 33, 41, 207, 143, 165, 33, 33, 33, 109,
138, 138, 41, 41, 41, 41, 41, 41, 178, 40, 138, 41, 41, 41, 41, 41,
33, 33, 178, 138, 41, 41, 41, 230, 33, 33, 178, 40, 41, 41, 41, 41,
145, 33, 85, 138, 41, 41, 41, 230, 33, 33, 105, 41, 41, 41, 41, 230,
33, 178, 41, 41, 41, 41, 41, 41, 178, 40, 41, 41, 41, 41, 41, 41,
41, 41, 230, 230, 230, 230, 230, 230, 41, 41, 230, 230, 230, 230, 230, 230,
41, 41, 230, 230, 230, 41, 230, 230, 41, 41, 230, 230, 230, 230, 230, 230,
41, 41, 41, 230, 230, 230, 230, 230, 41, 41, 41, 41, 41, 230, 230, 230,
41, 41, 41, 41, 41, 230, 41, 230, 41, 41, 41, 41, 41, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 41, 230, 230, 202, 41, 230, 230, 85,
230, 202, 202, 230, 230, 138, 163, 38, 202, 230, 202, 230, 138, 33, 30, 38,
230, 138, 178, 69, 28, 247, 230, 230, 230, 230, 109, 83, 183, 247, 230, 230,
230, 163, 29, 83, 29, 230, 230, 230, 230, 178, 38, 176, 109, 230, 230, 230,
178, 38, 176, 230, 247, 230, 230, 230, 145, 69, 38, 230, 230, 230, 230, 230,
34, 33, 138, 230, 202, 230, 230, 230, 30, 40, 178, 202, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 202, 202, 202, 202, 202,
230, 230, 230, 202, 202, 202, 202, 202, 230, 230, 230, 202, 202, 202, 202, 202,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 202, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 230, 41, 41, 41, 41,
230, 230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 230, 41, 41, 41, 41,
230, 230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 230, 230, 41, 41, 230,
230, 230, 230, 230, 41, 41, 41, 230, 230, 230, 230, 41, 41, 41, 41, 41,
41, 41, 41, 41, 35, 133, 71, 111, 41, 41, 41, 230, 94, 19, 73, 43,
41, 41, 41, 41, 99, 56, 37, 129, 41, 41, 41, 138, 35, 133, 48, 40,
41, 41, 41, 249, 45, 10, 69, 84, 143, 143, 230, 192, 35, 87, 34, 41,
41, 143, 41, 191, 99, 92, 105, 202, 41, 41, 41, 125, 88, 110, 85, 202,
143, 41, 41, 41, 40, 33, 33, 85, 143, 41, 41, 138, 40, 33, 84, 85,
41, 41, 41, 40, 178, 33, 33, 105, 41, 41, 41, 40, 109, 33, 33, 105,
41, 41, 41, 40, 109, 33, 109, 138, 41, 41, 41, 84, 84, 33, 33, 138,
41, 41, 40, 84, 33, 33, 84, 41, 41, 41, 40, 84, 33, 33, 84, 41,
41, 81, 1, 16, 16, 16, 56, 36, 41, 81, 2, 16, 16, 16, 19, 36,
41, 125, 2, 15, 16, 18, 19, 36, 41, 125, 57, 15, 18, 16, 19, 36,
41, 125, 1, 15, 54, 16, 14, 10, 41, 125, 45, 18, 16, 56, 17, 10,
41, 125, 35, 16, 16, 19, 35, 82, 41, 125, 35, 16, 15, 19, 35, 36,
119, 119, 121, 151, 111, 233, 181, 151, 119, 191, 151, 151, 125, 119, 187, 111,
119, 191, 151, 151, 43, 119, 119, 119, 8, 142, 150, 151, 150, 125, 192, 43,
15, 8, 27, 151, 151, 151, 151, 151, 63, 15, 86, 190, 48, 111, 43, 233,
19, 56, 56, 16, 15, 16, 86, 8, 19, 19, 19, 56, 56, 16, 15, 15,
48, 119, 192, 43, 124, 187, 119, 119, 125, 43, 151, 159, 151, 137, 233, 111,
187, 151, 151, 187, 137, 151, 48, 151, 124, 151, 151, 191, 122, 151, 111, 151,
191, 121, 151, 146, 137, 137, 233, 122, 119, 187, 48, 111, 48, 187, 119, 187,
119, 91, 58, 119, 119, 119, 119, 119, 8, 8, 119, 119, 58, 119, 119, 119,
124, 43, 121, 151, 111, 233, 111, 48, 151, 159, 150, 151, 111, 111, 151, 151,
151, 191, 122, 151, 111, 191, 151, 151, 151, 192, 122, 151, 37, 233, 151, 151,
151, 121, 150, 151, 146, 43, 151, 151, 48, 48, 43, 111, 124, 124, 111, 111,
119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119,
78, 119, 125, 191, 191, 43, 119, 7, 233, 150, 151, 137, 151, 151, 141, 58,
233, 111, 151, 111, 124, 151, 137, 233, 233, 111, 151, 111, 191, 151, 150, 107,
125, 121, 151, 153, 43, 151, 151, 43, 191, 48, 181, 48, 125, 181, 111, 125,
119, 135, 58, 58, 113, 107, 113, 191, 58, 58, 58, 113, 107, 113, 113, 107,
7, 125, 124, 192, 43, 187, 43, 125, 146, 154, 111, 151, 159, 125, 151, 150,
151, 141, 191, 151, 48, 78, 141, 48, 121, 137, 141, 111, 118, 118, 111, 43,
151, 146, 181, 141, 111, 125, 151, 151, 150, 159, 159, 151, 151, 192, 48, 124,
151, 111, 48, 151, 122, 5, 4, 4, 175, 27, 124, 191, 5, 5, 4, 4,
4, 4, 4, 125, 151, 146, 5, 191, 4, 4, 4, 236, 151, 137, 48, 154,
4, 4, 4, 191, 151, 151, 111, 154, 4, 4, 4, 125, 151, 137, 184, 125,
4, 4, 4, 111, 151, 151, 48, 48, 4, 4, 4, 43, 48, 43, 48, 43,
6, 4, 6, 4, 4, 6, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6,
48, 48, 150, 124, 151, 151, 43, 150, 4, 3, 233, 241, 151, 151, 192, 233,
4, 4, 4, 233, 151, 151, 191, 4, 191, 43, 4, 192, 151, 151, 192, 4,
150, 43, 7, 122, 151, 151, 122, 7, 111, 78, 4, 43, 111, 111, 43, 4,
4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4,
48, 122, 151, 111, 233, 43, 124, 5, 118, 43, 151, 111, 48, 151, 141, 119,
4, 48, 151, 151, 151, 150, 118, 4, 4, 48, 151, 150, 151, 151, 122, 4,
7, 141, 151, 154, 48, 151, 151, 122, 5, 48, 111, 48, 3, 124, 48, 124,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
118, 78, 78, 118, 7, 4, 4, 4, 5, 5, 5, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 8, 4, 4,
4, 4, 175, 190, 190, 190, 190, 45, 4, 4, 175, 190, 190, 190, 190, 45,
4, 4, 132, 132, 190, 190, 190, 120, 4, 4, 64, 132, 190, 190, 190, 120,
4, 4, 64, 132, 190, 190, 190, 160, 4, 4, 64, 132, 190, 190, 190, 170,
4, 4, 64, 132, 190, 190, 190, 160, 4, 4, 142, 132, 190, 190, 190, 132,
13, 180, 175, 4, 4, 4, 78, 62, 116, 26, 175, 4, 4, 4, 58, 135,
131, 50, 80, 4, 4, 4, 3, 91, 131, 49, 62, 4, 4, 4, 4, 58,
126, 49, 62, 4, 4, 4, 4, 58, 126, 44, 142, 4, 4, 4, 4, 3,
126, 44, 142, 4, 4, 4, 4, 108, 137, 60, 119, 4, 4, 4, 4, 4,
76, 13, 49, 13, 10, 10, 10, 10, 36, 180, 50, 49, 10, 10, 10, 10,
120, 157, 44, 49, 11, 10, 10, 10, 120, 57, 13, 13, 50, 250, 10, 10,
160, 57, 13, 13, 128, 11, 10, 10, 120, 57, 46, 49, 49, 128, 10, 10,
45, 35, 59, 76, 13, 49, 94, 10, 45, 99, 87, 87, 49, 49, 76, 82,
10, 10, 82, 20, 20, 36, 20, 20, 94, 10, 82, 20, 82, 21, 20, 20,
10, 10, 82, 82, 20, 20, 20, 20, 94, 10, 82, 82, 20, 20, 20, 20,
10, 10, 82, 82, 20, 20, 20, 20, 94, 10, 82, 82, 20, 20, 20, 20,
10, 10, 82, 82, 20, 20, 20, 20, 94, 10, 82, 82, 82, 20, 22, 22,
21, 11, 13, 24, 25, 98, 44, 50, 82, 21, 13, 13, 12, 98, 13, 50,
22, 21, 59, 13, 25, 24, 13, 98, 22, 21, 36, 52, 13, 49, 116, 44,
22, 22, 21, 22, 13, 13, 116, 13, 22, 22, 21, 65, 44, 13, 116, 134,
22, 22, 21, 65, 74, 44, 134, 131, 22, 21, 21, 65, 25, 25, 13, 126,
50, 50, 50, 50, 50, 24, 74, 49, 50, 50, 50, 50, 50, 50, 50, 25,
50, 24, 24, 74, 26, 50, 50, 25, 25, 50, 24, 74, 26, 50, 50, 24,
25, 25, 24, 74, 25, 50, 50, 50, 25, 25, 25, 50, 50, 50, 50, 50,
25, 50, 25, 50, 50, 50, 50, 50, 98, 24, 24, 24, 26, 50, 50, 50,
13, 52, 36, 74, 24, 50, 24, 13, 98, 71, 23, 59, 24, 24, 25, 13,
25, 13, 51, 23, 74, 12, 74, 49, 50, 25, 49, 87, 22, 24, 25, 24,
50, 25, 25, 49, 87, 12, 24, 25, 50, 25, 24, 25, 76, 76, 25, 26,
50, 50, 12, 24, 12, 180, 51, 25, 50, 50, 50, 25, 25, 12, 59, 44,
49, 24, 24, 25, 87, 50, 26, 176, 13, 24, 12, 25, 87, 24, 26, 176,
73, 25, 50, 25, 87, 24, 12, 83, 13, 24, 50, 76, 52, 24, 26, 128,
13, 98, 25, 46, 52, 25, 24, 51, 98, 44, 25, 87, 52, 25, 24, 26,
98, 73, 24, 52, 52, 24, 50, 25, 98, 126, 24, 21, 52, 50, 25, 25,
115, 69, 28, 171, 171, 28, 32, 114, 176, 69, 38, 171, 148, 47, 32, 114,
176, 38, 139, 236, 148, 29, 148, 148, 111, 38, 236, 174, 129, 129, 148, 148,
44, 69, 174, 174, 129, 129, 148, 148, 26, 141, 69, 174, 236, 129, 174, 171,
98, 161, 83, 174, 174, 129, 171, 171, 24, 59, 176, 139, 174, 174, 171, 174,
114, 148, 114, 114, 114, 203, 70, 70, 148, 114, 114, 114, 148, 203, 70, 70,
148, 148, 148, 148, 114, 70, 70, 70, 148, 148, 148, 171, 203, 70, 70, 40,
148, 171, 174, 203, 70, 70, 70, 42, 174, 171, 171, 70, 70, 70, 42, 42,
171, 171, 174, 70, 70, 42, 42, 42, 171, 174, 66, 66, 96, 42, 42, 42,
70, 40, 96, 41, 41, 96, 165, 41, 70, 42, 40, 40, 40, 40, 41, 41,
70, 42, 42, 42, 42, 41, 41, 41, 42, 42, 42, 42, 42, 41, 41, 41,
42, 42, 42, 42, 42, 41, 41, 41, 42, 42, 42, 42, 42, 42, 41, 41,
42, 42, 42, 42, 42, 42, 41, 41, 42, 42, 42, 42, 41, 41, 41, 42,
41, 41, 41, 41, 41, 41, 40, 40, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
138, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 178, 178,
41, 41, 41, 41, 41, 230, 230, 202, 41, 41, 41, 41, 41, 230, 230, 202,
41, 41, 41, 41, 202, 230, 138, 85, 202, 41, 230, 41, 230, 230, 230, 33,
230, 41, 41, 41, 202, 138, 30, 38, 41, 143, 202, 230, 41, 30, 38, 145,
41, 41, 178, 30, 38, 28, 163, 96, 33, 39, 38, 38, 38, 238, 238, 42,
230, 138, 138, 33, 39, 38, 28, 178, 41, 178, 33, 34, 38, 33, 84, 109,
33, 38, 38, 33, 178, 84, 148, 84, 28, 38, 28, 84, 84, 33, 148, 84,
30, 40, 84, 33, 33, 33, 109, 138, 138, 33, 33, 33, 145, 33, 84, 41,
109, 33, 84, 84, 84, 85, 138, 202, 84, 33, 33, 33, 33, 138, 230, 143,
178, 40, 41, 230, 230, 230, 230, 230, 109, 41, 230, 202, 230, 230, 230, 230,
105, 230, 230, 230, 230, 202, 202, 202, 40, 230, 230, 230, 230, 202, 202, 202,
230, 230, 230, 230, 230, 202, 202, 202, 230, 230, 230, 230, 230, 202, 202, 202,
230, 230, 230, 230, 230, 202, 202, 202, 230, 230, 230, 230, 230, 202, 202, 202,
230, 230, 230, 202, 202, 202, 202, 202, 230, 230, 230, 202, 202, 202, 202, 202,
202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,
202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,
202, 202, 202, 230, 230, 230, 230, 230, 202, 202, 202, 230, 230, 230, 230, 230,
202, 202, 202, 202, 230, 230, 230, 230, 202, 202, 202, 202, 230, 230, 230, 230,
230, 202, 202, 230, 230, 230, 230, 230, 230, 202, 202, 202, 230, 230, 230, 230,
230, 230, 230, 202, 202, 230, 230, 230, 230, 230, 230, 202, 202, 230, 230, 230,
230, 202, 202, 202, 230, 230, 230, 230, 230, 202, 202, 230, 230, 230, 230, 230,
230, 230, 41, 41, 41, 41, 41, 41, 230, 230, 41, 41, 41, 41, 41, 143,
230, 230, 230, 41, 41, 41, 143, 230, 230, 230, 230, 41, 41, 41, 143, 143,
230, 230, 230, 41, 41, 41, 41, 41, 230, 230, 230, 41, 41, 41, 230, 41,
230, 230, 230, 41, 41, 41, 143, 202, 230, 230, 230, 41, 41, 41, 143, 202,
41, 41, 66, 95, 46, 111, 230, 41, 41, 230, 174, 144, 73, 43, 202, 41,
138, 143, 236, 180, 111, 129, 230, 41, 230, 143, 179, 180, 43, 165, 41, 41,
202, 230, 250, 74, 34, 143, 41, 143, 202, 138, 11, 92, 32, 202, 41, 207,
143, 105, 87, 43, 138, 165, 41, 41, 143, 174, 76, 43, 230, 143, 41, 41,
41, 41, 85, 33, 33, 109, 70, 41, 143, 41, 109, 33, 33, 109, 40, 41,
41, 41, 109, 145, 33, 84, 42, 41, 41, 41, 109, 33, 33, 84, 41, 41,
41, 40, 33, 33, 109, 40, 41, 41, 41, 40, 33, 33, 109, 40, 41, 165,
138, 178, 33, 33, 33, 41, 41, 143, 40, 178, 145, 33, 33, 41, 41, 143,
143, 81, 45, 16, 16, 2, 36, 36, 143, 81, 45, 16, 16, 45, 94, 36,
41, 81, 1, 16, 15, 35, 82, 21, 41, 81, 1, 16, 16, 35, 10, 21,
41, 79, 1, 16, 56, 21, 36, 36, 41, 81, 57, 16, 19, 21, 36, 36,
41, 81, 57, 16, 67, 21, 21, 36, 41, 81, 9, 16, 123, 94, 21, 36,
123, 123, 19, 19, 56, 56, 16, 54, 17, 14, 14, 14, 14, 133, 19, 56,
17, 17, 17, 14, 14, 123, 19, 19, 17, 17, 17, 17, 79, 68, 79, 79,
17, 17, 72, 137, 151, 151, 151, 151, 17, 17, 159, 151, 110, 17, 93, 151,
17, 79, 151, 151, 196, 17, 1, 79, 17, 196, 151, 151, 68, 196, 137, 150,
54, 8, 8, 8, 91, 91, 119, 119, 56, 63, 15, 15, 8, 8, 119, 119,
19, 56, 56, 56, 15, 15, 54, 8, 19, 170, 196, 81, 125, 179, 125, 125,
93, 81, 150, 151, 151, 159, 150, 151, 181, 14, 110, 151, 110, 17, 81, 110,
1, 14, 110, 151, 137, 126, 110, 19, 137, 79, 110, 151, 137, 159, 131, 17,
119, 119, 119, 119, 119, 119, 78, 135, 119, 119, 119, 119, 78, 119, 78, 78,
119, 119, 119, 78, 119, 78, 78, 107, 15, 125, 124, 125, 187, 125, 125, 173,
153, 151, 151, 151, 48, 151, 137, 124, 170, 181, 151, 151, 153, 154, 90, 108,
19, 19, 121, 151, 151, 125, 77, 108, 17, 2, 93, 151, 151, 154, 172, 77,
58, 113, 107, 107, 107, 107, 107, 113, 107, 107, 107, 107, 107, 107, 107, 107,
5, 5, 5, 5, 5, 107, 107, 107, 5, 5, 5, 5, 5, 5, 5, 107,
108, 4, 4, 4, 4, 4, 4, 5, 173, 43, 192, 4, 4, 4, 4, 4,
43, 151, 121, 4, 4, 4, 4, 4, 192, 121, 124, 4, 4, 4, 4, 4,
107, 77, 113, 113, 107, 107, 5, 5, 107, 113, 107, 107, 107, 5, 107, 5,
107, 107, 113, 107, 107, 107, 107, 107, 107, 107, 107, 107, 113, 107, 113, 107,
5, 107, 107, 107, 107, 113, 113, 113, 5, 5, 107, 107, 107, 107, 113, 107,
4, 5, 107, 107, 107, 107, 113, 113, 4, 4, 5, 107, 107, 107, 107, 107,
4, 4, 4, 6, 6, 6, 7, 7, 5, 4, 4, 7, 7, 7, 7, 58,
107, 58, 58, 7, 7, 58, 7, 58, 107, 58, 187, 191, 191, 191, 192, 125,
107, 107, 111, 151, 151, 159, 146, 151, 113, 107, 91, 151, 151, 233, 125, 124,
113, 91, 107, 150, 151, 48, 150, 191, 113, 58, 91, 150, 151, 181, 151, 192,
7, 58, 58, 5, 4, 5, 4, 7, 58, 7, 58, 58, 58, 7, 7, 7,
58, 58, 58, 58, 58, 119, 78, 118, 187, 233, 125, 191, 191, 191, 125, 119,
43, 159, 151, 151, 151, 151, 151, 111, 43, 151, 48, 137, 151, 122, 141, 159,
91, 192, 4, 146, 151, 48, 15, 192, 119, 119, 119, 159, 151, 48, 4, 119,
7, 4, 4, 4, 4, 4, 4, 4, 118, 118, 118, 7, 4, 4, 4, 4,
118, 118, 119, 119, 58, 4, 4, 4, 78, 78, 233, 119, 119, 7, 5, 4,
48, 137, 151, 7, 7, 119, 119, 119, 43, 151, 150, 119, 43, 43, 187, 119,
191, 151, 150, 125, 151, 154, 191, 119, 191, 151, 151, 151, 151, 125, 118, 118,
4, 4, 4, 4, 4, 142, 4, 4, 4, 4, 4, 4, 4, 8, 4, 4,
4, 4, 4, 4, 4, 62, 4, 4, 4, 4, 4, 4, 4, 132, 58, 4,
7, 4, 4, 4, 4, 170, 135, 4, 119, 118, 118, 4, 4, 4, 142, 4,
119, 119, 78, 5, 4, 4, 8, 4, 78, 58, 58, 119, 118, 7, 8, 4,
4, 4, 173, 132, 190, 190, 190, 190, 4, 4, 107, 190, 132, 190, 190, 190,
4, 4, 5, 190, 190, 190, 190, 190, 4, 4, 5, 175, 190, 190, 190, 190,
4, 4, 5, 132, 190, 190, 190, 132, 4, 4, 4, 175, 190, 190, 190, 190,
4, 4, 4, 175, 190, 190, 190, 100, 4, 4, 4, 64, 190, 190, 190, 190,
150, 155, 15, 5, 4, 4, 4, 4, 126, 121, 64, 58, 4, 4, 4, 4,
126, 159, 64, 58, 4, 4, 4, 4, 126, 155, 64, 91, 4, 4, 4, 4,
131, 131, 64, 91, 4, 4, 4, 4, 116, 126, 64, 142, 4, 4, 4, 4,
116, 137, 132, 135, 4, 4, 4, 4, 116, 159, 250, 142, 4, 4, 4, 4,
120, 99, 59, 87, 59, 49, 26, 11, 133, 45, 87, 87, 23, 11, 26, 180,
133, 35, 59, 87, 11, 10, 26, 49, 170, 120, 87, 87, 52, 10, 250, 87,
133, 57, 87, 59, 52, 10, 10, 157, 100, 45, 87, 87, 87, 10, 10, 10,
170, 120, 87, 59, 87, 10, 10, 10, 190, 103, 87, 87, 76, 10, 235, 10,
10, 10, 82, 82, 82, 20, 22, 22, 36, 10, 82, 82, 82, 20, 20, 20,
10, 10, 10, 82, 82, 20, 20, 22, 55, 94, 82, 82, 82, 20, 20, 20,
180, 11, 82, 82, 82, 20, 20, 20, 87, 51, 10, 20, 20, 20, 20, 20,
82, 51, 82, 36, 20, 20, 20, 20, 10, 10, 52, 82, 20, 20, 20, 20,
22, 21, 21, 65, 25, 26, 44, 134, 21, 21, 21, 65, 50, 26, 25, 26,
21, 21, 22, 21, 50, 25, 24, 26, 22, 22, 21, 22, 24, 25, 50, 25,
22, 22, 21, 22, 50, 25, 50, 25, 22, 22, 21, 23, 50, 24, 24, 50,
22, 22, 22, 52, 24, 24, 24, 50, 20, 22, 21, 87, 24, 25, 50, 50,
13, 25, 74, 25, 24, 50, 50, 50, 73, 98, 25, 24, 25, 50, 50, 50,
44, 44, 25, 74, 25, 50, 50, 50, 12, 24, 50, 50, 50, 50, 50, 50,
74, 24, 24, 50, 26, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 25, 25, 24, 74, 71, 50, 50, 24, 25, 128, 12, 50, 74,
50, 50, 25, 24, 25, 128, 50, 128, 50, 50, 24, 24, 25, 25, 50, 25,
50, 50, 50, 25, 25, 25, 24, 25, 50, 50, 50, 50, 50, 50, 50, 24,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
98, 126, 49, 65, 52, 50, 25, 25, 24, 137, 13, 23, 95, 50, 25, 25,
26, 126, 134, 65, 52, 50, 25, 25, 98, 44, 126, 21, 52, 50, 25, 24,
74, 24, 126, 20, 95, 50, 25, 24, 25, 50, 44, 88, 52, 50, 50, 50,
26, 74, 74, 52, 23, 50, 50, 50, 24, 26, 87, 87, 87, 50, 50, 50,
50, 59, 43, 124, 174, 174, 166, 174, 50, 76, 88, 176, 69, 174, 174, 174,
50, 76, 65, 43, 176, 166, 174, 174, 50, 76, 23, 102, 68, 69, 174, 166,
25, 76, 23, 21, 52, 176, 139, 166, 50, 76, 23, 72, 23, 111, 176, 174,
50, 12, 23, 65, 52, 71, 83, 139, 50, 25, 52, 20, 52, 24, 24, 176,
171, 66, 66, 66, 96, 42, 42, 42, 174, 166, 130, 158, 96, 42, 42, 42,
166, 166, 166, 96, 96, 42, 42, 42, 166, 166, 166, 96, 96, 96, 96, 42,
166, 166, 166, 96, 96, 96, 96, 42, 158, 158, 249, 158, 158, 96, 96, 42,
192, 174, 85, 166, 249, 96, 96, 96, 69, 158, 166, 158, 158, 96, 96, 96,
42, 42, 42, 42, 42, 41, 41, 41, 42, 42, 42, 42, 42, 41, 41, 41,
42, 42, 42, 42, 42, 41, 41, 41, 42, 42, 42, 42, 42, 42, 41, 41,
42, 42, 42, 42, 42, 42, 41, 41, 42, 42, 42, 42, 42, 42, 41, 41,
42, 42, 42, 42, 42, 42, 41, 41, 96, 42, 42, 42, 42, 42, 41, 41,
41, 41, 138, 41, 41, 109, 33, 30, 41, 41, 41, 143, 138, 109, 145, 34,
41, 41, 41, 41, 41, 178, 145, 33, 41, 41, 138, 41, 41, 41, 138, 41,
41, 41, 41, 41, 143, 41, 143, 143, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
30, 69, 38, 163, 202, 238, 238, 143, 83, 34, 143, 230, 238, 238, 238, 143,
32, 41, 41, 202, 202, 238, 202, 41, 202, 230, 41, 41, 202, 202, 202, 41,
165, 230, 41, 41, 41, 202, 202, 41, 41, 41, 41, 41, 41, 41, 230, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
40, 84, 84, 40, 40, 230, 230, 230, 40, 40, 40, 138, 41, 230, 230, 230,
41, 41, 41, 41, 230, 230, 230, 230, 41, 41, 230, 230, 230, 230, 230, 230,
41, 41, 202, 230, 230, 230, 41, 138, 41, 230, 41, 202, 202, 138, 138, 33,
41, 230, 230, 138, 40, 109, 33, 33, 41, 230, 41, 138, 178, 33, 33, 33,
230, 230, 230, 230, 230, 230, 230, 202, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 41, 230, 230, 230, 230, 202, 230, 138, 138, 138, 138, 230, 230, 230,
178, 163, 33, 163, 163, 85, 138, 230, 33, 33, 33, 33, 163, 178, 138, 138,
33, 33, 33, 163, 178, 178, 138, 41, 145, 33, 163, 178, 178, 138, 138, 41,
230, 230, 230, 202, 202, 202, 202, 202, 202, 202, 230, 202, 202, 202, 202, 202,
202, 202, 202, 202, 202, 202, 202, 202, 230, 230, 202, 202, 202, 202, 202, 202,
230, 230, 230, 202, 202, 202, 202, 202, 230, 202, 230, 202, 202, 202, 202, 202,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 202, 202, 202, 202, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 41, 41, 41, 165, 202, 230, 230, 230, 230, 41, 41, 138, 202,
230, 230, 41, 41, 41, 41, 230, 41, 230, 230, 41, 41, 41, 41, 230, 230,
230, 230, 230, 41, 41, 41, 41, 230, 230, 230, 41, 41, 41, 230, 230, 143,
230, 230, 41, 41, 41, 41, 138, 165, 230, 230, 41, 41, 41, 41, 230, 249,
138, 191, 48, 34, 41, 41, 41, 41, 249, 81, 43, 174, 41, 41, 41, 41,
236, 88, 69, 41, 41, 41, 41, 41, 191, 95, 34, 41, 41, 41, 41, 41,
27, 48, 41, 41, 41, 41, 41, 138, 93, 48, 41, 41, 41, 41, 41, 40,
48, 115, 41, 41, 41, 41, 138, 178, 43, 66, 165, 41, 41, 41, 138, 178,
178, 33, 33, 33, 109, 41, 41, 138, 178, 33, 33, 33, 84, 41, 41, 41,
33, 145, 33, 33, 40, 41, 41, 41, 33, 33, 33, 33, 40, 41, 41, 41,
33, 33, 33, 163, 138, 41, 41, 42, 33, 33, 109, 40, 41, 41, 41, 41,
33, 33, 109, 40, 41, 41, 138, 41, 33, 33, 178, 41, 41, 41, 41, 41,
138, 81, 67, 56, 1, 21, 36, 21, 138, 61, 19, 19, 35, 36, 36, 36,
138, 35, 56, 133, 36, 36, 36, 21, 105, 94, 56, 2, 36, 21, 36, 21,
40, 157, 19, 1, 36, 21, 36, 94, 42, 250, 56, 35, 36, 36, 36, 36,
174, 10, 18, 35, 21, 36, 36, 36, 174, 45, 18, 36, 21, 36, 36, 36,
17, 17, 150, 151, 159, 72, 131, 151, 17, 17, 93, 151, 151, 150, 150, 150,
17, 17, 1, 72, 181, 110, 37, 61, 17, 17, 17, 17, 17, 1, 1, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
131, 1, 131, 151, 110, 196, 93, 17, 72, 79, 150, 151, 137, 79, 17, 17,
17, 79, 110, 110, 110, 79, 17, 14, 17, 17, 17, 17, 17, 17, 17, 14,
17, 17, 17, 17, 17, 17, 14, 14, 17, 17, 17, 17, 17, 14, 14, 14,
17, 17, 17, 17, 17, 17, 17, 136, 17, 17, 17, 17, 14, 17, 136, 156,
14, 61, 150, 110, 151, 151, 122, 3, 68, 137, 151, 179, 159, 151, 151, 122,
37, 110, 181, 179, 37, 122, 181, 43, 14, 136, 136, 132, 64, 90, 173, 77,
136, 136, 164, 64, 64, 90, 106, 184, 136, 136, 164, 64, 142, 173, 77, 184,
136, 164, 164, 63, 187, 173, 184, 184, 136, 164, 164, 187, 187, 119, 184, 184,
233, 122, 125, 4, 4, 4, 4, 4, 48, 151, 121, 4, 4, 4, 4, 4,
252, 111, 236, 108, 4, 4, 4, 5, 184, 184, 184, 108, 108, 4, 4, 4,
184, 184, 184, 184, 184, 108, 108, 107, 184, 184, 184, 184, 184, 108, 77, 90,
184, 184, 184, 184, 184, 184, 77, 106, 184, 184, 184, 184, 184, 77, 173, 172,
4, 4, 5, 5, 107, 107, 113, 107, 4, 4, 4, 5, 107, 107, 107, 107,
107, 107, 113, 127, 127, 127, 127, 127, 113, 127, 127, 127, 127, 127, 86, 86,
127, 127, 117, 117, 117, 117, 117, 62, 172, 172, 147, 147, 89, 100, 100, 19,
117, 147, 147, 147, 67, 67, 67, 100, 172, 172, 147, 100, 133, 133, 67, 14,
58, 91, 91, 151, 151, 191, 124, 187, 91, 91, 125, 151, 151, 122, 48, 146,
91, 119, 125, 48, 48, 48, 48, 111, 127, 86, 8, 119, 91, 91, 119, 91,
54, 54, 54, 8, 8, 8, 8, 8, 56, 56, 56, 63, 16, 18, 54, 15,
19, 19, 19, 56, 56, 56, 56, 56, 67, 19, 19, 19, 19, 19, 19, 56,
181, 119, 119, 150, 151, 48, 108, 118, 121, 58, 43, 151, 151, 137, 233, 108,
125, 135, 125, 111, 181, 111, 233, 119, 119, 119, 119, 119, 119, 119, 91, 119,
8, 8, 8, 8, 8, 119, 119, 119, 15, 18, 18, 18, 54, 54, 15, 15,
56, 56, 56, 56, 56, 56, 56, 63, 56, 19, 100, 100, 19, 19, 56, 56,
191, 151, 151, 150, 151, 137, 233, 7, 43, 151, 151, 43, 151, 151, 137, 233,
43, 111, 111, 192, 125, 48, 48, 187, 119, 78, 58, 58, 58, 119, 119, 58,
119, 91, 119, 119, 91, 119, 119, 119, 15, 15, 54, 54, 15, 15, 15, 15,
63, 63, 63, 63, 63, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
118, 118, 184, 119, 119, 119, 64, 4, 7, 7, 7, 58, 119, 119, 132, 4,
119, 78, 7, 7, 7, 58, 100, 108, 119, 119, 58, 78, 78, 135, 133, 4,
119, 119, 119, 8, 8, 8, 8, 4, 86, 54, 54, 54, 15, 15, 15, 4,
56, 56, 56, 56, 56, 56, 56, 5, 56, 56, 56, 56, 56, 19, 19, 107,
4, 4, 4, 64, 190, 190, 190, 132, 4, 4, 4, 62, 190, 190, 190, 132,
4, 4, 4, 142, 132, 190, 190, 190, 4, 4, 4, 142, 190, 132, 190, 132,
4, 4, 4, 8, 190, 132, 190, 132, 4, 4, 4, 107, 190, 190, 190, 190,
4, 4, 4, 107, 190, 190, 190, 190, 4, 4, 4, 5, 190, 132, 190, 132,
116, 150, 250, 86, 4, 4, 4, 4, 13, 137, 68, 80, 4, 4, 4, 4,
155, 159, 92, 16, 4, 4, 4, 4, 131, 121, 92, 112, 4, 4, 4, 4,
131, 121, 13, 45, 4, 4, 4, 4, 155, 131, 13, 10, 4, 4, 4, 4,
60, 131, 73, 99, 4, 4, 4, 4, 155, 110, 92, 57, 5, 4, 4, 4,
190, 160, 87, 87, 87, 10, 10, 10, 190, 133, 87, 59, 87, 157, 99, 10,
190, 170, 87, 87, 87, 102, 10, 10, 190, 170, 59, 87, 59, 88, 10, 10,
190, 170, 87, 87, 87, 23, 10, 10, 190, 170, 59, 87, 59, 52, 10, 10,
190, 170, 87, 87, 87, 11, 235, 10, 175, 170, 52, 87, 59, 87, 99, 10,
10, 10, 102, 22, 20, 20, 20, 20, 10, 10, 157, 20, 20, 20, 20, 20,
94, 10, 82, 82, 82, 20, 20, 20, 10, 10, 10, 82, 82, 20, 20, 20,
10, 10, 94, 10, 82, 20, 20, 20, 10, 10, 10, 10, 82, 82, 20, 20,
10, 10, 94, 10, 82, 82, 20, 20, 10, 10, 10, 10, 82, 82, 20, 20,
20, 20, 23, 76, 24, 25, 50, 50, 20, 20, 52, 50, 24, 25, 50, 50,
20, 20, 87, 50, 50, 25, 50, 50, 20, 21, 76, 25, 24, 25, 50, 50,
20, 21, 74, 50, 24, 25, 50, 50, 20, 22, 74, 26, 50, 24, 50, 50,
21, 22, 74, 25, 74, 24, 50, 50, 21, 23, 24, 50, 24, 50, 25, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 25, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 24, 50, 50, 25, 50, 50, 50, 50, 25,
50, 50, 25, 50, 50, 50, 50, 25, 50, 50, 50, 50, 50, 50, 25, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 25, 50, 50, 25, 26, 74,
50, 26, 52, 87, 87, 50, 50, 50, 25, 98, 23, 23, 87, 50, 50, 24,
50, 13, 102, 65, 52, 25, 50, 24, 98, 116, 11, 23, 23, 25, 50, 24,
13, 13, 11, 53, 52, 25, 50, 25, 13, 76, 102, 65, 95, 25, 50, 25,
44, 87, 20, 21, 52, 12, 50, 25, 13, 59, 82, 82, 53, 25, 26, 26,
50, 25, 52, 65, 53, 24, 25, 83, 50, 25, 52, 21, 22, 24, 24, 26,
24, 25, 87, 20, 36, 50, 24, 74, 25, 25, 59, 20, 21, 74, 24, 50,
25, 25, 59, 20, 21, 76, 24, 50, 25, 25, 59, 20, 21, 46, 128, 24,
24, 50, 76, 20, 20, 59, 128, 50, 98, 49, 76, 36, 82, 87, 50, 25,
176, 166, 158, 158, 158, 96, 96, 96, 92, 38, 192, 158, 249, 158, 96, 96,
128, 176, 38, 241, 158, 66, 105, 96, 128, 71, 83, 29, 241, 105, 96, 169,
50, 26, 24, 176, 34, 169, 105, 169, 26, 24, 12, 71, 176, 129, 192, 105,
50, 50, 26, 26, 71, 38, 29, 96, 25, 25, 25, 25, 26, 92, 176, 30,
96, 96, 42, 42, 41, 42, 41, 41, 96, 96, 42, 42, 41, 42, 41, 41,
169, 97, 96, 42, 42, 41, 41, 41, 105, 96, 96, 42, 42, 42, 42, 42,
40, 97, 96, 42, 41, 41, 42, 42, 105, 97, 96, 96, 42, 41, 41, 41,
105, 96, 96, 96, 42, 41, 41, 41, 165, 96, 96, 96, 42, 96, 143, 42,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 111,
41, 41, 41, 41, 41, 41, 138, 146, 41, 41, 41, 41, 41, 41, 41, 146,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 143, 143, 41, 41, 41, 41, 41, 41, 143, 143,
41, 41, 41, 41, 41, 41, 143, 143, 105, 41, 41, 41, 41, 115, 143, 158,
249, 41, 41, 41, 139, 141, 143, 43, 83, 154, 149, 96, 161, 150, 43, 154,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
41, 41, 41, 41, 41, 41, 41, 41, 115, 41, 41, 41, 41, 41, 41, 41,
83, 41, 41, 41, 41, 41, 41, 41, 137, 115, 185, 83, 146, 161, 249, 41,
41, 41, 41, 163, 33, 33, 33, 163, 41, 41, 41, 85, 163, 163, 163, 178,
41, 202, 202, 138, 40, 85, 178, 178, 41, 41, 202, 41, 138, 40, 178, 178,
41, 41, 41, 230, 230, 41, 41, 41, 41, 41, 202, 202, 111, 230, 129, 83,
41, 41, 202, 139, 149, 202, 43, 43, 161, 41, 41, 185, 115, 202, 141, 129,
163, 85, 178, 138, 138, 138, 41, 41, 178, 178, 178, 138, 138, 41, 41, 41,
178, 138, 138, 138, 41, 41, 230, 230, 178, 138, 138, 41, 41, 41, 230, 230,
41, 41, 41, 41, 41, 230, 230, 230, 202, 41, 41, 41, 41, 230, 115, 230,
230, 230, 230, 230, 230, 247, 154, 230, 174, 122, 146, 149, 247, 83, 151, 185,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
202, 202, 230, 230, 230, 230, 230, 230, 230, 230, 230, 202, 202, 202, 202, 202,
230, 230, 230, 230, 230, 230, 230, 230, 139, 43, 230, 230, 230, 230, 230, 230,
69, 185, 230, 202, 202, 202, 202, 202, 69, 111, 230, 149, 115, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 230, 139, 121, 146, 83, 230, 247, 149, 154,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 230, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 41,
230, 230, 230, 230, 230, 230, 230, 41, 230, 230, 230, 230, 230, 230, 230, 41,
230, 230, 230, 230, 230, 230, 230, 41, 161, 247, 247, 149, 154, 161, 174, 41,
230, 230, 41, 41, 41, 41, 207, 124, 230, 230, 41, 41, 41, 41, 192, 43,
230, 41, 143, 41, 230, 143, 124, 43, 230, 230, 143, 230, 230, 143, 124, 115,
41, 202, 41, 41, 202, 236, 115, 41, 41, 41, 41, 41, 207, 115, 174, 230,
143, 41, 41, 143, 236, 125, 230, 41, 122, 83, 154, 111, 115, 191, 111, 146,
174, 230, 41, 41, 41, 41, 40, 84, 158, 41, 143, 41, 41, 41, 178, 33,
230, 207, 41, 41, 41, 41, 33, 145, 41, 143, 41, 41, 41, 41, 33, 33,
41, 143, 41, 41, 41, 41, 33, 33, 143, 41, 41, 41, 41, 40, 33, 33,
41, 41, 143, 41, 41, 40, 33, 33, 141, 129, 143, 111, 161, 141, 33, 33,
33, 33, 178, 41, 41, 41, 165, 42, 33, 33, 42, 143, 143, 41, 165, 42,
33, 109, 41, 41, 41, 41, 42, 40, 33, 33, 41, 41, 41, 41, 41, 40,
33, 163, 41, 41, 41, 41, 143, 42, 84, 40, 41, 41, 41, 41, 165, 158,
84, 138, 41, 41, 41, 41, 41, 192, 163, 174, 122, 146, 149, 105, 174, 149,
192, 1, 56, 36, 36, 36, 36, 36, 191, 17, 56, 21, 36, 36, 36, 36,
191, 19, 67, 36, 36, 36, 36, 36, 191, 19, 123, 36, 36, 36, 36, 36,
179, 56, 1, 36, 36, 36, 36, 36, 81, 19, 35, 36, 36, 36, 36, 36,
35, 67, 36, 36, 36, 36, 36, 36, 126, 37, 196, 126, 126, 155, 68, 36,
14, 14, 14, 61, 93, 79, 61, 14, 14, 14, 37, 151, 151, 151, 151, 68,
14, 160, 151, 151, 110, 179, 131, 110, 14, 17, 151, 151, 151, 137, 181, 14,
14, 14, 93, 150, 151, 151, 151, 181, 14, 196, 159, 61, 68, 150, 151, 131,
123, 179, 151, 137, 110, 151, 151, 93, 123, 123, 79, 37, 110, 181, 79, 14,
14, 14, 14, 14, 136, 136, 136, 136, 14, 14, 14, 136, 14, 136, 136, 162,
14, 179, 68, 68, 81, 136, 179, 93, 79, 150, 137, 151, 151, 27, 110, 151,
126, 151, 68, 181, 151, 126, 27, 151, 137, 151, 181, 68, 151, 126, 27, 151,
37, 151, 150, 126, 151, 27, 17, 151, 123, 68, 181, 181, 179, 156, 162, 93,
164, 63, 233, 187, 239, 193, 184, 184, 164, 63, 187, 187, 104, 240, 193, 184,
48, 162, 124, 48, 241, 239, 115, 236, 151, 124, 151, 151, 125, 150, 151, 150,
151, 162, 151, 151, 236, 111, 151, 122, 151, 63, 151, 151, 191, 111, 151, 111,
151, 110, 151, 151, 48, 121, 151, 121, 181, 27, 111, 37, 191, 48, 110, 48,
184, 184, 184, 184, 184, 184, 90, 172, 184, 184, 184, 184, 184, 173, 199, 137,
236, 43, 252, 77, 90, 43, 196, 150, 151, 151, 121, 173, 121, 151, 121, 151,
124, 151, 137, 125, 151, 151, 190, 137, 125, 151, 150, 27, 151, 151, 100, 137,
93, 151, 151, 81, 137, 151, 131, 151, 27, 110, 181, 81, 179, 181, 37, 37,
190, 190, 100, 133, 133, 133, 14, 14, 151, 93, 100, 133, 133, 103, 14, 14,
151, 93, 179, 37, 81, 14, 14, 14, 151, 68, 181, 151, 131, 14, 14, 14,
151, 68, 196, 159, 93, 14, 14, 14, 151, 93, 81, 153, 196, 14, 14, 14,
151, 110, 110, 151, 131, 14, 14, 14, 181, 196, 61, 110, 79, 14, 14, 14,
14, 14, 160, 196, 196, 61, 17, 196, 14, 14, 110, 151, 151, 181, 181, 151,
14, 14, 81, 151, 151, 61, 17, 151, 14, 14, 61, 151, 151, 131, 110, 151,
14, 14, 179, 151, 151, 131, 110, 151, 14, 14, 61, 151, 151, 179, 179, 151,
14, 14, 37, 151, 151, 37, 68, 151, 14, 2, 93, 110, 110, 196, 196, 110,
93, 61, 123, 14, 123, 123, 123, 123, 151, 131, 14, 61, 110, 14, 179, 159,
151, 196, 37, 150, 151, 181, 79, 126, 151, 79, 110, 151, 151, 131, 196, 110,
151, 81, 79, 151, 151, 179, 14, 110, 151, 79, 79, 151, 151, 179, 14, 110,
151, 181, 61, 151, 151, 137, 181, 137, 110, 68, 14, 93, 110, 37, 45, 181,
17, 179, 123, 123, 123, 123, 123, 67, 151, 110, 123, 14, 14, 14, 14, 14,
151, 181, 196, 37, 61, 17, 160, 93, 151, 137, 151, 151, 131, 17, 126, 150,
151, 181, 68, 151, 137, 93, 151, 137, 151, 181, 196, 151, 137, 68, 151, 137,
151, 110, 68, 151, 150, 61, 150, 151, 110, 37, 196, 110, 181, 179, 179, 37,
123, 123, 14, 79, 79, 79, 79, 125, 14, 14, 14, 159, 151, 151, 159, 151,
37, 81, 14, 68, 151, 137, 179, 151, 110, 151, 79, 93, 151, 150, 181, 151,
131, 151, 181, 68, 151, 151, 110, 151, 93, 196, 179, 37, 151, 137, 123, 137,
153, 137, 27, 131, 151, 151, 181, 151, 111, 125, 80, 37, 37, 181, 37, 181,
118, 4, 4, 5, 190, 132, 190, 175, 150, 187, 4, 5, 190, 132, 190, 190,
151, 191, 4, 5, 190, 132, 190, 175, 146, 108, 4, 5, 190, 132, 190, 190,
151, 43, 4, 5, 64, 132, 132, 190, 151, 141, 4, 5, 64, 190, 190, 190,
151, 43, 4, 5, 64, 132, 190, 190, 196, 4, 4, 5, 64, 190, 190, 132,
116, 73, 46, 160, 5, 4, 4, 4, 116, 73, 144, 61, 78, 4, 4, 4,
13, 73, 94, 81, 135, 4, 4, 4, 116, 68, 1, 61, 142, 4, 4, 4,
45, 68, 14, 35, 170, 5, 4, 4, 45, 68, 123, 45, 170, 107, 4, 4,
94, 68, 14, 35, 160, 58, 4, 4, 94, 73, 14, 57, 120, 91, 4, 4,
175, 170, 52, 52, 87, 87, 10, 10, 64, 190, 52, 52, 59, 87, 99, 10,
64, 190, 52, 52, 87, 87, 99, 10, 142, 190, 11, 52, 59, 87, 10, 10,
4, 190, 45, 52, 87, 87, 23, 10, 4, 190, 120, 52, 87, 87, 23, 99,
4, 190, 103, 52, 52, 59, 52, 10, 4, 190, 133, 87, 87, 87, 87, 99,
10, 10, 94, 10, 82, 82, 20, 20, 235, 10, 10, 10, 82, 82, 20, 20,
10, 10, 94, 10, 82, 82, 20, 20, 10, 10, 10, 10, 82, 82, 20, 20,
10, 10, 10, 94, 10, 82, 20, 20, 10, 235, 10, 10, 10, 82, 20, 82,
10, 10, 10, 94, 10, 82, 82, 20, 10, 10, 10, 10, 10, 82, 82, 20,
21, 53, 50, 50, 24, 50, 25, 50, 21, 23, 50, 50, 50, 50, 25, 50,
36, 52, 50, 50, 50, 50, 25, 50, 22, 87, 50, 50, 50, 50, 50, 50,
82, 46, 50, 50, 50, 50, 50, 50, 20, 46, 26, 25, 25, 25, 25, 25,
20, 76, 26, 25, 25, 25, 25, 25, 21, 12, 25, 25, 25, 25, 25, 25,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 25, 25, 25, 25,
50, 50, 50, 50, 50, 25, 25, 25, 50, 50, 50, 50, 50, 25, 25, 25,
50, 50, 25, 25, 50, 25, 25, 13, 50, 50, 25, 25, 25, 25, 25, 44,
50, 50, 25, 25, 25, 50, 25, 13, 50, 50, 50, 25, 25, 25, 50, 73,
25, 25, 50, 25, 25, 26, 50, 49, 25, 25, 50, 25, 25, 50, 25, 13,
25, 25, 25, 25, 25, 25, 49, 73, 25, 25, 25, 25, 25, 25, 13, 92,
44, 76, 102, 36, 23, 12, 50, 25, 46, 49, 11, 21, 23, 25, 50, 25,
95, 49, 11, 21, 53, 12, 25, 25, 95, 13, 52, 36, 23, 12, 25, 12,
45, 95, 52, 20, 53, 46, 50, 51, 14, 72, 46, 144, 21, 87, 25, 76,
67, 61, 46, 20, 22, 87, 12, 25, 123, 61, 46, 82, 22, 52, 76, 51,
98, 44, 76, 20, 82, 52, 25, 25, 50, 73, 12, 21, 82, 11, 76, 25,
26, 13, 12, 20, 36, 53, 76, 25, 128, 13, 128, 20, 82, 21, 87, 25,
128, 44, 128, 87, 82, 94, 87, 50, 98, 44, 44, 87, 20, 10, 87, 25,
49, 71, 44, 74, 82, 10, 11, 76, 49, 71, 44, 44, 10, 10, 102, 59,
25, 25, 25, 25, 25, 26, 46, 38, 25, 25, 25, 25, 25, 25, 50, 68,
25, 25, 25, 25, 25, 12, 26, 26, 25, 25, 25, 25, 25, 25, 50, 25,
25, 25, 25, 25, 25, 25, 50, 25, 25, 12, 25, 25, 25, 25, 25, 25,
12, 12, 12, 12, 12, 12, 25, 25, 12, 12, 12, 12, 12, 12, 25, 25,
129, 96, 158, 207, 207, 207, 207, 207, 176, 174, 207, 41, 96, 41, 41, 41,
71, 38, 109, 241, 207, 42, 143, 207, 26, 71, 83, 28, 109, 143, 42, 41,
25, 25, 26, 48, 176, 109, 207, 143, 25, 25, 26, 25, 73, 28, 148, 143,
25, 25, 12, 12, 25, 46, 43, 30, 25, 76, 74, 25, 25, 25, 51, 69,
41, 41, 41, 41, 41, 41, 41, 146, 41, 41, 41, 41, 41, 41, 41, 146,
41, 41, 41, 41, 41, 41, 41, 154, 143, 143, 143, 143, 143, 41, 41, 146,
143, 143, 143, 143, 143, 41, 41, 43, 165, 41, 41, 143, 169, 41, 41, 40,
109, 202, 207, 143, 143, 41, 41, 41, 38, 41, 41, 143, 143, 143, 143, 41,
48, 105, 141, 115, 115, 121, 109, 83, 109, 41, 185, 69, 139, 141, 41, 69,
249, 96, 83, 43, 139, 141, 41, 43, 109, 41, 111, 69, 129, 154, 139, 69,
105, 41, 115, 139, 165, 43, 69, 158, 41, 41, 138, 41, 41, 40, 165, 41,
41, 41, 41, 143, 143, 143, 143, 143, 41, 41, 41, 143, 143, 143, 143, 143,
111, 105, 141, 149, 249, 83, 111, 41, 83, 207, 141, 115, 41, 249, 154, 41,
185, 143, 141, 115, 41, 129, 121, 41, 141, 129, 141, 146, 69, 141, 43, 41,
48, 115, 141, 69, 111, 69, 41, 41, 41, 41, 141, 139, 202, 202, 143, 143,
143, 207, 115, 158, 143, 143, 143, 143, 143, 143, 165, 143, 143, 143, 143, 143,
129, 41, 41, 146, 247, 165, 121, 202, 41, 41, 129, 141, 202, 115, 185, 143,
41, 41, 43, 43, 202, 149, 115, 202, 69, 41, 141, 129, 202, 146, 202, 202,
43, 41, 43, 230, 165, 43, 202, 202, 42, 143, 42, 41, 202, 202, 202, 202,
143, 143, 143, 41, 202, 202, 202, 202, 143, 143, 143, 41, 202, 202, 202, 202,
141, 115, 165, 43, 185, 174, 137, 249, 151, 154, 154, 154, 146, 230, 154, 202,
137, 249, 158, 249, 174, 247, 154, 230, 149, 122, 69, 141, 185, 230, 150, 115,
202, 69, 185, 43, 202, 202, 69, 43, 202, 202, 202, 202, 202, 202, 230, 230,
202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,
69, 185, 141, 83, 211, 230, 230, 230, 69, 151, 150, 249, 230, 230, 230, 230,
124, 161, 69, 122, 230, 230, 230, 211, 69, 111, 230, 141, 69, 249, 115, 230,
139, 115, 211, 174, 43, 85, 43, 230, 211, 230, 202, 230, 230, 202, 230, 202,
202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,
122, 69, 247, 122, 249, 185, 111, 138, 69, 150, 141, 43, 230, 121, 109, 230,
139, 249, 69, 146, 69, 141, 139, 230, 161, 111, 69, 121, 115, 43, 121, 69,
165, 43, 185, 115, 230, 230, 115, 185, 230, 41, 230, 230, 230, 230, 230, 202,
202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,
185, 43, 149, 43, 247, 115, 141, 41, 41, 230, 154, 154, 154, 154, 150, 41,
249, 115, 146, 139, 249, 249, 139, 138, 141, 83, 43, 121, 69, 111, 141, 41,
69, 211, 230, 69, 185, 43, 138, 41, 202, 202, 202, 202, 202, 230, 41, 41,
202, 202, 202, 41, 41, 41, 41, 41, 202, 202, 202, 41, 41, 41, 41, 41,
150, 69, 249, 154, 115, 83, 83, 105, 137, 202, 202, 122, 115, 121, 154, 154,
137, 207, 249, 141, 115, 141, 115, 249, 154, 202, 236, 141, 115, 69, 154, 69,
48, 138, 192, 69, 174, 230, 115, 185, 230, 41, 105, 165, 230, 41, 41, 42,
143, 143, 41, 202, 41, 41, 41, 41, 41, 202, 41, 41, 41, 41, 41, 41,
115, 121, 41, 154, 69, 129, 33, 33, 146, 151, 105, 154, 109, 33, 33, 145,
249, 139, 41, 154, 109, 33, 84, 178, 83, 146, 41, 154, 33, 33, 139, 34,
48, 249, 41, 43, 163, 178, 139, 69, 41, 143, 138, 178, 178, 178, 40, 230,
41, 41, 41, 40, 178, 178, 138, 41, 41, 41, 41, 40, 178, 40, 41, 41,
41, 141, 43, 109, 111, 83, 129, 151, 41, 137, 138, 41, 129, 121, 129, 159,
138, 154, 105, 230, 139, 121, 129, 159, 41, 111, 141, 69, 121, 43, 174, 159,
230, 138, 69, 111, 115, 138, 249, 92, 41, 41, 41, 138, 138, 41, 143, 82,
41, 41, 41, 41, 41, 41, 138, 20, 41, 41, 41, 41, 41, 41, 40, 21,
95, 35, 137, 46, 95, 137, 92, 82, 35, 65, 159, 36, 36, 73, 73, 36,
1, 94, 137, 36, 36, 110, 92, 36, 45, 36, 131, 131, 73, 151, 92, 36,
45, 82, 95, 92, 92, 155, 92, 36, 35, 21, 159, 73, 92, 137, 95, 36,
35, 36, 88, 181, 73, 52, 36, 36, 1, 36, 36, 36, 36, 36, 36, 36
};
|
the_stack_data/178265347.c
|
extern void abort(void);
void reach_error(){}
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } }
int main(void) {
unsigned int x = 0;
unsigned int y = 10000000;
unsigned int z=5000000;
while(x<y){
if(x>=5000000)
z--;
x++;
}
__VERIFIER_assert(z!=0);
}
|
the_stack_data/462202.c
|
// PARAM: --disable ana.mutex.disjoint_types --set ana.activated[+] "'var_eq'" --set ana.activated[+] "'symb_locks'"
#include<pthread.h>
#include<stdlib.h>
#include<stdio.h>
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
struct s {
int datum;
pthread_mutex_t mutex;
int list;
} *A;
void init (struct s *p, int x) {
p->datum = x;
pthread_mutex_init(&p->mutex, NULL);
}
void update (int *p) {
struct s *s = list_entry(p, struct s, list);
pthread_mutex_lock(&s->mutex);
s->datum++; //NORACE
pthread_mutex_lock(&s->mutex);
}
void *t_fun(void *arg) {
update(&A->list);
return NULL;
}
int main () {
pthread_t t1;
A = malloc(sizeof(struct s));
init(A,666);
pthread_create(&t1, NULL, t_fun, NULL);
update(&A->list);
return 0;
}
|
the_stack_data/24162.c
|
/* OpenCL built-in library: printf()
Copyright (c) 2013 Erik Schnetter <[email protected]>
Perimeter Institute for Theoretical Physics
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.
*/
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wformat-security"
#if (__clang_major__ == 3)
#include <limits.h>
#include <stdarg.h>
#include <stdbool.h>
// We implement the OpenCL printf by calling the C99 printf. This is
// not very efficient, but is easy to implement.
#define OCL_C_AS __attribute__((address_space(0)))
int printf(OCL_C_AS const char* restrict fmt, ...);
int snprintf(OCL_C_AS char* restrict str, size_t size,
OCL_C_AS const char* restrict fmt, ...);
// For debugging
// Use as: DEBUG_PRINTF((fmt, args...)) -- note double parentheses!
// #define DEBUG_PRINTF(args) (printf args)
#define DEBUG_PRINTF(args) ((void)0)
// Conversion flags
typedef struct {
bool left;
bool plus;
bool space;
bool alt;
bool zero;
} flags_t;
// Helper routines to output integers
#define INT_CONV_char "hh"
#define INT_CONV_short "h"
#define INT_CONV_int ""
#define INT_CONV_long "ll" // C99 printf uses "ll" for int64_t
#define DEFINE_PRINT_INTS(WIDTH) \
void _cl_print_ints_##WIDTH(flags_t flags, int field_width, int precision, \
char conv, OCL_C_AS const void* vals, int n) \
{ \
DEBUG_PRINTF(("[printf:ints:n=%df]\n", n)); \
char outfmt[1000]; \
OCL_C_AS char str[] = "%%%s%s%s%s%s%.0d%s%.0d" INT_CONV_##WIDTH "%c"; \
snprintf(outfmt, sizeof outfmt, \
str, \
flags.left ? "-" : "", \
flags.plus ? "+" : "", \
flags.space ? " " : "", \
flags.alt ? "#" : "", \
flags.zero ? "0" : "", \
field_width, \
precision != -1 ? "." : "", \
precision != -1 ? precision : 0, \
conv); \
DEBUG_PRINTF(("[printf:ints:outfmt=%s]\n", outfmt)); \
OCL_C_AS char comma[] = ","; \
for (int d=0; d<n; ++d) { \
DEBUG_PRINTF(("[printf:ints:d=%d]\n", d)); \
if (d != 0) printf(comma); \
printf(outfmt, ((OCL_C_AS const WIDTH*)vals)[d]); \
} \
DEBUG_PRINTF(("[printf:ints:done]\n")); \
}
DEFINE_PRINT_INTS(char)
DEFINE_PRINT_INTS(short)
DEFINE_PRINT_INTS(int)
#ifdef cl_khr_int64
DEFINE_PRINT_INTS(long)
#endif
#undef DEFINE_PRINT_INTS
// Helper routines to output floats
// Defined in OpenCL
float __attribute__((overloadable)) vload_half(size_t offset,
OCL_C_AS const half *p);
// Note: To simplify implementation, we print double values with %lf,
// although %f would suffice as well
#define FLOAT_CONV_half "h"
#define FLOAT_CONV_float ""
#define FLOAT_CONV_double "l"
#define FLOAT_GET_half(ptr) vload_half(0, ptr)
#define FLOAT_GET_float(ptr) (*(ptr))
#define FLOAT_GET_double(ptr) (*(ptr))
#define DEFINE_PRINT_FLOATS(WIDTH) \
void _cl_print_floats_##WIDTH(flags_t flags, int field_width, int precision, \
char conv, OCL_C_AS const void* vals, int n) \
{ \
DEBUG_PRINTF(("[printf:floats:n=%dd]\n", n)); \
char outfmt[1000]; \
OCL_C_AS char str[] = "%%%s%s%s%s%s%.0d%s%.0d" FLOAT_CONV_##WIDTH "%c"; \
snprintf(outfmt, sizeof outfmt, \
str, \
flags.left ? "-" : "", \
flags.plus ? "+" : "", \
flags.space ? " " : "", \
flags.alt ? "#" : "", \
flags.zero ? "0" : "", \
field_width, \
precision != -1 ? "." : "", \
precision != -1 ? precision : 0, \
conv); \
DEBUG_PRINTF(("[printf:floats:outfmt=%s]\n", outfmt)); \
OCL_C_AS char comma[] = ","; \
for (int d=0; d<n; ++d) { \
DEBUG_PRINTF(("[printf:floats:d=%d]\n", d)); \
if (d != 0) printf(comma); \
printf(outfmt, FLOAT_GET_##WIDTH((OCL_C_AS const WIDTH*)vals+d)); \
} \
DEBUG_PRINTF(("[printf:floats:done]\n")); \
}
#ifdef cl_khr_fp16
DEFINE_PRINT_FLOATS(half)
#endif
DEFINE_PRINT_FLOATS(float)
#ifdef cl_khr_fp64
DEFINE_PRINT_FLOATS(double)
#endif
#undef DEFINE_PRINT_FLOATS
// Helper routines to output characters, strings, and pointers
void _cl_print_char(flags_t flags, int field_width, int val)
{
DEBUG_PRINTF(("[printf:char]\n"));
char outfmt[1000];
char string[] = "%%%s%.0dc";
snprintf(outfmt, sizeof outfmt,
string,
flags.left ? "-" : "",
field_width);
DEBUG_PRINTF(("[printf:char:outfmt=%s]\n", outfmt));
printf(outfmt, val);
DEBUG_PRINTF(("[printf:char:done]\n"));
}
void _cl_print_string(flags_t flags, int field_width, OCL_C_AS const char* val)
{
DEBUG_PRINTF(("[printf:char]\n"));
char outfmt[1000];
char string[] = "%%%s%.0ds";
snprintf(outfmt, sizeof outfmt,
string,
flags.left ? "-" : "",
field_width);
DEBUG_PRINTF(("[printf:char:outfmt=%s]\n", outfmt));
printf(outfmt, val);
DEBUG_PRINTF(("[printf:char:done]\n"));
}
void _cl_print_pointer(flags_t flags, int field_width, OCL_C_AS const void* val)
{
DEBUG_PRINTF(("[printf:char]\n"));
char outfmt[1000];
char string[] = "%%%s%.0dp";
snprintf(outfmt, sizeof outfmt,
string,
flags.left ? "-" : "",
field_width);
DEBUG_PRINTF(("[printf:char:outfmt=%s]\n", outfmt));
printf(outfmt, val);
DEBUG_PRINTF(("[printf:char:done]\n"));
}
// The OpenCL printf routine.
// The implementation is straightforward:
// - walk through the format string
// - when a variable should be output, parse flags, field width,
// precision, vector specifier, length, and conversion specifier
// - call a helper routine to perform the actual output
// - the helper routine is based on calling C99 printf, and constructs
// a format string via snprintf
// - if there is an error during parsing, a "goto error" aborts the
// routine, returning -1
// This should be queried from the machine in the non-TAS case.
// For now assume that if we are not using the fake address space
// ids then we have a single address space. This version of printf
// doesn't work with multiple address spaces anyways.
#ifdef POCL_USE_FAKE_ADDR_SPACE_IDS
#define OCL_CONSTANT_AS __attribute__((address_space(3)))
#else
#define OCL_CONSTANT_AS
#endif
int _cl_printf(const OCL_CONSTANT_AS char* restrict format, ...)
{
DEBUG_PRINTF(("[printf:format=%s]\n", format));
va_list ap;
va_start(ap, format);
char ch = *format;
while (ch) {
if (ch == '%') {
ch = *++format;
if (ch == '%') {
DEBUG_PRINTF(("[printf:%%]\n"));
char s[] = "%%";
printf(s); // literal %
ch = *++format;
} else {
DEBUG_PRINTF(("[printf:arg]\n"));
// Flags
flags_t flags;
flags.left = false;
flags.plus = false;
flags.space = false;
flags.alt = false;
flags.zero = false;
for (;;) {
switch (ch) {
case '-': if (flags.left) goto error; flags.left = true; break;
case '+': if (flags.plus) goto error; flags.plus = true; break;
case ' ': if (flags.space) goto error; flags.space = true; break;
case '#': if (flags.alt) goto error; flags.alt = true; break;
case '0': if (flags.zero) goto error; flags.zero = true; break;
default: goto flags_done;
}
ch = *++format;
}
flags_done:;
DEBUG_PRINTF(("[printf:flags:left=%d,plus=%d,space=%d,alt=%d,zero=%d]\n",
flags.left, flags.plus, flags.space, flags.alt, flags.zero));
// Field width
int field_width = 0;
while (ch >= '0' && ch <= '9') {
if (ch == '0' && field_width == 0) goto error;
if (field_width > (INT_MAX - 9) / 10) goto error;
field_width = 10 * field_width + (ch - '0');
ch = *++format;
}
DEBUG_PRINTF(("[printf:width=%d]\n", field_width));
// Precision
int precision = -1;
if (ch == '.') {
ch = *++format;
precision = 0;
while (ch >= '0' && ch <= '9') {
if (precision > (INT_MAX - 9) / 10) goto error;
precision = 10 * precision + (ch - '0');
ch = *++format;
}
}
DEBUG_PRINTF(("[printf:precision=%d]\n", precision));
// Vector specifier
int vector_length = 0;
if (ch == 'v') {
ch = *++format;
while (ch >= '0' && ch <= '9') {
if (ch == '0' && vector_length == 0) goto error;
if (vector_length > (INT_MAX - 9) / 10) goto error;
vector_length = 10 * vector_length + (ch - '0');
ch = *++format;
}
if (! (vector_length == 2 ||
vector_length == 3 ||
vector_length == 4 ||
vector_length == 8 ||
vector_length == 16)) goto error;
}
DEBUG_PRINTF(("[printf:vector_length=%d]\n", vector_length));
// Length modifier
int length = 0; // default
if (ch == 'h') {
ch = *++format;
if (ch == 'h') {
ch = *++format;
length = 1; // "hh" -> char
} else if (ch == 'l') {
ch = *++format;
length = 4; // "hl" -> int
} else {
length = 2; // "h" -> short
}
} else if (ch == 'l') {
ch = *++format;
length = 8; // "l" -> long
}
if (vector_length > 0 && length == 0) goto error;
if (vector_length == 0 && length == 4) goto error;
if (vector_length == 0) vector_length = 1;
DEBUG_PRINTF(("[printf:length=%d]\n", length));
// Conversion specifier
switch (ch) {
// Output integers
case 'd':
case 'i':
case 'o':
case 'u':
case 'x':
case 'X':
#define CALL_PRINT_INTS(WIDTH, PROMOTED_WIDTH) \
{ \
WIDTH##16 val; \
switch (vector_length) { \
default: __builtin_unreachable(); \
case 1: val.s0 = va_arg(ap, PROMOTED_WIDTH); break; \
case 2: val.s01 = va_arg(ap, WIDTH##2); break; \
case 3: val.s012 = va_arg(ap, WIDTH##3); break; \
case 4: val.s0123 = va_arg(ap, WIDTH##4); break; \
case 8: val.lo = va_arg(ap, WIDTH##8); break; \
case 16: val = va_arg(ap, WIDTH##16); break; \
} \
_cl_print_ints_##WIDTH(flags, field_width, precision, \
ch, &val, vector_length); \
}
DEBUG_PRINTF(("[printf:int:conversion=%c]\n", ch));
switch (length) {
default: __builtin_unreachable();
case 1: CALL_PRINT_INTS(char, int); break;
case 2: CALL_PRINT_INTS(short, int); break;
case 0:
case 4: CALL_PRINT_INTS(int, int); break;
#ifdef cl_khr_int64
case 8: CALL_PRINT_INTS(long, long); break;
#endif
}
#undef CALL_PRINT_INTS
break;
// Output floats
case 'f':
case 'F':
case 'e':
case 'E':
case 'g':
case 'G':
case 'a':
case 'A':
#define CALL_PRINT_FLOATS(WIDTH, PROMOTED_WIDTH) \
{ \
WIDTH##16 val; \
switch (vector_length) { \
default: __builtin_unreachable(); \
case 1: val.s0 = va_arg(ap, PROMOTED_WIDTH); break; \
case 2: val.s01 = va_arg(ap, WIDTH##2); break; \
case 3: val.s012 = va_arg(ap, WIDTH##3); break; \
case 4: val.s0123 = va_arg(ap, WIDTH##4); break; \
case 8: val.lo = va_arg(ap, WIDTH##8); break; \
case 16: val = va_arg(ap, WIDTH##16); break; \
} \
_cl_print_floats_##WIDTH(flags, field_width, precision, \
ch, &val, vector_length); \
}
DEBUG_PRINTF(("[printf:float:conversion=%c]\n", ch));
switch (length) {
default: __builtin_unreachable();
#ifdef cl_khr_fp16
// case 2: CALL_PRINT_FLOATS(half, double); break;
case 2: goto error; // not yet implemented
#endif
case 0:
// Note: width 0 cleverly falls through to float if double
// is not supported
#ifdef cl_khr_fp64
case 8: CALL_PRINT_FLOATS(double, double); break;
case 4: CALL_PRINT_FLOATS(float, double); break;
#else
break;
#endif
}
#undef CALL_PRINT_FLOATS
break;
// Output a character
case 'c': {
DEBUG_PRINTF(("[printf:char]\n"));
if (flags.plus || flags.space || flags.alt || flags.zero) goto error;
DEBUG_PRINTF(("[printf:char1]\n"));
if (precision != -1) goto error;
DEBUG_PRINTF(("[printf:char2]\n"));
if (vector_length != 1) goto error;
DEBUG_PRINTF(("[printf:char3]\n"));
if (length != 0) goto error;
DEBUG_PRINTF(("[printf:char4]\n"));
int val = va_arg(ap, int);
_cl_print_char(flags, field_width, val);
break;
}
// Output a string
case 's': {
if (flags.plus || flags.space || flags.alt || flags.zero) goto error;
if (precision != -1) goto error;
if (vector_length != 1) goto error;
if (length != 0) goto error;
OCL_C_AS const char* val = va_arg(ap, OCL_C_AS const char*);
_cl_print_string(flags, field_width, val);
break;
}
// Output a pointer
case 'p': {
if (flags.plus || flags.space || flags.alt || flags.zero) goto error;
if (precision != -1) goto error;
if (vector_length != 1) goto error;
if (length != 0) goto error;
OCL_C_AS const void* val = va_arg(ap, OCL_C_AS const void*);
_cl_print_pointer(flags, field_width, val);
break;
}
default: goto error;
}
ch = *++format;
} // not a literal %
} else {
DEBUG_PRINTF(("[printf:literal]\n"));
char literal[] = "%c";
printf(literal, ch);
ch = *++format;
}
}
va_end(ap);
DEBUG_PRINTF(("[printf:done]\n"));
return 0;
error:;
va_end(ap);
DEBUG_PRINTF(("[printf:error]\n"));
char string [] = "(printf format string error)";
printf(string);
return -1;
}
#pragma clang diagnostic pop
#else
#warning TODO: Clang 4.0+ now errors out with variadic arguments
#endif
|
the_stack_data/69135.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 1000
#define M 1000
#define K 1000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int ii[M], jj[M], ww[M];
int *oh[N], oo[N];
void append(int i, int h) {
int o = oo[i]++;
if (o >= 2 && (o & o - 1) == 0)
oh[i] = (int *) realloc(oh[i], o * 2 * sizeof *oh[i]);
oh[i][o] = h;
}
int *dd_, iq[1 + N], pq[N], cnt;
int lt(int i, int j) {
return dd_[i] < dd_[j];
}
int p2(int p) {
return (p *= 2) > cnt ? 0 : (p < cnt && lt(iq[p + 1], iq[p]) ? p + 1 : p);
}
void pq_up(int i) {
int p, q, j;
for (p = pq[i]; (q = p / 2) && lt(i, j = iq[q]); p = q)
iq[pq[j] = p] = j;
iq[pq[i] = p] = i;
}
void pq_dn(int i) {
int p, q, j;
for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
iq[pq[j] = p] = j;
iq[pq[i] = p] = i;
}
void pq_add_last(int i) {
iq[pq[i] = ++cnt] = i;
}
int pq_remove_first() {
int i = iq[1], j = iq[cnt--];
if (j != i)
pq[j] = 1, pq_dn(j);
pq[i] = 0;
return i;
}
void dijkstra(int n, int s) {
memset(dd_, 0x3f, n * sizeof *dd_);
dd_[s] = 0, pq_add_last(s);
while (cnt) {
int i = pq_remove_first(), o;
for (o = 0; o < oo[i]; o++) {
int h = oh[i][o], j = i ^ ii[h] ^ jj[h], d = dd_[i] + ww[h];
if (dd_[j] > d) {
if (dd_[j] == INF)
pq_add_last(j);
dd_[j] = d, pq_up(j);
}
}
}
}
int main() {
static int dd[N][N], uu[K], vv[K];
int n, m, k, g, h, i, j, ans;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; i++)
oh[i] = (int *) malloc(2 * sizeof *oh[i]);
for (h = 0; h < m; h++) {
scanf("%d%d%d", &ii[h], &jj[h], &ww[h]), ii[h]--, jj[h]--;
append(ii[h], h), append(jj[h], h);
}
for (g = 0; g < k; g++)
scanf("%d%d", &uu[g], &vv[g]), uu[g]--, vv[g]--;
for (i = 0; i < n; i++)
dd_ = dd[i], dijkstra(n, i);
ans = INF;
for (h = 0; h < m; h++) {
int sum;
i = ii[h], j = jj[h], sum = 0;
for (g = 0; g < k; g++)
sum += min(dd[uu[g]][vv[g]], min(dd[uu[g]][i] + dd[j][vv[g]], dd[uu[g]][j] + dd[i][vv[g]]));
ans = min(ans, sum);
}
printf("%d\n", ans);
return 0;
}
|
the_stack_data/67326426.c
|
#include<stdio.h>
#include<string.h>
int flag;
int gcd(int n1, int n2){
if(n1==1 || n2==1){
return 1;
}
if(n1==n2){
return 0;
}
if(n1>n2){
return gcd(n1-n2,n2);
}
else{
return gcd(n1,n2-n1);
}
}
int main(){
char lang[]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','0','1','2','3','4','5','6','7','8','9',' '};
char pt[5],key[5];
int len = 63;
int i,j,k;
int ptm[2][2],keym[2][2];
printf("Enter Plain Text: ");
scanf("%s",pt);
printf("Enter Key Of Length 4 Of Prime Numbers:");
for(i=0;i<4;i++){
key[i] = getche();
}
printf("\n\n");
if(strlen(pt)!=4){
printf("Length Of Plain Text Should Be Equal To 4\n");
exit(0);
}
int flag=-1;
for(i=0;i<4;i++){
if((i+1)%2==1){
flag++;
}
for(j=0;j<len;j++){
if(pt[i] == lang[j]){
ptm[flag][i%2] = j;
}
if(key[i] == lang[j]){
keym[flag][i%2] = j;
}
}
}
int ctm[2][2];
for(i=0;i<2;i++){
for(j=0;j<2;j++){
ctm[i][j] = 0;
}
}
printf("\nCipher Text: ");
for(i=0;i<2;i++){
for(j=0;j<2;j++){
for(k=0;k<2;k++){
ctm[i][j] += keym[i][k] * ptm[k][j];
}
ctm[i][j] = ctm[i][j]%len;
printf("%c",lang[ctm[i][j]]);
}
}
printf("\n\n");
flag = keym[0][0]*keym[1][1] - keym[0][1]*keym[1][0];
int inv_num;
i = -1;
j = 1;
int f = flag;
if(flag<0){
f = -(flag);
}
if(!gcd(f,len)){
printf("Key Is Not Good, Try Another Key.");
}
while(1){
if((flag * i)%len==1){
inv_num = i;
break;
}
i--;
if((flag*j)%len==1){
inv_num = j;
break;
}
j++;
}
flag = keym[1][1];
keym[1][1] = keym[0][0];
keym[0][0] = flag;
keym[0][1] = -keym[0][1];
keym[1][0] = -keym[1][0];
int dtm[2][2];
printf("\nDecrypted Text: ");
for(i=0;i<2;i++){
for(j=0;j<2;j++){
dtm[i][j]=0;
for(k=0;k<2;k++){
dtm[i][j] += keym[i][k] * ctm[k][j] * inv_num ;
}
if(dtm[i][j]<0){
flag = len-((-dtm[i][j])%len);
printf("%c",lang[flag]);
}
else{
printf("%c",lang[dtm[i][j]%len]);
}
}
}
return 0;
}
|
the_stack_data/895296.c
|
// KASAN: use-after-free Read in j1939_tp_txtimer
// https://syzkaller.appspot.com/bug?id=6f64ebda3aa14d01cf286926de2d30726801b82f
// status:open
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <arpa/inet.h>
#include <dirent.h>
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <net/if.h>
#include <net/if_arp.h>
#include <netinet/in.h>
#include <pthread.h>
#include <sched.h>
#include <setjmp.h>
#include <signal.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ioctl.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/resource.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/uio.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>
#include <linux/capability.h>
#include <linux/futex.h>
#include <linux/genetlink.h>
#include <linux/if_addr.h>
#include <linux/if_ether.h>
#include <linux/if_link.h>
#include <linux/if_tun.h>
#include <linux/in6.h>
#include <linux/ip.h>
#include <linux/neighbour.h>
#include <linux/net.h>
#include <linux/netlink.h>
#include <linux/rtnetlink.h>
#include <linux/tcp.h>
#include <linux/veth.h>
unsigned long long procid;
static __thread int skip_segv;
static __thread jmp_buf segv_env;
static void segv_handler(int sig, siginfo_t* info, void* ctx)
{
uintptr_t addr = (uintptr_t)info->si_addr;
const uintptr_t prog_start = 1 << 20;
const uintptr_t prog_end = 100 << 20;
if (__atomic_load_n(&skip_segv, __ATOMIC_RELAXED) &&
(addr < prog_start || addr > prog_end)) {
_longjmp(segv_env, 1);
}
exit(sig);
}
static void install_segv_handler(void)
{
struct sigaction sa;
memset(&sa, 0, sizeof(sa));
sa.sa_handler = SIG_IGN;
syscall(SYS_rt_sigaction, 0x20, &sa, NULL, 8);
syscall(SYS_rt_sigaction, 0x21, &sa, NULL, 8);
memset(&sa, 0, sizeof(sa));
sa.sa_sigaction = segv_handler;
sa.sa_flags = SA_NODEFER | SA_SIGINFO;
sigaction(SIGSEGV, &sa, NULL);
sigaction(SIGBUS, &sa, NULL);
}
#define NONFAILING(...) \
{ \
__atomic_fetch_add(&skip_segv, 1, __ATOMIC_SEQ_CST); \
if (_setjmp(segv_env) == 0) { \
__VA_ARGS__; \
} \
__atomic_fetch_sub(&skip_segv, 1, __ATOMIC_SEQ_CST); \
}
static void sleep_ms(uint64_t ms)
{
usleep(ms * 1000);
}
static uint64_t current_time_ms(void)
{
struct timespec ts;
if (clock_gettime(CLOCK_MONOTONIC, &ts))
exit(1);
return (uint64_t)ts.tv_sec * 1000 + (uint64_t)ts.tv_nsec / 1000000;
}
static void use_temporary_dir(void)
{
char tmpdir_template[] = "./syzkaller.XXXXXX";
char* tmpdir = mkdtemp(tmpdir_template);
if (!tmpdir)
exit(1);
if (chmod(tmpdir, 0777))
exit(1);
if (chdir(tmpdir))
exit(1);
}
static void thread_start(void* (*fn)(void*), void* arg)
{
pthread_t th;
pthread_attr_t attr;
pthread_attr_init(&attr);
pthread_attr_setstacksize(&attr, 128 << 10);
int i;
for (i = 0; i < 100; i++) {
if (pthread_create(&th, &attr, fn, arg) == 0) {
pthread_attr_destroy(&attr);
return;
}
if (errno == EAGAIN) {
usleep(50);
continue;
}
break;
}
exit(1);
}
typedef struct {
int state;
} event_t;
static void event_init(event_t* ev)
{
ev->state = 0;
}
static void event_reset(event_t* ev)
{
ev->state = 0;
}
static void event_set(event_t* ev)
{
if (ev->state)
exit(1);
__atomic_store_n(&ev->state, 1, __ATOMIC_RELEASE);
syscall(SYS_futex, &ev->state, FUTEX_WAKE | FUTEX_PRIVATE_FLAG, 1000000);
}
static void event_wait(event_t* ev)
{
while (!__atomic_load_n(&ev->state, __ATOMIC_ACQUIRE))
syscall(SYS_futex, &ev->state, FUTEX_WAIT | FUTEX_PRIVATE_FLAG, 0, 0);
}
static int event_isset(event_t* ev)
{
return __atomic_load_n(&ev->state, __ATOMIC_ACQUIRE);
}
static int event_timedwait(event_t* ev, uint64_t timeout)
{
uint64_t start = current_time_ms();
uint64_t now = start;
for (;;) {
uint64_t remain = timeout - (now - start);
struct timespec ts;
ts.tv_sec = remain / 1000;
ts.tv_nsec = (remain % 1000) * 1000 * 1000;
syscall(SYS_futex, &ev->state, FUTEX_WAIT | FUTEX_PRIVATE_FLAG, 0, &ts);
if (__atomic_load_n(&ev->state, __ATOMIC_RELAXED))
return 1;
now = current_time_ms();
if (now - start > timeout)
return 0;
}
}
static bool write_file(const char* file, const char* what, ...)
{
char buf[1024];
va_list args;
va_start(args, what);
vsnprintf(buf, sizeof(buf), what, args);
va_end(args);
buf[sizeof(buf) - 1] = 0;
int len = strlen(buf);
int fd = open(file, O_WRONLY | O_CLOEXEC);
if (fd == -1)
return false;
if (write(fd, buf, len) != len) {
int err = errno;
close(fd);
errno = err;
return false;
}
close(fd);
return true;
}
struct nlmsg {
char* pos;
int nesting;
struct nlattr* nested[8];
char buf[1024];
};
static struct nlmsg nlmsg;
static void netlink_init(struct nlmsg* nlmsg, int typ, int flags,
const void* data, int size)
{
memset(nlmsg, 0, sizeof(*nlmsg));
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg->buf;
hdr->nlmsg_type = typ;
hdr->nlmsg_flags = NLM_F_REQUEST | NLM_F_ACK | flags;
memcpy(hdr + 1, data, size);
nlmsg->pos = (char*)(hdr + 1) + NLMSG_ALIGN(size);
}
static void netlink_attr(struct nlmsg* nlmsg, int typ, const void* data,
int size)
{
struct nlattr* attr = (struct nlattr*)nlmsg->pos;
attr->nla_len = sizeof(*attr) + size;
attr->nla_type = typ;
memcpy(attr + 1, data, size);
nlmsg->pos += NLMSG_ALIGN(attr->nla_len);
}
static void netlink_nest(struct nlmsg* nlmsg, int typ)
{
struct nlattr* attr = (struct nlattr*)nlmsg->pos;
attr->nla_type = typ;
nlmsg->pos += sizeof(*attr);
nlmsg->nested[nlmsg->nesting++] = attr;
}
static void netlink_done(struct nlmsg* nlmsg)
{
struct nlattr* attr = nlmsg->nested[--nlmsg->nesting];
attr->nla_len = nlmsg->pos - (char*)attr;
}
static int netlink_send_ext(struct nlmsg* nlmsg, int sock, uint16_t reply_type,
int* reply_len)
{
if (nlmsg->pos > nlmsg->buf + sizeof(nlmsg->buf) || nlmsg->nesting)
exit(1);
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg->buf;
hdr->nlmsg_len = nlmsg->pos - nlmsg->buf;
struct sockaddr_nl addr;
memset(&addr, 0, sizeof(addr));
addr.nl_family = AF_NETLINK;
unsigned n = sendto(sock, nlmsg->buf, hdr->nlmsg_len, 0,
(struct sockaddr*)&addr, sizeof(addr));
if (n != hdr->nlmsg_len)
exit(1);
n = recv(sock, nlmsg->buf, sizeof(nlmsg->buf), 0);
if (hdr->nlmsg_type == NLMSG_DONE) {
*reply_len = 0;
return 0;
}
if (n < sizeof(struct nlmsghdr))
exit(1);
if (reply_len && hdr->nlmsg_type == reply_type) {
*reply_len = n;
return 0;
}
if (n < sizeof(struct nlmsghdr) + sizeof(struct nlmsgerr))
exit(1);
if (hdr->nlmsg_type != NLMSG_ERROR)
exit(1);
return -((struct nlmsgerr*)(hdr + 1))->error;
}
static int netlink_send(struct nlmsg* nlmsg, int sock)
{
return netlink_send_ext(nlmsg, sock, 0, NULL);
}
static int netlink_next_msg(struct nlmsg* nlmsg, unsigned int offset,
unsigned int total_len)
{
struct nlmsghdr* hdr = (struct nlmsghdr*)(nlmsg->buf + offset);
if (offset == total_len || offset + hdr->nlmsg_len > total_len)
return -1;
return hdr->nlmsg_len;
}
static void netlink_add_device_impl(struct nlmsg* nlmsg, const char* type,
const char* name)
{
struct ifinfomsg hdr;
memset(&hdr, 0, sizeof(hdr));
netlink_init(nlmsg, RTM_NEWLINK, NLM_F_EXCL | NLM_F_CREATE, &hdr,
sizeof(hdr));
if (name)
netlink_attr(nlmsg, IFLA_IFNAME, name, strlen(name));
netlink_nest(nlmsg, IFLA_LINKINFO);
netlink_attr(nlmsg, IFLA_INFO_KIND, type, strlen(type));
}
static void netlink_add_device(struct nlmsg* nlmsg, int sock, const char* type,
const char* name)
{
netlink_add_device_impl(nlmsg, type, name);
netlink_done(nlmsg);
int err = netlink_send(nlmsg, sock);
(void)err;
}
static void netlink_add_veth(struct nlmsg* nlmsg, int sock, const char* name,
const char* peer)
{
netlink_add_device_impl(nlmsg, "veth", name);
netlink_nest(nlmsg, IFLA_INFO_DATA);
netlink_nest(nlmsg, VETH_INFO_PEER);
nlmsg->pos += sizeof(struct ifinfomsg);
netlink_attr(nlmsg, IFLA_IFNAME, peer, strlen(peer));
netlink_done(nlmsg);
netlink_done(nlmsg);
netlink_done(nlmsg);
int err = netlink_send(nlmsg, sock);
(void)err;
}
static void netlink_add_hsr(struct nlmsg* nlmsg, int sock, const char* name,
const char* slave1, const char* slave2)
{
netlink_add_device_impl(nlmsg, "hsr", name);
netlink_nest(nlmsg, IFLA_INFO_DATA);
int ifindex1 = if_nametoindex(slave1);
netlink_attr(nlmsg, IFLA_HSR_SLAVE1, &ifindex1, sizeof(ifindex1));
int ifindex2 = if_nametoindex(slave2);
netlink_attr(nlmsg, IFLA_HSR_SLAVE2, &ifindex2, sizeof(ifindex2));
netlink_done(nlmsg);
netlink_done(nlmsg);
int err = netlink_send(nlmsg, sock);
(void)err;
}
static void netlink_device_change(struct nlmsg* nlmsg, int sock,
const char* name, bool up, const char* master,
const void* mac, int macsize,
const char* new_name)
{
struct ifinfomsg hdr;
memset(&hdr, 0, sizeof(hdr));
if (up)
hdr.ifi_flags = hdr.ifi_change = IFF_UP;
hdr.ifi_index = if_nametoindex(name);
netlink_init(nlmsg, RTM_NEWLINK, 0, &hdr, sizeof(hdr));
if (new_name)
netlink_attr(nlmsg, IFLA_IFNAME, new_name, strlen(new_name));
if (master) {
int ifindex = if_nametoindex(master);
netlink_attr(nlmsg, IFLA_MASTER, &ifindex, sizeof(ifindex));
}
if (macsize)
netlink_attr(nlmsg, IFLA_ADDRESS, mac, macsize);
int err = netlink_send(nlmsg, sock);
(void)err;
}
static int netlink_add_addr(struct nlmsg* nlmsg, int sock, const char* dev,
const void* addr, int addrsize)
{
struct ifaddrmsg hdr;
memset(&hdr, 0, sizeof(hdr));
hdr.ifa_family = addrsize == 4 ? AF_INET : AF_INET6;
hdr.ifa_prefixlen = addrsize == 4 ? 24 : 120;
hdr.ifa_scope = RT_SCOPE_UNIVERSE;
hdr.ifa_index = if_nametoindex(dev);
netlink_init(nlmsg, RTM_NEWADDR, NLM_F_CREATE | NLM_F_REPLACE, &hdr,
sizeof(hdr));
netlink_attr(nlmsg, IFA_LOCAL, addr, addrsize);
netlink_attr(nlmsg, IFA_ADDRESS, addr, addrsize);
return netlink_send(nlmsg, sock);
}
static void netlink_add_addr4(struct nlmsg* nlmsg, int sock, const char* dev,
const char* addr)
{
struct in_addr in_addr;
inet_pton(AF_INET, addr, &in_addr);
int err = netlink_add_addr(nlmsg, sock, dev, &in_addr, sizeof(in_addr));
(void)err;
}
static void netlink_add_addr6(struct nlmsg* nlmsg, int sock, const char* dev,
const char* addr)
{
struct in6_addr in6_addr;
inet_pton(AF_INET6, addr, &in6_addr);
int err = netlink_add_addr(nlmsg, sock, dev, &in6_addr, sizeof(in6_addr));
(void)err;
}
static void netlink_add_neigh(struct nlmsg* nlmsg, int sock, const char* name,
const void* addr, int addrsize, const void* mac,
int macsize)
{
struct ndmsg hdr;
memset(&hdr, 0, sizeof(hdr));
hdr.ndm_family = addrsize == 4 ? AF_INET : AF_INET6;
hdr.ndm_ifindex = if_nametoindex(name);
hdr.ndm_state = NUD_PERMANENT;
netlink_init(nlmsg, RTM_NEWNEIGH, NLM_F_EXCL | NLM_F_CREATE, &hdr,
sizeof(hdr));
netlink_attr(nlmsg, NDA_DST, addr, addrsize);
netlink_attr(nlmsg, NDA_LLADDR, mac, macsize);
int err = netlink_send(nlmsg, sock);
(void)err;
}
static int tunfd = -1;
static int tun_frags_enabled;
#define TUN_IFACE "syz_tun"
#define LOCAL_MAC 0xaaaaaaaaaaaa
#define REMOTE_MAC 0xaaaaaaaaaabb
#define LOCAL_IPV4 "172.20.20.170"
#define REMOTE_IPV4 "172.20.20.187"
#define LOCAL_IPV6 "fe80::aa"
#define REMOTE_IPV6 "fe80::bb"
#define IFF_NAPI 0x0010
#define IFF_NAPI_FRAGS 0x0020
static void initialize_tun(void)
{
tunfd = open("/dev/net/tun", O_RDWR | O_NONBLOCK);
if (tunfd == -1) {
printf("tun: can't open /dev/net/tun: please enable CONFIG_TUN=y\n");
printf("otherwise fuzzing or reproducing might not work as intended\n");
return;
}
const int kTunFd = 240;
if (dup2(tunfd, kTunFd) < 0)
exit(1);
close(tunfd);
tunfd = kTunFd;
struct ifreq ifr;
memset(&ifr, 0, sizeof(ifr));
strncpy(ifr.ifr_name, TUN_IFACE, IFNAMSIZ);
ifr.ifr_flags = IFF_TAP | IFF_NO_PI | IFF_NAPI | IFF_NAPI_FRAGS;
if (ioctl(tunfd, TUNSETIFF, (void*)&ifr) < 0) {
ifr.ifr_flags = IFF_TAP | IFF_NO_PI;
if (ioctl(tunfd, TUNSETIFF, (void*)&ifr) < 0)
exit(1);
}
if (ioctl(tunfd, TUNGETIFF, (void*)&ifr) < 0)
exit(1);
tun_frags_enabled = (ifr.ifr_flags & IFF_NAPI_FRAGS) != 0;
char sysctl[64];
sprintf(sysctl, "/proc/sys/net/ipv6/conf/%s/accept_dad", TUN_IFACE);
write_file(sysctl, "0");
sprintf(sysctl, "/proc/sys/net/ipv6/conf/%s/router_solicitations", TUN_IFACE);
write_file(sysctl, "0");
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
netlink_add_addr4(&nlmsg, sock, TUN_IFACE, LOCAL_IPV4);
netlink_add_addr6(&nlmsg, sock, TUN_IFACE, LOCAL_IPV6);
uint64_t macaddr = REMOTE_MAC;
struct in_addr in_addr;
inet_pton(AF_INET, REMOTE_IPV4, &in_addr);
netlink_add_neigh(&nlmsg, sock, TUN_IFACE, &in_addr, sizeof(in_addr),
&macaddr, ETH_ALEN);
struct in6_addr in6_addr;
inet_pton(AF_INET6, REMOTE_IPV6, &in6_addr);
netlink_add_neigh(&nlmsg, sock, TUN_IFACE, &in6_addr, sizeof(in6_addr),
&macaddr, ETH_ALEN);
macaddr = LOCAL_MAC;
netlink_device_change(&nlmsg, sock, TUN_IFACE, true, 0, &macaddr, ETH_ALEN,
NULL);
close(sock);
}
const int kInitNetNsFd = 239;
#define DEVLINK_FAMILY_NAME "devlink"
#define DEVLINK_CMD_PORT_GET 5
#define DEVLINK_CMD_RELOAD 37
#define DEVLINK_ATTR_BUS_NAME 1
#define DEVLINK_ATTR_DEV_NAME 2
#define DEVLINK_ATTR_NETDEV_NAME 7
#define DEVLINK_ATTR_NETNS_FD 138
static int netlink_devlink_id_get(struct nlmsg* nlmsg, int sock)
{
struct genlmsghdr genlhdr;
struct nlattr* attr;
int err, n;
uint16_t id = 0;
memset(&genlhdr, 0, sizeof(genlhdr));
genlhdr.cmd = CTRL_CMD_GETFAMILY;
netlink_init(nlmsg, GENL_ID_CTRL, 0, &genlhdr, sizeof(genlhdr));
netlink_attr(nlmsg, CTRL_ATTR_FAMILY_NAME, DEVLINK_FAMILY_NAME,
strlen(DEVLINK_FAMILY_NAME) + 1);
err = netlink_send_ext(nlmsg, sock, GENL_ID_CTRL, &n);
if (err) {
return -1;
}
attr = (struct nlattr*)(nlmsg->buf + NLMSG_HDRLEN +
NLMSG_ALIGN(sizeof(genlhdr)));
for (; (char*)attr < nlmsg->buf + n;
attr = (struct nlattr*)((char*)attr + NLMSG_ALIGN(attr->nla_len))) {
if (attr->nla_type == CTRL_ATTR_FAMILY_ID) {
id = *(uint16_t*)(attr + 1);
break;
}
}
if (!id) {
return -1;
}
recv(sock, nlmsg->buf, sizeof(nlmsg->buf), 0); /* recv ack */
return id;
}
static void netlink_devlink_netns_move(const char* bus_name,
const char* dev_name, int netns_fd)
{
struct genlmsghdr genlhdr;
int sock;
int id, err;
sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_GENERIC);
if (sock == -1)
exit(1);
id = netlink_devlink_id_get(&nlmsg, sock);
if (id == -1)
goto error;
memset(&genlhdr, 0, sizeof(genlhdr));
genlhdr.cmd = DEVLINK_CMD_RELOAD;
netlink_init(&nlmsg, id, 0, &genlhdr, sizeof(genlhdr));
netlink_attr(&nlmsg, DEVLINK_ATTR_BUS_NAME, bus_name, strlen(bus_name) + 1);
netlink_attr(&nlmsg, DEVLINK_ATTR_DEV_NAME, dev_name, strlen(dev_name) + 1);
netlink_attr(&nlmsg, DEVLINK_ATTR_NETNS_FD, &netns_fd, sizeof(netns_fd));
err = netlink_send(&nlmsg, sock);
if (err) {
}
error:
close(sock);
}
static struct nlmsg nlmsg2;
static void initialize_devlink_ports(const char* bus_name, const char* dev_name,
const char* netdev_prefix)
{
struct genlmsghdr genlhdr;
int len, total_len, id, err, offset;
uint16_t netdev_index;
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_GENERIC);
if (sock == -1)
exit(1);
int rtsock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (rtsock == -1)
exit(1);
id = netlink_devlink_id_get(&nlmsg, sock);
if (id == -1)
goto error;
memset(&genlhdr, 0, sizeof(genlhdr));
genlhdr.cmd = DEVLINK_CMD_PORT_GET;
netlink_init(&nlmsg, id, NLM_F_DUMP, &genlhdr, sizeof(genlhdr));
netlink_attr(&nlmsg, DEVLINK_ATTR_BUS_NAME, bus_name, strlen(bus_name) + 1);
netlink_attr(&nlmsg, DEVLINK_ATTR_DEV_NAME, dev_name, strlen(dev_name) + 1);
err = netlink_send_ext(&nlmsg, sock, id, &total_len);
if (err) {
goto error;
}
offset = 0;
netdev_index = 0;
while ((len = netlink_next_msg(&nlmsg, offset, total_len)) != -1) {
struct nlattr* attr = (struct nlattr*)(nlmsg.buf + offset + NLMSG_HDRLEN +
NLMSG_ALIGN(sizeof(genlhdr)));
for (; (char*)attr < nlmsg.buf + offset + len;
attr = (struct nlattr*)((char*)attr + NLMSG_ALIGN(attr->nla_len))) {
if (attr->nla_type == DEVLINK_ATTR_NETDEV_NAME) {
char* port_name;
char netdev_name[IFNAMSIZ];
port_name = (char*)(attr + 1);
snprintf(netdev_name, sizeof(netdev_name), "%s%d", netdev_prefix,
netdev_index);
netlink_device_change(&nlmsg2, rtsock, port_name, true, 0, 0, 0,
netdev_name);
break;
}
}
offset += len;
netdev_index++;
}
error:
close(rtsock);
close(sock);
}
static void initialize_devlink_pci(void)
{
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
exit(1);
int ret = setns(kInitNetNsFd, 0);
if (ret == -1)
exit(1);
netlink_devlink_netns_move("pci", "0000:00:10.0", netns);
ret = setns(netns, 0);
if (ret == -1)
exit(1);
close(netns);
initialize_devlink_ports("pci", "0000:00:10.0", "netpci");
}
#define DEV_IPV4 "172.20.20.%d"
#define DEV_IPV6 "fe80::%02x"
#define DEV_MAC 0x00aaaaaaaaaa
static void netdevsim_add(unsigned int addr, unsigned int port_count)
{
char buf[16];
sprintf(buf, "%u %u", addr, port_count);
if (write_file("/sys/bus/netdevsim/new_device", buf)) {
snprintf(buf, sizeof(buf), "netdevsim%d", addr);
initialize_devlink_ports("netdevsim", buf, "netdevsim");
}
}
static void initialize_netdevices(void)
{
char netdevsim[16];
sprintf(netdevsim, "netdevsim%d", (int)procid);
struct {
const char* type;
const char* dev;
} devtypes[] = {
{"ip6gretap", "ip6gretap0"}, {"bridge", "bridge0"},
{"vcan", "vcan0"}, {"bond", "bond0"},
{"team", "team0"}, {"dummy", "dummy0"},
{"nlmon", "nlmon0"}, {"caif", "caif0"},
{"batadv", "batadv0"}, {"vxcan", "vxcan1"},
{"netdevsim", netdevsim}, {"veth", 0},
};
const char* devmasters[] = {"bridge", "bond", "team"};
struct {
const char* name;
int macsize;
bool noipv6;
} devices[] = {
{"lo", ETH_ALEN},
{"sit0", 0},
{"bridge0", ETH_ALEN},
{"vcan0", 0, true},
{"tunl0", 0},
{"gre0", 0},
{"gretap0", ETH_ALEN},
{"ip_vti0", 0},
{"ip6_vti0", 0},
{"ip6tnl0", 0},
{"ip6gre0", 0},
{"ip6gretap0", ETH_ALEN},
{"erspan0", ETH_ALEN},
{"bond0", ETH_ALEN},
{"veth0", ETH_ALEN},
{"veth1", ETH_ALEN},
{"team0", ETH_ALEN},
{"veth0_to_bridge", ETH_ALEN},
{"veth1_to_bridge", ETH_ALEN},
{"veth0_to_bond", ETH_ALEN},
{"veth1_to_bond", ETH_ALEN},
{"veth0_to_team", ETH_ALEN},
{"veth1_to_team", ETH_ALEN},
{"veth0_to_hsr", ETH_ALEN},
{"veth1_to_hsr", ETH_ALEN},
{"hsr0", 0},
{"dummy0", ETH_ALEN},
{"nlmon0", 0},
{"vxcan0", 0, true},
{"vxcan1", 0, true},
{"caif0", ETH_ALEN},
{"batadv0", ETH_ALEN},
{netdevsim, ETH_ALEN},
};
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
unsigned i;
for (i = 0; i < sizeof(devtypes) / sizeof(devtypes[0]); i++)
netlink_add_device(&nlmsg, sock, devtypes[i].type, devtypes[i].dev);
for (i = 0; i < sizeof(devmasters) / (sizeof(devmasters[0])); i++) {
char master[32], slave0[32], veth0[32], slave1[32], veth1[32];
sprintf(slave0, "%s_slave_0", devmasters[i]);
sprintf(veth0, "veth0_to_%s", devmasters[i]);
netlink_add_veth(&nlmsg, sock, slave0, veth0);
sprintf(slave1, "%s_slave_1", devmasters[i]);
sprintf(veth1, "veth1_to_%s", devmasters[i]);
netlink_add_veth(&nlmsg, sock, slave1, veth1);
sprintf(master, "%s0", devmasters[i]);
netlink_device_change(&nlmsg, sock, slave0, false, master, 0, 0, NULL);
netlink_device_change(&nlmsg, sock, slave1, false, master, 0, 0, NULL);
}
netlink_device_change(&nlmsg, sock, "bridge_slave_0", true, 0, 0, 0, NULL);
netlink_device_change(&nlmsg, sock, "bridge_slave_1", true, 0, 0, 0, NULL);
netlink_add_veth(&nlmsg, sock, "hsr_slave_0", "veth0_to_hsr");
netlink_add_veth(&nlmsg, sock, "hsr_slave_1", "veth1_to_hsr");
netlink_add_hsr(&nlmsg, sock, "hsr0", "hsr_slave_0", "hsr_slave_1");
netlink_device_change(&nlmsg, sock, "hsr_slave_0", true, 0, 0, 0, NULL);
netlink_device_change(&nlmsg, sock, "hsr_slave_1", true, 0, 0, 0, NULL);
netdevsim_add((int)procid, 4);
for (i = 0; i < sizeof(devices) / (sizeof(devices[0])); i++) {
char addr[32];
sprintf(addr, DEV_IPV4, i + 10);
netlink_add_addr4(&nlmsg, sock, devices[i].name, addr);
if (!devices[i].noipv6) {
sprintf(addr, DEV_IPV6, i + 10);
netlink_add_addr6(&nlmsg, sock, devices[i].name, addr);
}
uint64_t macaddr = DEV_MAC + ((i + 10ull) << 40);
netlink_device_change(&nlmsg, sock, devices[i].name, true, 0, &macaddr,
devices[i].macsize, NULL);
}
close(sock);
}
static void initialize_netdevices_init(void)
{
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
struct {
const char* type;
int macsize;
bool noipv6;
bool noup;
} devtypes[] = {
{"nr", 7, true}, {"rose", 5, true, true},
};
unsigned i;
for (i = 0; i < sizeof(devtypes) / sizeof(devtypes[0]); i++) {
char dev[32], addr[32];
sprintf(dev, "%s%d", devtypes[i].type, (int)procid);
sprintf(addr, "172.30.%d.%d", i, (int)procid + 1);
netlink_add_addr4(&nlmsg, sock, dev, addr);
if (!devtypes[i].noipv6) {
sprintf(addr, "fe88::%02x:%02x", i, (int)procid + 1);
netlink_add_addr6(&nlmsg, sock, dev, addr);
}
int macsize = devtypes[i].macsize;
uint64_t macaddr = 0xbbbbbb +
((unsigned long long)i << (8 * (macsize - 2))) +
(procid << (8 * (macsize - 1)));
netlink_device_change(&nlmsg, sock, dev, !devtypes[i].noup, 0, &macaddr,
macsize, NULL);
}
close(sock);
}
static int read_tun(char* data, int size)
{
if (tunfd < 0)
return -1;
int rv = read(tunfd, data, size);
if (rv < 0) {
if (errno == EAGAIN)
return -1;
if (errno == EBADFD)
return -1;
exit(1);
}
return rv;
}
static void flush_tun()
{
char data[1000];
while (read_tun(&data[0], sizeof(data)) != -1) {
}
}
#define MAX_FDS 30
static void setup_cgroups()
{
if (mkdir("/syzcgroup", 0777)) {
}
if (mkdir("/syzcgroup/unified", 0777)) {
}
if (mount("none", "/syzcgroup/unified", "cgroup2", 0, NULL)) {
}
if (chmod("/syzcgroup/unified", 0777)) {
}
write_file("/syzcgroup/unified/cgroup.subtree_control",
"+cpu +memory +io +pids +rdma");
if (mkdir("/syzcgroup/cpu", 0777)) {
}
if (mount("none", "/syzcgroup/cpu", "cgroup", 0,
"cpuset,cpuacct,perf_event,hugetlb")) {
}
write_file("/syzcgroup/cpu/cgroup.clone_children", "1");
if (chmod("/syzcgroup/cpu", 0777)) {
}
if (mkdir("/syzcgroup/net", 0777)) {
}
if (mount("none", "/syzcgroup/net", "cgroup", 0,
"net_cls,net_prio,devices,freezer")) {
}
if (chmod("/syzcgroup/net", 0777)) {
}
}
static void setup_cgroups_loop()
{
int pid = getpid();
char file[128];
char cgroupdir[64];
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/unified/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/pids.max", cgroupdir);
write_file(file, "32");
snprintf(file, sizeof(file), "%s/memory.low", cgroupdir);
write_file(file, "%d", 298 << 20);
snprintf(file, sizeof(file), "%s/memory.high", cgroupdir);
write_file(file, "%d", 299 << 20);
snprintf(file, sizeof(file), "%s/memory.max", cgroupdir);
write_file(file, "%d", 300 << 20);
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/cpu/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/net/syz%llu", procid);
if (mkdir(cgroupdir, 0777)) {
}
snprintf(file, sizeof(file), "%s/cgroup.procs", cgroupdir);
write_file(file, "%d", pid);
}
static void setup_cgroups_test()
{
char cgroupdir[64];
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/unified/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup")) {
}
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/cpu/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup.cpu")) {
}
snprintf(cgroupdir, sizeof(cgroupdir), "/syzcgroup/net/syz%llu", procid);
if (symlink(cgroupdir, "./cgroup.net")) {
}
}
static void setup_common()
{
if (mount(0, "/sys/fs/fuse/connections", "fusectl", 0, 0)) {
}
setup_cgroups();
}
static void loop();
static void sandbox_common()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setsid();
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
exit(1);
if (dup2(netns, kInitNetNsFd) < 0)
exit(1);
close(netns);
struct rlimit rlim;
rlim.rlim_cur = rlim.rlim_max = (200 << 20);
setrlimit(RLIMIT_AS, &rlim);
rlim.rlim_cur = rlim.rlim_max = 32 << 20;
setrlimit(RLIMIT_MEMLOCK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 136 << 20;
setrlimit(RLIMIT_FSIZE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 1 << 20;
setrlimit(RLIMIT_STACK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 0;
setrlimit(RLIMIT_CORE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 256;
setrlimit(RLIMIT_NOFILE, &rlim);
if (unshare(CLONE_NEWNS)) {
}
if (unshare(CLONE_NEWIPC)) {
}
if (unshare(0x02000000)) {
}
if (unshare(CLONE_NEWUTS)) {
}
if (unshare(CLONE_SYSVSEM)) {
}
typedef struct {
const char* name;
const char* value;
} sysctl_t;
static const sysctl_t sysctls[] = {
{"/proc/sys/kernel/shmmax", "16777216"},
{"/proc/sys/kernel/shmall", "536870912"},
{"/proc/sys/kernel/shmmni", "1024"},
{"/proc/sys/kernel/msgmax", "8192"},
{"/proc/sys/kernel/msgmni", "1024"},
{"/proc/sys/kernel/msgmnb", "1024"},
{"/proc/sys/kernel/sem", "1024 1048576 500 1024"},
};
unsigned i;
for (i = 0; i < sizeof(sysctls) / sizeof(sysctls[0]); i++)
write_file(sysctls[i].name, sysctls[i].value);
}
int wait_for_loop(int pid)
{
if (pid < 0)
exit(1);
int status = 0;
while (waitpid(-1, &status, __WALL) != pid) {
}
return WEXITSTATUS(status);
}
static void drop_caps(void)
{
struct __user_cap_header_struct cap_hdr = {};
struct __user_cap_data_struct cap_data[2] = {};
cap_hdr.version = _LINUX_CAPABILITY_VERSION_3;
cap_hdr.pid = getpid();
if (syscall(SYS_capget, &cap_hdr, &cap_data))
exit(1);
const int drop = (1 << CAP_SYS_PTRACE) | (1 << CAP_SYS_NICE);
cap_data[0].effective &= ~drop;
cap_data[0].permitted &= ~drop;
cap_data[0].inheritable &= ~drop;
if (syscall(SYS_capset, &cap_hdr, &cap_data))
exit(1);
}
static int do_sandbox_none(void)
{
if (unshare(CLONE_NEWPID)) {
}
int pid = fork();
if (pid != 0)
return wait_for_loop(pid);
setup_common();
sandbox_common();
drop_caps();
initialize_netdevices_init();
if (unshare(CLONE_NEWNET)) {
}
initialize_devlink_pci();
initialize_tun();
initialize_netdevices();
loop();
exit(1);
}
#define FS_IOC_SETFLAGS _IOW('f', 2, long)
static void remove_dir(const char* dir)
{
DIR* dp;
struct dirent* ep;
int iter = 0;
retry:
while (umount2(dir, MNT_DETACH) == 0) {
}
dp = opendir(dir);
if (dp == NULL) {
if (errno == EMFILE) {
exit(1);
}
exit(1);
}
while ((ep = readdir(dp))) {
if (strcmp(ep->d_name, ".") == 0 || strcmp(ep->d_name, "..") == 0)
continue;
char filename[FILENAME_MAX];
snprintf(filename, sizeof(filename), "%s/%s", dir, ep->d_name);
while (umount2(filename, MNT_DETACH) == 0) {
}
struct stat st;
if (lstat(filename, &st))
exit(1);
if (S_ISDIR(st.st_mode)) {
remove_dir(filename);
continue;
}
int i;
for (i = 0;; i++) {
if (unlink(filename) == 0)
break;
if (errno == EPERM) {
int fd = open(filename, O_RDONLY);
if (fd != -1) {
long flags = 0;
if (ioctl(fd, FS_IOC_SETFLAGS, &flags) == 0) {
}
close(fd);
continue;
}
}
if (errno == EROFS) {
break;
}
if (errno != EBUSY || i > 100)
exit(1);
if (umount2(filename, MNT_DETACH))
exit(1);
}
}
closedir(dp);
int i;
for (i = 0;; i++) {
if (rmdir(dir) == 0)
break;
if (i < 100) {
if (errno == EPERM) {
int fd = open(dir, O_RDONLY);
if (fd != -1) {
long flags = 0;
if (ioctl(fd, FS_IOC_SETFLAGS, &flags) == 0) {
}
close(fd);
continue;
}
}
if (errno == EROFS) {
break;
}
if (errno == EBUSY) {
if (umount2(dir, MNT_DETACH))
exit(1);
continue;
}
if (errno == ENOTEMPTY) {
if (iter < 100) {
iter++;
goto retry;
}
}
}
exit(1);
}
}
static void kill_and_wait(int pid, int* status)
{
kill(-pid, SIGKILL);
kill(pid, SIGKILL);
int i;
for (i = 0; i < 100; i++) {
if (waitpid(-1, status, WNOHANG | __WALL) == pid)
return;
usleep(1000);
}
DIR* dir = opendir("/sys/fs/fuse/connections");
if (dir) {
for (;;) {
struct dirent* ent = readdir(dir);
if (!ent)
break;
if (strcmp(ent->d_name, ".") == 0 || strcmp(ent->d_name, "..") == 0)
continue;
char abort[300];
snprintf(abort, sizeof(abort), "/sys/fs/fuse/connections/%s/abort",
ent->d_name);
int fd = open(abort, O_WRONLY);
if (fd == -1) {
continue;
}
if (write(fd, abort, 1) < 0) {
}
close(fd);
}
closedir(dir);
} else {
}
while (waitpid(-1, status, __WALL) != pid) {
}
}
static void setup_loop()
{
setup_cgroups_loop();
}
static void setup_test()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setup_cgroups_test();
write_file("/proc/self/oom_score_adj", "1000");
flush_tun();
}
static void close_fds()
{
int fd;
for (fd = 3; fd < MAX_FDS; fd++)
close(fd);
}
static void setup_binfmt_misc()
{
if (mount(0, "/proc/sys/fs/binfmt_misc", "binfmt_misc", 0, 0)) {
}
write_file("/proc/sys/fs/binfmt_misc/register", ":syz0:M:0:\x01::./file0:");
write_file("/proc/sys/fs/binfmt_misc/register",
":syz1:M:1:\x02::./file0:POC");
}
struct thread_t {
int created, call;
event_t ready, done;
};
static struct thread_t threads[16];
static void execute_call(int call);
static int running;
static void* thr(void* arg)
{
struct thread_t* th = (struct thread_t*)arg;
for (;;) {
event_wait(&th->ready);
event_reset(&th->ready);
execute_call(th->call);
__atomic_fetch_sub(&running, 1, __ATOMIC_RELAXED);
event_set(&th->done);
}
return 0;
}
static void execute_one(void)
{
int i, call, thread;
int collide = 0;
again:
for (call = 0; call < 17; call++) {
for (thread = 0; thread < (int)(sizeof(threads) / sizeof(threads[0]));
thread++) {
struct thread_t* th = &threads[thread];
if (!th->created) {
th->created = 1;
event_init(&th->ready);
event_init(&th->done);
event_set(&th->done);
thread_start(thr, th);
}
if (!event_isset(&th->done))
continue;
event_reset(&th->done);
th->call = call;
__atomic_fetch_add(&running, 1, __ATOMIC_RELAXED);
event_set(&th->ready);
if (collide && (call % 2) == 0)
break;
event_timedwait(&th->done, 45);
break;
}
}
for (i = 0; i < 100 && __atomic_load_n(&running, __ATOMIC_RELAXED); i++)
sleep_ms(1);
close_fds();
if (!collide) {
collide = 1;
goto again;
}
}
static void execute_one(void);
#define WAIT_FLAGS __WALL
static void loop(void)
{
setup_loop();
int iter;
for (iter = 0;; iter++) {
char cwdbuf[32];
sprintf(cwdbuf, "./%d", iter);
if (mkdir(cwdbuf, 0777))
exit(1);
int pid = fork();
if (pid < 0)
exit(1);
if (pid == 0) {
if (chdir(cwdbuf))
exit(1);
setup_test();
execute_one();
exit(0);
}
int status = 0;
uint64_t start = current_time_ms();
for (;;) {
if (waitpid(-1, &status, WNOHANG | WAIT_FLAGS) == pid)
break;
sleep_ms(1);
if (current_time_ms() - start < 5 * 1000)
continue;
kill_and_wait(pid, &status);
break;
}
remove_dir(cwdbuf);
}
}
#ifndef __NR_sched_setattr
#define __NR_sched_setattr 314
#endif
uint64_t r[7] = {0xffffffffffffffff, 0x0, 0xffffffffffffffff,
0xffffffffffffffff, 0x0, 0xffffffffffffffff,
0xffffffffffffffff};
void execute_call(int call)
{
intptr_t res;
switch (call) {
case 0:
syscall(__NR_connect, -1, 0ul, 0ul);
break;
case 1:
syscall(__NR_setsockopt, -1, 0x29ul, 0x3bul, 0ul, 0ul);
break;
case 2:
syscall(__NR_sendmmsg, -1, 0ul, 0ul, 0ul);
break;
case 3:
syscall(__NR_prlimit64, 0, 0xeul, 0ul, 0ul);
break;
case 4:
syscall(__NR_sched_setattr, 0, 0ul, 0ul);
break;
case 5:
syscall(__NR_socket, 0xaul, 2ul, 0ul);
break;
case 6:
res = syscall(__NR_socket, 2ul, 2ul, 0x88ul);
if (res != -1)
r[0] = res;
break;
case 7:
NONFAILING(memcpy((void*)0x20001840,
"vcan0\000\000\000\000\000\000\000\000\000\000\000", 16));
NONFAILING(*(uint32_t*)0x20001850 = 0);
res = syscall(__NR_ioctl, r[0], 0x8933ul, 0x20001840ul);
if (res != -1)
NONFAILING(r[1] = *(uint32_t*)0x20001850);
break;
case 8:
res = syscall(__NR_socket, 0x1dul, 2ul, 7ul);
if (res != -1)
r[2] = res;
break;
case 9:
res = syscall(__NR_socket, 2ul, 2ul, 0x88ul);
if (res != -1)
r[3] = res;
break;
case 10:
NONFAILING(memcpy((void*)0x20001840,
"vcan0\000\000\000\000\000\000\000\000\000\000\000", 16));
NONFAILING(*(uint32_t*)0x20001850 = 0);
res = syscall(__NR_ioctl, r[3], 0x8933ul, 0x20001840ul);
if (res != -1)
NONFAILING(r[4] = *(uint32_t*)0x20001850);
break;
case 11:
NONFAILING(*(uint16_t*)0x20000240 = 0x1d);
NONFAILING(*(uint32_t*)0x20000244 = r[4]);
NONFAILING(*(uint64_t*)0x20000248 = 0);
NONFAILING(*(uint8_t*)0x20000250 = 0);
NONFAILING(*(uint8_t*)0x20000251 = 0);
NONFAILING(*(uint8_t*)0x20000252 = 0);
NONFAILING(*(uint8_t*)0x20000253 = 0);
NONFAILING(*(uint8_t*)0x20000254 = 0);
syscall(__NR_bind, r[2], 0x20000240ul, 0x18ul);
break;
case 12:
NONFAILING(*(uint16_t*)0x20000180 = 0x1d);
NONFAILING(*(uint32_t*)0x20000184 = r[1]);
NONFAILING(*(uint64_t*)0x20000188 = 0);
NONFAILING(*(uint8_t*)0x20000190 = 0);
NONFAILING(*(uint8_t*)0x20000191 = 0);
NONFAILING(*(uint8_t*)0x20000192 = 0);
NONFAILING(*(uint8_t*)0x20000193 = 0);
NONFAILING(*(uint8_t*)0x20000194 = 0);
syscall(__NR_connect, r[2], 0x20000180ul, 0x18ul);
break;
case 13:
res = syscall(__NR_dup, r[2]);
if (res != -1)
r[5] = res;
break;
case 14:
NONFAILING(memcpy((void*)0x200008c0, "./file0\000", 8));
res = syscall(__NR_open, 0x200008c0ul, 0x20141042ul, 0ul);
if (res != -1)
r[6] = res;
break;
case 15:
syscall(__NR_ftruncate, r[6], 0xb0bbul);
break;
case 16:
syscall(__NR_sendfile, r[5], r[6], 0ul, 0x200800100000001ul);
break;
}
}
int main(void)
{
syscall(__NR_mmap, 0x20000000ul, 0x1000000ul, 3ul, 0x32ul, -1, 0);
setup_binfmt_misc();
install_segv_handler();
for (procid = 0; procid < 6; procid++) {
if (fork() == 0) {
use_temporary_dir();
do_sandbox_none();
}
}
sleep(1000000);
return 0;
}
|
the_stack_data/89473.c
|
/*-
* Copyright (c) 1983 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#if defined(LIBC_SCCS) && !defined(lint)
/*static char *sccsid = "from: @(#)malloc.c 5.11 (Berkeley) 2/23/91";*/
static char *rcsid = "$FreeBSD: head/libexec/rtld-elf/malloc.c 154248 2006-01-12 07:28:21Z jasone $";
#endif /* LIBC_SCCS and not lint */
/*
* malloc.c (Caltech) 2/21/82
* Chris Kingsley, kingsley@cit-20.
*
* This is a very fast storage allocator. It allocates blocks of a small
* number of different sizes, and keeps free lists of each size. Blocks that
* don't exactly fit are passed up to the next larger size. In this
* implementation, the available sizes are 2^n-4 (or 2^n-10) bytes long.
* This is designed for use in a virtual memory environment.
*/
#ifndef __FreeBSD__
#define __BSD_VISIBLE 1
#endif
#include <sys/types.h>
#include <err.h>
#include <paths.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/param.h>
#include <sys/mman.h>
#ifndef PAGE_SIZE
#define PAGE_SIZE 4096
#endif
#ifdef __FreeBSD
#define MAP_FLAGS MAP_NOCORE|MAP_ANON
#else
#define MAP_FLAGS MAP_ANON
#endif
static void morecore();
static int findbucket();
/*
* Pre-allocate mmap'ed pages
*/
#define NPOOLPAGES (32*1024/pagesz)
static caddr_t pagepool_start, pagepool_end;
static int morepages();
/*
* The overhead on a block is at least 4 bytes. When free, this space
* contains a pointer to the next free block, and the bottom two bits must
* be zero. When in use, the first byte is set to MAGIC, and the second
* byte is the size index. The remaining bytes are for alignment.
* If range checking is enabled then a second word holds the size of the
* requested block, less 1, rounded up to a multiple of sizeof(RMAGIC).
* The order of elements is critical: ov_magic must overlay the low order
* bits of ov_next, and ov_magic can not be a valid ov_next bit pattern.
*/
union overhead {
union overhead *ov_next; /* when free */
struct {
u_char ovu_magic; /* magic number */
u_char ovu_index; /* bucket # */
#ifdef RCHECK
u_short ovu_rmagic; /* range magic number */
u_int ovu_size; /* actual block size */
#endif
} ovu;
#define ov_magic ovu.ovu_magic
#define ov_index ovu.ovu_index
#define ov_rmagic ovu.ovu_rmagic
#define ov_size ovu.ovu_size
};
#define MAGIC 0xef /* magic # on accounting info */
#define RMAGIC 0x5555 /* magic # on range info */
#ifdef RCHECK
#define RSLOP sizeof (u_short)
#else
#define RSLOP 0
#endif
/*
* nextf[i] is the pointer to the next free block of size 2^(i+3). The
* smallest allocatable block is 8 bytes. The overhead information
* precedes the data area returned to the user.
*/
#define NBUCKETS 30
static union overhead *nextf[NBUCKETS];
static int pagesz; /* page size */
static int pagebucket; /* page size bucket */
#ifdef MSTATS
/*
* nmalloc[i] is the difference between the number of mallocs and frees
* for a given block size.
*/
static u_int nmalloc[NBUCKETS];
#include <stdio.h>
#endif
#if defined(MALLOC_DEBUG) || defined(RCHECK)
#define ASSERT(p) if (!(p)) botch("p")
#include <stdio.h>
static void
botch(s)
char *s;
{
fprintf(stderr, "\r\nassertion botched: %s\r\n", s);
(void) fflush(stderr); /* just in case user buffered it */
abort();
}
#else
#define ASSERT(p)
#endif
/* Debugging stuff */
static void xprintf(const char *, ...);
#define TRACE() xprintf("TRACE %s:%d\n", __FILE__, __LINE__)
void *
malloc(nbytes)
size_t nbytes;
{
register union overhead *op;
register int bucket;
register long n;
register unsigned amt;
/*
* First time malloc is called, setup page size and
* align break pointer so all data will be page aligned.
*/
if (pagesz == 0) {
pagesz = n = PAGE_SIZE;
if (morepages(NPOOLPAGES) == 0)
return NULL;
op = (union overhead *)(pagepool_start);
n = n - sizeof (*op) - ((long)op & (n - 1));
if (n < 0)
n += pagesz;
if (n) {
pagepool_start += n;
}
bucket = 0;
amt = 8;
while ((unsigned)pagesz > amt) {
amt <<= 1;
bucket++;
}
pagebucket = bucket;
}
/*
* Convert amount of memory requested into closest block size
* stored in hash buckets which satisfies request.
* Account for space used per block for accounting.
*/
if (nbytes <= (unsigned long)(n = pagesz - sizeof (*op) - RSLOP)) {
#ifndef RCHECK
amt = 8; /* size of first bucket */
bucket = 0;
#else
amt = 16; /* size of first bucket */
bucket = 1;
#endif
n = -(sizeof (*op) + RSLOP);
} else {
amt = pagesz;
bucket = pagebucket;
}
while (nbytes > amt + n) {
amt <<= 1;
if (amt == 0)
return (NULL);
bucket++;
}
/*
* If nothing in hash bucket right now,
* request more memory from the system.
*/
if ((op = nextf[bucket]) == NULL) {
morecore(bucket);
if ((op = nextf[bucket]) == NULL)
return (NULL);
}
/* remove from linked list */
nextf[bucket] = op->ov_next;
op->ov_magic = MAGIC;
op->ov_index = bucket;
#ifdef MSTATS
nmalloc[bucket]++;
#endif
#ifdef RCHECK
/*
* Record allocated size of block and
* bound space with magic numbers.
*/
op->ov_size = (nbytes + RSLOP - 1) & ~(RSLOP - 1);
op->ov_rmagic = RMAGIC;
*(u_short *)((caddr_t)(op + 1) + op->ov_size) = RMAGIC;
#endif
return ((char *)(op + 1));
}
void *
calloc(size_t num, size_t size)
{
void *ret;
if (size != 0 && (num * size) / size != num) {
/* size_t overflow. */
return (NULL);
}
if ((ret = malloc(num * size)) != NULL)
memset(ret, 0, num * size);
return (ret);
}
/*
* Allocate more memory to the indicated bucket.
*/
static void
morecore(bucket)
int bucket;
{
register union overhead *op;
register int sz; /* size of desired block */
int amt; /* amount to allocate */
int nblks; /* how many blocks we get */
/*
* sbrk_size <= 0 only for big, FLUFFY, requests (about
* 2^30 bytes on a VAX, I think) or for a negative arg.
*/
sz = 1 << (bucket + 3);
#ifdef MALLOC_DEBUG
ASSERT(sz > 0);
#else
if (sz <= 0)
return;
#endif
if (sz < pagesz) {
amt = pagesz;
nblks = amt / sz;
} else {
amt = sz + pagesz;
nblks = 1;
}
if (amt > pagepool_end - pagepool_start)
if (morepages(amt/pagesz + NPOOLPAGES) == 0)
return;
op = (union overhead *)pagepool_start;
pagepool_start += amt;
/*
* Add new memory allocated to that on
* free list for this hash bucket.
*/
nextf[bucket] = op;
while (--nblks > 0) {
op->ov_next = (union overhead *)((caddr_t)op + sz);
op = (union overhead *)((caddr_t)op + sz);
}
}
void
free(cp)
void *cp;
{
register int size;
register union overhead *op;
if (cp == NULL)
return;
op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
#ifdef MALLOC_DEBUG
ASSERT(op->ov_magic == MAGIC); /* make sure it was in use */
#else
if (op->ov_magic != MAGIC)
return; /* sanity */
#endif
#ifdef RCHECK
ASSERT(op->ov_rmagic == RMAGIC);
ASSERT(*(u_short *)((caddr_t)(op + 1) + op->ov_size) == RMAGIC);
#endif
size = op->ov_index;
ASSERT(size < NBUCKETS);
op->ov_next = nextf[size]; /* also clobbers ov_magic */
nextf[size] = op;
#ifdef MSTATS
nmalloc[size]--;
#endif
}
/*
* When a program attempts "storage compaction" as mentioned in the
* old malloc man page, it realloc's an already freed block. Usually
* this is the last block it freed; occasionally it might be farther
* back. We have to search all the free lists for the block in order
* to determine its bucket: 1st we make one pass thru the lists
* checking only the first block in each; if that fails we search
* ``realloc_srchlen'' blocks in each list for a match (the variable
* is extern so the caller can modify it). If that fails we just copy
* however many bytes was given to realloc() and hope it's not huge.
*/
int realloc_srchlen = 4; /* 4 should be plenty, -1 =>'s whole list */
void *
realloc(cp, nbytes)
void *cp;
size_t nbytes;
{
register u_int onb;
register int i;
union overhead *op;
char *res;
int was_alloced = 0;
if (cp == NULL)
return (malloc(nbytes));
op = (union overhead *)((caddr_t)cp - sizeof (union overhead));
if (op->ov_magic == MAGIC) {
was_alloced++;
i = op->ov_index;
} else {
/*
* Already free, doing "compaction".
*
* Search for the old block of memory on the
* free list. First, check the most common
* case (last element free'd), then (this failing)
* the last ``realloc_srchlen'' items free'd.
* If all lookups fail, then assume the size of
* the memory block being realloc'd is the
* largest possible (so that all "nbytes" of new
* memory are copied into). Note that this could cause
* a memory fault if the old area was tiny, and the moon
* is gibbous. However, that is very unlikely.
*/
if ((i = findbucket(op, 1)) < 0 &&
(i = findbucket(op, realloc_srchlen)) < 0)
i = NBUCKETS;
}
onb = 1 << (i + 3);
if (onb < (u_int)pagesz)
onb -= sizeof (*op) + RSLOP;
else
onb += pagesz - sizeof (*op) - RSLOP;
/* avoid the copy if same size block */
if (was_alloced) {
if (i) {
i = 1 << (i + 2);
if (i < pagesz)
i -= sizeof (*op) + RSLOP;
else
i += pagesz - sizeof (*op) - RSLOP;
}
if (nbytes <= onb && nbytes > (size_t)i) {
#ifdef RCHECK
op->ov_size = (nbytes + RSLOP - 1) & ~(RSLOP - 1);
*(u_short *)((caddr_t)(op + 1) + op->ov_size) = RMAGIC;
#endif
return(cp);
} else
free(cp);
}
if ((res = malloc(nbytes)) == NULL)
return (NULL);
if (cp != res) /* common optimization if "compacting" */
bcopy(cp, res, (nbytes < onb) ? nbytes : onb);
return (res);
}
/*
* Search ``srchlen'' elements of each free list for a block whose
* header starts at ``freep''. If srchlen is -1 search the whole list.
* Return bucket number, or -1 if not found.
*/
static int
findbucket(freep, srchlen)
union overhead *freep;
int srchlen;
{
register union overhead *p;
register int i, j;
for (i = 0; i < NBUCKETS; i++) {
j = 0;
for (p = nextf[i]; p && j != srchlen; p = p->ov_next) {
if (p == freep)
return (i);
j++;
}
}
return (-1);
}
#ifdef MSTATS
/*
* mstats - print out statistics about malloc
*
* Prints two lines of numbers, one showing the length of the free list
* for each size category, the second showing the number of mallocs -
* frees for each size category.
*/
mstats(s)
char *s;
{
register int i, j;
register union overhead *p;
int totfree = 0,
totused = 0;
fprintf(stderr, "Memory allocation statistics %s\nfree:\t", s);
for (i = 0; i < NBUCKETS; i++) {
for (j = 0, p = nextf[i]; p; p = p->ov_next, j++)
;
fprintf(stderr, " %d", j);
totfree += j * (1 << (i + 3));
}
fprintf(stderr, "\nused:\t");
for (i = 0; i < NBUCKETS; i++) {
fprintf(stderr, " %d", nmalloc[i]);
totused += nmalloc[i] * (1 << (i + 3));
}
fprintf(stderr, "\n\tTotal in use: %d, total free: %d\n",
totused, totfree);
}
#endif
static int
morepages(n)
int n;
{
int fd = -1;
int offset;
if (pagepool_end - pagepool_start > pagesz) {
caddr_t addr = (caddr_t)
(((long)pagepool_start + pagesz - 1) & ~(pagesz - 1));
if (munmap(addr, pagepool_end - addr) != 0)
warn("morepages: munmap %p", addr);
}
offset = (long)pagepool_start - ((long)pagepool_start & ~(pagesz - 1));
if ((pagepool_start = mmap(0, n * pagesz,
PROT_READ|PROT_WRITE,
MAP_FLAGS|MAP_PRIVATE, fd, 0)) == (caddr_t)-1) {
xprintf("Cannot map anonymous memory");
return 0;
}
pagepool_end = pagepool_start + n * pagesz;
pagepool_start += offset;
return n;
}
/*
* Non-mallocing printf, for use by malloc itself.
*/
static void
xprintf(const char *fmt, ...)
{
char buf[256];
va_list ap;
va_start(ap, fmt);
vsprintf(buf, fmt, ap);
(void)write(STDOUT_FILENO, buf, strlen(buf));
va_end(ap);
}
|
the_stack_data/61074435.c
|
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <pthread.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <errno.h>
#define MAX_CLIENTS 10
void *pool_sockets();
int *sock_pool;
int sock;
pthread_mutex_t mutex1 = PTHREAD_MUTEX_INITIALIZER;
int main(int argc, char **argv)
{
pthread_t pool_thread;
int status, pool_retval;
struct addrinfo hints;
struct addrinfo *servinfo;
memset(&hints, 0, sizeof(hints));
hints.ai_family = AF_UNSPEC;
hints.ai_socktype = SOCK_STREAM;
hints.ai_flags = AI_PASSIVE;
//NULL makes it localhost
if((status = getaddrinfo(NULL, "1337", &hints, &servinfo)) != 0)
{
fprintf(stderr, "getaddrinfo error: %s\n", gai_strerror(status));
exit(1);
}
//Make the socket
if((sock = socket(servinfo->ai_family, servinfo->ai_socktype, servinfo->ai_protocol)) == -1)
{
fprintf(stderr, "socket error: %d\n", errno);
exit(1);
}
//Bind the socket
if (bind(sock, servinfo->ai_addr, servinfo->ai_addrlen)==-1)
{
fprintf(stderr, "bind error: %d\n", errno);
exit(1);
}
//Listen for clients
if(listen(sock, MAX_CLIENTS) == -1)
{
fprintf(stderr, "listen error: %d\n", errno);
exit(1);
}
//Ready to accept connections
pool_retval = pthread_create(&pool_thread, NULL, pool_sockets, NULL);
pthread_join(pool_thread, NULL);
//Cleanup
pthread_mutex_destroy(&mutex1);
free(sock_pool);
freeaddrinfo(servinfo);
}
void *pool_sockets()
{
pthread_mutex_lock(&mutex1);
printf("Thread: %u started", (unsigned int)pthread_self());
struct sockaddr_storage their_addr;
socklen_t addr_size = sizeof(their_addr);
int num_clients = 1;
if((sock_pool = (int*) malloc(sizeof(int)))==NULL)
{
fprintf(stderr, "malloc error\n");
exit(1);
}
printf("Thread: %u starting to accept clients", (unsigned int) pthread_self());
while(num_clients < 10)
{
sock_pool[num_clients-1] = accept(sock, (struct sockaddr *)&their_addr, &addr_size);
printf("Yay, client!");
if((sock_pool = (int*) realloc(sock_pool, sizeof(int)*num_clients)) == NULL)
{
fprintf(stderr,"realloc error\n");
exit(1);
}
}
printf("We haz contact to TENZ clients!\n");
pthread_mutex_unlock(&mutex1);
}
|
the_stack_data/237643737.c
|
#include <stdio.h>
void convert(int x,int store[]) {
int idx=7;
while(x!=1) {
store[idx--]=x%2;
x=x/2;
}
}
int s1[8],s2[8];
int main() {
char a=150,b=234;
int i;
convert(a,s1);
convert(b,s2);
for(i=0;i<8;i++) printf("%d",s1[i]);
printf("\n");
for(i=0;i<8;i++) printf("%d",s2[i]);
printf("\n");
for(i=0;i<8;i++) {
if(s1[i]==s2[i]) printf("match at bit %d\n",7-i);
}
}
|
the_stack_data/526220.c
|
int main() {
return 2;
}
|
the_stack_data/175143730.c
|
#include <stdio.h>
int numBits(int n) {
int b,c;
for (b=1, c = 0; b < n; b<<=1, c++);
return c;
}
int main(void)
{
int x;
scanf("%d", &x);
printf("It takes %d bits to represent %d\n", numBits(x), x);
}
|
the_stack_data/9638.c
|
/**
* Exercise 1-6
*
* Verify that the expression getchar() != EOF is 0 or 1.
*/
/**
* Run following commands to verify.
*
* 1. gcc 1-6.c -o verify_eof
* 2. echo 'hi' | ./verify_eof
*
* Output will be "1110".
*/
#include <stdio.h>
int main() {
int c;
while ((c = getchar()) != EOF) {
printf("%d", c != EOF);
}
printf("%d", c != EOF); // now c is EOF
}
|
the_stack_data/76079.c
|
/* memset.c -- set an area of memory to a given value
Copyright (C) 1991 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
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.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
char *
memset (str, c, len)
char *str;
int c;
unsigned len;
{
register char *st = str;
while (len-- > 0)
*st++ = c;
return str;
}
|
the_stack_data/220457096.c
|
#include <stdio.h>
#define PRICE_ARTI 2.05
#define PRICE_BEET 1.15
#define PRICE_CARROT 1.09
#define DISCOUNT 0.05
void show_menu(void);
float get_weight(void);
int main(void)
{
float w_arti = 0;
float w_beet = 0;
float w_carrot = 0;
char selected;
float weight, amount, rebate, freight, total;
do
{
show_menu();
scanf("%c", &selected);
switch (selected)
{
case 'a':
w_arti += get_weight();
break;
case 'b':
w_beet += get_weight();
break;
case 'c':
w_carrot += get_weight();
break;
case 'q':
break;
default:
printf("Erroe input, retry!\n");
break;
}
} while (selected != 'q');
amount = w_arti * PRICE_ARTI + w_beet * PRICE_BEET + w_carrot * PRICE_CARROT;
weight = w_arti + w_beet + w_carrot;
if (amount >= 100)
{
rebate = amount * DISCOUNT;
}
else
{
rebate = 0;
}
if (weight <= 5)
{
freight = 6.5;
}
else if (weight > 5 && weight <= 20)
{
freight = 14;
}
else
{
freight = 14 + (weight - 20) * 0.5;
}
total = amount + freight - rebate;
printf("The price of vegetable:\nartichoke %g$/pound, beet %g$/pound, carrot %g$/pound.\n",
PRICE_ARTI, PRICE_BEET, PRICE_CARROT);
printf("You order %g pound artichoke, %g pound beet, %g pound carrot.\n",
w_arti, w_beet, w_carrot);
printf("You total order %g pounds, discunt %g$, amount %g$, freight %g$, total %g$.\n",
weight, rebate, amount, freight, total);
printf("Done\n");
return 0;
}
void show_menu(void)
{
printf("********************************************************************\n");
printf("Enter the char corresponding to the desired vegetable.\n");
printf("a) artichoke b)beet\n");
printf("c) carrot q)checkout\n");
printf("********************************************************************\n");
printf("Please input the vegetable you want to buy(a,b,c or q for quit): ");
}
float get_weight(void)
{
float weight;
char q;
printf("Please input hpw many pounds you buy:");
scanf("%f", &weight);
printf("Ok, add %g pound to cart. \n", weight);
while (getchar() != '\n')
{
}
return weight;
}
|
the_stack_data/212642850.c
|
/* Generated by startup_generator */
extern void _estack(void); // to force type checking
void Reset_Handler(void);
void default_handler (void)
{
while(1);
}
void __attribute__ ((weak)) __libc_init_array (void){}
// Linker supplied pointers
extern unsigned long _sidata;
extern unsigned long _sdata;
extern unsigned long _edata;
extern unsigned long _sbss;
extern unsigned long _ebss;
extern int main(void);
extern void SystemInit(void);
void Reset_Handler(void) {
unsigned long *src, *dst;
src = &_sidata;
dst = &_sdata;
// Copy data initializers
while (dst < &_edata)
*(dst++) = *(src++);
// Zero bss
dst = &_sbss;
while (dst < &_ebss)
*(dst++) = 0;
SystemInit();
__libc_init_array();
main();
while(1) {}
}
/* Vector Table */
void NMI_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void HardFault_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void MemMange_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void BusFault_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void UsageFault_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void SVC_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void DebugMon_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void PendSV_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void SysTick_Handler (void) __attribute__ ((weak, alias ("default_handler")));
void WWDG_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void PVD_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TAMPER_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void RTC_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void FLASH_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void RCC_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI0_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI4_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel4_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel5_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel6_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA1_Channel7_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void ADC1_2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USB_HP_CAN1_TX_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USB_LP_CAN1_RX0_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void CAN1_RX1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void CAN1_SCE_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI9_5_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM1_BRK_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM1_UP_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM1_TRG_COM_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM1_CC_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM4_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void I2C1_EV_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void I2C1_ER_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void I2C2_EV_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void I2C2_ER_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void SPI1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void SPI2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USART1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USART2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USART3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void EXTI15_10_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void RTCAlarm_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void USBWakeUp_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM8_BRK_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM8_UP_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM8_TRG_COM_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM8_CC_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void ADC3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void FSMC_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void SDIO_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM5_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void SPI3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void UART4_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void UART5_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM6_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void TIM7_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA2_Channel1_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA2_Channel2_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA2_Channel3_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
void DMA2_Channel4_5_IRQHandler (void) __attribute__ ((weak, alias ("default_handler")));
__attribute__ ((section(".isr_vector")))
void (* const g_pfnVectors[])(void) = {
_estack,
Reset_Handler,
NMI_Handler,
HardFault_Handler,
MemMange_Handler,
BusFault_Handler,
UsageFault_Handler,
0, 0, 0, 0,
SVC_Handler,
DebugMon_Handler,
0,
PendSV_Handler,
SysTick_Handler,
WWDG_IRQHandler,
PVD_IRQHandler,
TAMPER_IRQHandler,
RTC_IRQHandler,
FLASH_IRQHandler,
RCC_IRQHandler,
EXTI0_IRQHandler,
EXTI1_IRQHandler,
EXTI2_IRQHandler,
EXTI3_IRQHandler,
EXTI4_IRQHandler,
DMA1_Channel1_IRQHandler,
DMA1_Channel2_IRQHandler,
DMA1_Channel3_IRQHandler,
DMA1_Channel4_IRQHandler,
DMA1_Channel5_IRQHandler,
DMA1_Channel6_IRQHandler,
DMA1_Channel7_IRQHandler,
ADC1_2_IRQHandler,
USB_HP_CAN1_TX_IRQHandler,
USB_LP_CAN1_RX0_IRQHandler,
CAN1_RX1_IRQHandler,
CAN1_SCE_IRQHandler,
EXTI9_5_IRQHandler,
TIM1_BRK_IRQHandler,
TIM1_UP_IRQHandler,
TIM1_TRG_COM_IRQHandler,
TIM1_CC_IRQHandler,
TIM2_IRQHandler,
TIM3_IRQHandler,
TIM4_IRQHandler,
I2C1_EV_IRQHandler,
I2C1_ER_IRQHandler,
I2C2_EV_IRQHandler,
I2C2_ER_IRQHandler,
SPI1_IRQHandler,
SPI2_IRQHandler,
USART1_IRQHandler,
USART2_IRQHandler,
USART3_IRQHandler,
EXTI15_10_IRQHandler,
RTCAlarm_IRQHandler,
USBWakeUp_IRQHandler,
TIM8_BRK_IRQHandler,
TIM8_UP_IRQHandler,
TIM8_TRG_COM_IRQHandler,
TIM8_CC_IRQHandler,
ADC3_IRQHandler,
FSMC_IRQHandler,
SDIO_IRQHandler,
TIM5_IRQHandler,
SPI3_IRQHandler,
UART4_IRQHandler,
UART5_IRQHandler,
TIM6_IRQHandler,
TIM7_IRQHandler,
DMA2_Channel1_IRQHandler,
DMA2_Channel2_IRQHandler,
DMA2_Channel3_IRQHandler,
DMA2_Channel4_5_IRQHandler,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0,
(void *)0xF1E0F85F
};
|
the_stack_data/279963.c
|
#include <stdio.h>
#include <stdlib.h>
struct object {
int *nums;
int len;
};
void print_nums(int *nums, int size)
{
int i;
if (size < 1) {
printf("[]");
}
printf("[%d", nums[0]);
for (i = 1; i < size; i++) {
printf(", %d", nums[i]);
}
putchar(']');
}
inline void swap(int *lhs, int *rhs)
{
int tmp = *lhs;
*lhs = *rhs;
*rhs = tmp;
}
int first_missing_positive(int *nums, int nums_size)
{
if (nums_size < 1) {
return 1;
}
int i = 0;
while (i < nums_size) {
if (nums[i] != i + 1 && nums[i] > 0 && nums[i] <= nums_size && nums[i] != nums[nums[i] - 1]) {
swap(nums + i, nums + nums[i] - 1);
} else {
i++;
}
}
for (i = 0; i < nums_size; i++) {
if (nums[i] != i + 1) break;
}
return i + 1;
}
int main(int argc, char **argv)
{
int nums1[] = {1, 2, 0}, len1 = sizeof(nums1) / sizeof(int);
int nums2[] = {3, 4, -1, 1}, len2 = sizeof(nums2) / sizeof(int);
int nums3[] = {7, 8, 9, 11, 12}, len3 = sizeof(nums3) / sizeof(int);
struct object inputs[] = {
{.nums = nums1, .len = len1},
{.nums = nums2, .len = len2},
{.nums = nums3, .len = len3},
};
int i, len = sizeof(inputs) / sizeof(struct object);
for (i = 0; i < len; i++) {
int *nums = inputs[i].nums;
int size = inputs[i].len;
printf("\n Input: "); print_nums(nums, size); putchar('\n');
int miss = first_missing_positive(nums, size);
printf(" Output: %d\n", miss);
}
return EXIT_SUCCESS;
}
|
the_stack_data/150142857.c
|
/*
* File: main.c
* Author: BMB
*
* Created on 24 Eylül 2020
*/
#include <stdio.h>
#include <stdlib.h>
/*
*
*/
void dot_carpim(int *A, int *B, int *C, int eleman_sayisi) {
int i;
for (i = 0; i < eleman_sayisi; i++)
*(C + i) = *(A + i) * *(B + i);
}
void tek_boyutlu_dizi_yaz(int *A, int eleman_sayisi) {
int i;
for (i = 0; i < eleman_sayisi; i++)
printf("%4d", A[i]);
printf("\n");
}
void matris_carpimi(int A[][3], int A_satir, int A_sutun,
int B[][2], int B_satir, int B_sutun,
int C[][2], int C_satir, int C_sutun) {
int i, j, k;
if (A_sutun != B_satir) {
printf("Carpim matrislerinin boyutlari uyusmuyor!!!");
return;
} else if (A_satir != C_satir || B_sutun != C_sutun) {
printf("Sonuc matrisinin boyutlari carpan matrislere uymuyor!!!\n");
return;
} else {
for (i = 0; i < A_satir; i++)
for (j = 0; j < B_sutun; j++) {
C[i][j] = 0;
for (k = 0; k < A_sutun; k++)
C[i][j] = C[i][j] + A[i][k] * B[k][j];
}
}
}
void matris_carpimi1(int A[][3], int A_satir, int A_sutun,
int B[][2], int B_satir, int B_sutun,
int C[][2], int C_satir, int C_sutun) {
int i, j, k;
if (A_sutun != B_satir) {
printf("Carpim matrislerinin boyutlari uyusmuyor!!!");
return;
} else if (A_satir != C_satir || B_sutun != C_sutun) {
printf("Sonuc matrisinin boyutlari carpan matrislere uymuyor!!!\n");
return;
} else {
for (i = 0; i < A_satir; i++)
for (j = 0; j < B_sutun; j++) {
*(*(C + i) + j);
for (k = 0; k < A_sutun; k++)
(*(C + i))[j] = *(*(C + i) + j) + A[i][k] * B[k][j];
}
}
}
void matris_yazA(int matris[][3], int satir) {
int i, j;
for (i = 0; i < satir; i++) {
for (j = 0; j < 3; j++) printf("%3d ", matris[i][j]);
printf("\n");
}
}
void matris_yazB(int matris[][2], int satir) {
int i, j;
for (i = 0; i < satir; i++) {
for (j = 0; j < 2; j++) printf("%3d ", matris[i][j]);
printf("\n");
}
}
void matris_yaz_genel(int *dizi, int satir_sayisi, int sutun_sayisi) {
int i, j;
for (i = 0; i < satir_sayisi; i++) {
for (j = 0; j < sutun_sayisi; j++) {
printf("%3d", *(dizi + (i * sutun_sayisi + j)));
}
printf("\n");
}
printf("\n");
}
int main(int argc, char **argv) {
int m, n;
m = 10;
n = 100;
int *mptr, *nptr;
mptr = &m;
nptr = &n;
*mptr = 919;
*nptr = 893;
int x[] = {3, 4, 0, 6, 1};
int y[] = {2, -1, 4, -2, 3};
int z[5];
int A[][3] = {{1, 0, 2},
{2, 1, 4},
{5, 1, 0},
{0, 2, 3}};
int B[][2] = {{0, 1},
{2, 4},
{3, 1}};
int C[4][2];
printf("----- Dizi x ----\n");
tek_boyutlu_dizi_yaz(x, 5);
printf("\n");
printf("----- Dizi y ----\n");
tek_boyutlu_dizi_yaz(y, 5);
printf("\n");
dot_carpim(x, y, z, 5);
printf("----- Dizi z ----\n");
tek_boyutlu_dizi_yaz(z, 5);
printf("\n");
printf("----Matris A ---\n");
matris_yazA(A, 4);
printf("----Matris B ---\n");
matris_yazB(B, 3);
matris_carpimi(A, 4, 3, B, 3, 2,
C, 4, 2);
printf("----Matris C ---\n");
matris_yazB(C, 4);
printf("----Matris A (genel) ---\n");
matris_yaz_genel(&A[0][0], 4, 3);
// ilk satırı yazmaz
matris_yaz_genel(&A[1][0], 3, 3);
// ilk 2 satır yaz
matris_yaz_genel(&A[0][0], 2, 3);
printf("----Matris B (genel) ---\n");
matris_yaz_genel(&B[0][0], 3, 2);
printf("----Matris C (genel) ---\n");
matris_yaz_genel(&C[0][0], 4, 2);
return (EXIT_SUCCESS);
}
|
the_stack_data/7948980.c
|
/*
* Copyright (c) 2009-2013 Alper Akcan <[email protected]>
*
* This program is free software. It comes without any warranty, to
* the extent permitted by applicable law. You can redistribute it
* and/or modify it under the terms of the Do What The Fuck You Want
* To Public License, Version 2, as published by Sam Hocevar. See
* http://www.wtfpl.net/ for more details.
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <pthread.h>
#define size(a) ((int) (sizeof(a) / sizeof(a[0])))
int main (int argc, char *argv[])
{
int i;
int rc;
pthread_mutex_t m[5];
(void) argc;
(void) argv;
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_init(&m[i], NULL);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_init failed\n");
exit(-1);
}
}
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_lock(&m[i]);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_lock failed\n");
exit(-1);
}
}
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_unlock(&m[i]);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_unlock failed\n");
exit(-1);
}
}
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_lock(&m[i]);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_lock failed\n");
exit(-1);
}
}
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_unlock(&m[i]);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_unlock failed\n");
exit(-1);
}
}
for (i = 0; i < size(m); i++) {
rc = pthread_mutex_destroy(&m[i]);
if (rc != 0) {
fprintf(stderr, "pthread_mutex_destroy failed\n");
exit(-1);
}
}
return 0;
}
|
the_stack_data/170453352.c
|
/**
* @file
* @author Sven Fleischer
* @version 2.0
*
* @section DESCRIPTION
*
* This program parses a graph and builds a steiner tree with every prime indexed node as terminal. In this programm are components, which gives the oppurtunity to give out every edge of the tree. And every, through the heuristic computed tree is compared, which means, that we let the heuristic work starting with a different start terminal in the beginning.
*/
#define _GNU_SOURCE
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<assert.h>
#include<ctype.h>
#include <fenv.h>
#include <time.h>
#include <sys/time.h>
#define MAX_LINE_LEN 512
size_t graphSize;
size_t* vertexNo;
size_t*** graph;
//size_t temp2;
size_t vertexInd;
size_t lastFirst;
double* value;
/**
* Builds and fits the graph
*
* @param The input file
*/
void buildGraph(FILE *fp){
size_t i = 0;
char delimiter[] = " ";
char *ptr;
char *bla;
size_t len = 0;
char *line = (char*) malloc(MAX_LINE_LEN * sizeof(char));
getline(&line, &len, fp);
graphSize = strtol(line, &bla, 10);
int temp1 = 0;
int temp2 = 0;
long int temp3 = 0;
vertexNo =(size_t*) malloc(graphSize*sizeof(size_t));
graph = (size_t***) malloc(graphSize*sizeof(size_t**));
for (i = 0; i < graphSize; ++i){
graph[i] = (size_t**) malloc(2*sizeof(size_t**));
vertexNo[i] = 0;
}
printf("Graph built\n");
while ((getline(&line, &len, fp)) != -1) {
if (*(line) != '\n'){
ptr = strtok(line, delimiter);
temp1 = strtol(ptr, &bla, 10);
ptr = strtok(NULL, delimiter);
temp2 = strtol(ptr, &bla, 10);
ptr = strtok(NULL, delimiter);
temp3 = strtol(ptr, &bla, 10);
assert(temp1 >=0);
assert(temp2 >=0);
assert(temp3 >=0);
graph[temp1-1] = (size_t**) realloc(graph[temp1-1], (vertexNo[temp1-1]+1) * sizeof(size_t**));
assert(graph[temp1-1]);
graph[temp1-1][vertexNo[temp1-1]] = (size_t*) malloc(2*sizeof(size_t));
graph[temp1-1][vertexNo[temp1-1]][0] = temp2;
graph[temp1-1][vertexNo[temp1-1]][1] = temp3;
++vertexNo[temp1-1];
graph[temp2-1] = (size_t**) realloc(graph[temp2-1], (vertexNo[temp2-1]+1) * sizeof(size_t**));
assert(graph[temp2-1]);
graph[temp2-1][vertexNo[temp2-1]] = (size_t*) malloc(2*sizeof(size_t));
graph[temp2-1][vertexNo[temp2-1]][0] = temp1;
graph[temp2-1][vertexNo[temp2-1]][1] = temp3;
++vertexNo[temp2-1];
}
}
printf("Graph fitted\n");
}
/**
*Findes every prime indexed node
*@return An array which workes as an boolen, and says that node x is a prime indexed node.
*/
char* findPrimes(){
char* numbers = malloc(sizeof(char)*(graphSize+1));
numbers[0] = 0;
numbers[1] = 0;
for (size_t i = 2; i <= graphSize; ++i){
numbers[i] = 1;
}
double pows = pow((double) graphSize, 0.5);
for (size_t i = 2; (double) i < pows; ++i){
if(numbers[i]){
size_t num = 0;
size_t j = 0;
while((j = i*i+num*i) <= graphSize){
numbers[j] = 0;
++num;
}
}
}
return numbers;
}
/**
* Makes shure everything is still a heap.
*
*@param The heap array and the array with the values, on which the heap based should be build.
*@return The heap array, where the first line is are index in heap order and in the second one we can read out where to find which node in the heap.
*
*/
size_t** minHeapify(size_t i, size_t** index66, double* heapVal){
size_t left;
size_t right;
size_t smallest;
if(i != 0){
left = 2*i;
right = 2*i + 1;
smallest = i;
}
else{
left = 1;
right = 2;
smallest = 0;
}
if (left < graphSize && heapVal[index66[left][0]] < heapVal[index66[smallest][0]]){
smallest = left;
}
if (right < graphSize && heapVal[index66[right][0]] < heapVal[index66[smallest][0]]){
smallest = right;
}
if (smallest != i){
size_t temp6 = index66[i][0];
index66[i][0] = index66[smallest][0];
index66[smallest][0] = temp6;
index66[index66[i][0]][1] = i;
index66[index66[smallest][0]][1] = smallest;
index66 = minHeapify(smallest, index66, heapVal);
}
return index66;
}
/**
* Check if still heap for updated element.
*@param The heap array and the array with the values, on which the heap based should be build.
*@return The heap array, where the first line is are index in heap order and in the second one we can read out where to find which node in the heap.
*/
size_t** update(size_t i, size_t** index66, double* heapVal){
size_t child;
size_t father;
if(i ==0){
return index66;
}
else{
child = i;
father = i/2;
}
if(heapVal[index66[child][0]] < heapVal[index66[father][0]]){
size_t temp6 = index66[father][0];
if (father == lastFirst){
lastFirst == child;
}
index66[father][0] = index66[child][0];
index66[child][0] = temp6;
index66[index66[child][0]][1] = child;
index66[index66[father][0]][1] = father;
index66 = update(father, index66, heapVal);
}
return index66;
}
/**
* Builds the heap.
*@param The heap array and the array with the values, on which the heap based should be build.
*@return The heap array, where the first line is are index in heap order and in the second one we can read out where to find which node in the heap.
*/
size_t** buildMinHeap(size_t** index66, double* heapVal){
for(size_t i = graphSize/2; i>0; --i){
index66 = minHeapify(i, index66, heapVal);
}
index66 = minHeapify(0, index66, heapVal);
return index66;
}
/**
* Computes the shortest paths from nodes already in the steiner tree to every other else
* @param nodes already in steinertree
* @return shortest paths distance at [0] and [1] the previus node
*
*/
double** dijkstra(char* inTree, double** dist, double* heapVal, size_t** index66){
char* visited =(char*) malloc(sizeof(char)*graphSize);
size_t minVal;
for (size_t i = 0; i < graphSize; ++i){
index66[i] = malloc(sizeof(size_t)*2);
visited[i] = 0;
index66[i][0] = i;
index66[i][1] = i;
if(inTree[i] == 0){
dist[i][0] = INFINITY;
heapVal[i] = INFINITY;
dist[i][1] = -2;
}
else{
heapVal[i] = 0;
dist[i][0] = 0;
dist[i][1] = -1;
}
}
index66 = buildMinHeap(index66, heapVal);
for(size_t j = 0; j < graphSize; ++j)
{
minVal = index66[0][0];
if (minVal == INFINITY){
free(visited);
return dist;
}
lastFirst = 0;
visited[minVal] = 1;
for (size_t n= 0; n < vertexNo[minVal]; n++){
if(!visited[graph[minVal][n][0]-1] && dist[minVal][0] != INFINITY){
if(dist[minVal][0] + (double)graph[minVal][n][1] < dist[graph[minVal][n][0]-1][0]){
dist[graph[minVal][n][0]-1][0] = dist[minVal][0] + (double)graph[minVal][n][1];
dist[graph[minVal][n][0]-1][1] = minVal;
heapVal[graph[minVal][n][0]-1] = dist[graph[minVal][n][0]-1][0];
//update heap
index66 = update(index66[graph[minVal][n][0]-1][1], index66, heapVal);
assert(!fetestexcept(FE_INVALID | FE_OVERFLOW | FE_UNDERFLOW));
}
}
}
heapVal[index66[lastFirst][0]] = INFINITY;
index66 = minHeapify(lastFirst, index66, heapVal);
}
free(visited);
return dist;
}
/**
* Checks if there if there are unconected terminals.
*
* @param Used terminal marker and the number of terminals
* @return 1 of yes or 0 as not
*/
char terminalsLeft(char* marker, size_t numberOfTerminal){
for(size_t j= 0; j < numberOfTerminal; ++j){
if(!marker[j]){
return 1;
}
}
return 0;
}
/**
* Finds a steiner tree.
*
* @param All the terminal edges
* @return The objective value
*/
double** steinerTree(size_t* terminal, size_t numberOfTerminal, size_t startTerminal){
char* marker = malloc(numberOfTerminal*sizeof(char));
char* inTree = malloc(graphSize*sizeof(char));
double* heapVal = (double*) malloc(sizeof(double)*graphSize);
size_t** index66 = (size_t**) malloc(sizeof(size_t*)*graphSize);
size_t nodesInTree = 1;
size_t noOfEdges = 1;
double min = INFINITY;
value[startTerminal] = 0;
double** tree = malloc(sizeof(double*)*1);
size_t temp = 0;
double** vector = malloc(sizeof(double*)*graphSize);
for(size_t i = 0; i < graphSize; ++i){
vector[i] = malloc(sizeof(double)*2);
inTree[i] = 0;
}
for(size_t i = 0; i<numberOfTerminal; ++i){
marker[i] = 0;
}
inTree[terminal[startTerminal]] = 1;
vector = dijkstra(inTree, vector, heapVal, index66);
marker[startTerminal] = 1;
//search for cheapest next terminal
for(size_t i = 1; i < numberOfTerminal; ++i){
if(vector[terminal[i]][0] < min && vector[terminal[i]][1] != -1){
min = vector[terminal[i]][0];
temp = i;
}
}
marker[temp] = 1;
value[startTerminal] = min;
size_t iter = terminal[temp];
tree[0] = malloc(sizeof(double));
while(vector[iter][1] != -1){
inTree[iter] = 1;
tree = realloc(tree, sizeof(double)* noOfEdges);
tree[noOfEdges-1] = malloc(sizeof(double)* 2);
tree[noOfEdges-1][0] = (double) iter;
iter = (size_t) vector[iter][1];
tree[noOfEdges-1][1] = (double) iter;
++noOfEdges;
++nodesInTree;
}
//repeat the hole procedure
while (terminalsLeft(marker, numberOfTerminal)){
vector = dijkstra(inTree, vector, heapVal, index66);
min = INFINITY;
temp = 0;
for(size_t i = 0; i < numberOfTerminal; ++i){
if(!marker[i]){
if(vector[terminal[i]][0] < min && vector[terminal[i]][1] != -1){//printf("i: %ld\n",i);
min = vector[terminal[i]][0];
temp = i;
}
}
}
marker[temp] = 1;
iter = terminal[temp];
while(vector[iter][1] != -1){
inTree[iter] = 1;
for(size_t h = 0; h < numberOfTerminal; ++h){
if(iter == terminal[h]){
marker[h] = 1;
}
}
tree = realloc(tree, sizeof(double)* noOfEdges);
tree[noOfEdges-1] = malloc(sizeof(double)* 2);
tree[noOfEdges-1][0] = (double) iter;
iter = (size_t) vector[iter][1];
tree[noOfEdges-1][1] = (double) iter;
//printf("sko\n");
++noOfEdges;
++nodesInTree;
}
value[startTerminal] = value[startTerminal] + min;
}
for(size_t i = 0; i < graphSize; ++i){
free(vector[i]);
free(index66[i]);
}
free(inTree);
free(marker);
free(heapVal);
free(index66);
free(vector);
return tree;
}
/**
* Main method. Findes the most expensive shortest path from vertex 1 to any other vertex in the graph.
*
* @param The input file
* @return The most expensive shortest path. It's given out on the shell
*/
int main(int argc, char *argv[]){
clock_t cpu;
double wall;
struct timeval time;
assert(!gettimeofday(&time,NULL));
wall=(double)time.tv_sec + (double)time.tv_usec * .000001;
cpu = clock();
FILE *fp;
if (argc<=1){
exit(EXIT_FAILURE);
}
fp = fopen(argv[1], "r");
if (fp == NULL) exit(EXIT_FAILURE);
size_t* terminal = malloc(sizeof(size_t)*(1));
size_t noOfTerminal = 0;
terminal[0] = 1;
buildGraph(fp);
assert(graphSize > 1);
char* primes = findPrimes();
printf("primes found\n");
for(size_t i = 3; i <= graphSize; ++i){
if(primes[i]){
++noOfTerminal;
terminal = realloc(terminal, sizeof(size_t)*(noOfTerminal+1));
terminal[noOfTerminal] = i -1;
}
}
++noOfTerminal;
printf("Terminal vector fitted\n");
value = malloc(sizeof(double)*noOfTerminal);
value[0] = 0;
double*** tree = malloc(sizeof(double**)*noOfTerminal);
for(size_t i = 0; i < noOfTerminal; ++i){
tree[i] = steinerTree(terminal, noOfTerminal, i);
}
double minValue = value[0];
size_t j = 0;
size_t howFar = 100;
if(noOfTerminal < 100){
howFar = noOfTerminal;
}
for(size_t i = 1; i < howFar; ++i){
if(minValue > value[i]){
j = i;
minValue = value[i];
}
}
printf("Objective value: %f\n", minValue);
cpu = clock() - cpu;
assert(!gettimeofday(&time,NULL));
wall=(double)time.tv_sec + (double)time.tv_usec * .000001 -wall;
printf("The programm used the CPU time of: %fs\n",((float)cpu)/CLOCKS_PER_SEC);
printf("The programm used the wall time of: %fs\n", wall);
}
|
the_stack_data/691785.c
|
/* Author: Matteo Gianferrari
* Data: 21/01/2022
* Scrivere un programma che esegua le seguenti operazioni aritmetiche tra interi + - * / %. L'input al programma deve essere fornito da tastiera, specificando
* tre parametri operando1 op operando2. Si stampi un messaggio di errore per evidenziare operazioni (es.divisione per zero) o operatori non validi.
*/
#include <stdio.h>
#define MAX_LEN 20
int main(){
char buf[MAX_LEN];
int op1, op2, op, flag_err = 0;
double ris;
fgets(buf, sizeof(buf), stdin);
op1 = atoi(buf);
do{
fgets(buf, sizeof(buf), stdin);
op = buf[0];
}
while(op != '+' && op != '-' && op != '*' && op != '/' && op != '%');
fgets(buf, sizeof(buf), stdin);
op2 = atoi(buf);
switch(op){
case '+':
ris = op1 + op2;
break;
case '-':
ris = op1 - op2;
break;
case '*':
ris = op1 * op2;
break;
case '/':
if(op2 == 0)
flag_err = 1;
else
ris = op1 / op2;
break;
case '%':
ris = op1 % op2;
break;
}
printf((flag_err) ? "Errore, divisione per 0\n" : "%d %c %d = %g\n", op1, op, op2, ris);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.