nerdypepper

<?xml version="1.0"?>
<coverage lines-covered="1" lines-valid="874" line-rate="0.001869483491337038" branches-covered="0" branches-valid="0" branch-rate="0" complexity="0" version="1.9" timestamp="1629957536">
    <sources>
        <source>/home/np/code/rust/dijo</source>
    </sources>
    <packages>
        <package name="src" line-rate="0.0011441647597254005" branch-rate="0" complexity="0">
            <classes>
                <class name="command" filename="src/command.rs" line-rate="0" branch-rate="0" complexity="0">
                    <methods/>

nerdypepper

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int look_around(char arr[10][10], int , int);

int main() {

    /* Enter your code here. Read input from STDIN. Print output to STDOUT */    

nerdypepper

#include <stdio.h>

int find_even(int) ;

int main() {
    int k;
    scanf("%d", &k);
    printf("%d\n", find_even(k));
}

nerdypepper

#include <stdio.h>
#include <limits.h>

int main() {
    int largest = INT_MIN, second = INT_MIN;
    int scanned;
    while( scanned != -1 ) {
        scanf("%d", &scanned);
        if( scanned == -1 ) break;
        if( scanned > second ) {

nerdypepper

Keybase proof

I hereby claim:

• I am NerdyPepper on github.
• I am nerdypepper (https://keybase.io/nerdypepper) on keybase.
• I have a public key whose fingerprint is 56AB 5370 63D7 6CAC 92CC 91F9 BC96 F4EC 9A46 EE13

To claim this, I am signing this object:

nerdypepper

cl_crosshair_drawoutline "0"
cl_crosshair_dynamic_maxdist_splitratio "0.900000"
cl_crosshair_dynamic_splitalpha_innermod "1"
cl_crosshair_dynamic_splitalpha_outermod "0.3"
cl_crosshair_dynamic_splitdist "0"
cl_crosshair_outlinethickness "0.500000"
cl_crosshair_sniper_show_normal_inaccuracy "0"
cl_crosshair_sniper_width "1"
cl_crosshairalpha "255"
cl_crosshaircolor "5"