The Eudyptula Challenge

2024-05-06 21:58
文章标签 challenge eudyptula

本文主要是介绍The Eudyptula Challenge,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

What is it?

The Eudyptula Challenge is a series of programming exercises for the Linux kernel, that start from a very basic “Hello world” kernel module, moving on up in complexity(复杂) to getting patches(补丁) accepted into the main Linux kernel source tree.

How do I do it?

Email little at eudyptula-challenge.org and say that you want to join in. You will receive an email with your first exercise and details on how the challenge is run. All communication(通讯) goes through email, just like the Linux kernel is developed.

Please note, all HTML-formatted email will be merrily rejected(愉快地驳回), please fix your email client to not send HTML email if you wish to do this challenge. Linux kernel mailing lists reject HTML email and so do we.

What are the rules?

There aren’t any, with the exception that you really should be doing your own work. This challenge is for you, not anyone else, so don’t ask about how to solve them on mailing lists or IRC(Internet Relay Chat 网络交互式闲聊程序). Posting(发布) answers to the questions online is also frowned apon, as it really doesn’t help anyone out.

Also, we can tell if you are cheating(欺骗), we have our ways…

What skills do I need to take this?

A basic understanding of the C programming language is required. No previous Linux kernel coding experience is needed, but that of course will help.

Where did this idea come from?

The idea for this came to us after a long night of drinking in which it was determined that if the Linux kernel was to survive, it would need new programmers to fix all of the bugs that were recently added after a long night of drinking.

This Challenge is also modeled(模仿) after the wonderful Matasano Crypto Challenge, which, if you haven’t taken it already, you really should do so, it’s smashing(了不起地) fun.

Who is behind this?

A set of convoluted(复杂地) shell scripts that are slow to anger and impossible to debug.

这篇关于The Eudyptula Challenge的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/965492

相关文章

UVa1104/LA5131 Chips Challenge

UVa1104/LA5131 Chips Challenge 题目链接题意分析AC 代码上下界循环费用流版本优化建图版本 题目链接   本题是2011年icpc世界总决赛的D题 题意   在一个N×N(N≤40)网格里放芯片。其中一些格子已经放了芯片(用C表示),有些格子不能放(用/表示),有些空格子可以放或者不放芯片(用.表示)。还要放一些芯片(用W表示),使得第i行的总

USACO Section 1.5 Checker Challenge

题意: N皇后问题  输出  字典序最小的3种解法 和 解的数量 思路: dfs去放皇后判断和前面的皇后是否冲突 题目时间卡的超级很近!!  简单的搜索一定跪  能剪的地方要拼命剪枝!! 列举我的剪枝: 1.直接按字典序搜索  最先搜到的3个解保证字典序最小  直接输出 2.通过上几行皇后的放法  求出现在这行有几个位置能放皇后  之后进行搜索(这是关键!!  千万不要先搜位置

vulnhub靶机hacksudoLPE中Challenge-1

下载地址:https://download.vulnhub.com/hacksudo/hacksudoLPE.zip 主机发现 目标146 端口扫描 服务扫描 漏洞扫描 上面那整出来几个洞,可以试试 easy? 估计就是看源码 看来是的 登入咯 这里进不去就是ssh咯 这个看着有点像提权的操作 一、Challenge-1 1.

codechef August Challenge 2014 第五个题目

题意:点击打开链接 题目链接:点击打开链接 思路:入门的状态压缩,如果按照行一行一行下来(选衣服)去选的话状态太多,无法压缩,考虑到题目中n比较小,所以改用按照列一列一列推,把人压缩到二进制里面,1表示这个人已经选了,0表示还没有选,然后递推就可以达到答案! #include<set>#include<queue>#include<cmath>#include<cstdio

【12月Top 2】MarTech Challenge 点击反欺诈预测

背景 广告欺诈是数字营销需要面临的重要挑战之一,点击会欺诈浪费广告主大量金钱,同时对点击数据会产生误导作用。本次比赛提供了约50万次点击数据。特别注意:我们对数据进行了模拟生成,对某些特征含义进行了隐藏,并进行了脱敏处理。 请预测用户的点击行为是否为正常点击,还是作弊行为。点击欺诈预测适用于各种信息流广告投放,banner广告投放,以及百度网盟平台,帮助商家鉴别点击欺诈,锁定精准真实用户。

ACM-ICPC 2018 南京赛区网络预赛 E AC Challenge(状压DP)

题目链接:https://nanti.jisuanke.com/t/30994   题目大意:有n道题,每道题做出来会得到t*a[i]+b[i]分,但是有些题目有先决条件,需要先完成某些题目才能写,问最多能得到多少分   题目思路:这道题需要用二进制的做法。首先先用二进制表示每道题的先决条件,放入pre数组,第几位是1就是需要先写第几题。然后就把所有的情况全部枚举出来,由于一共就20题,一

mageNet Object Localization Challenge

竞争描述 虽然人们很容易辨别出照片中细微的差别,但电脑仍然有办法。视觉上相似的东西很难让电脑计算,就像这堆重叠的香蕉。 或者想想这张照片,一个狐狸家族伪装在野外-狐狸在哪里结束,草在哪里开始?                                         注释。 由于这种竞争,仅2010年至2014年,图像分类误差就减少了4.2倍(从28.2%降至6.7%),定位误

跟TED演讲学英文:The next grand challenge for AI by Jim Fan

The next grand challenge for AI Link: https://www.ted.com/talks/jim_fan_the_next_grand_challenge_for_ai? Speaker: Jim Fan Date: October 2023 文章目录 The next grand challenge for AIIntroductionVo

The Python Challenge

The Python Challenge 地址:http://www.pythonchallenge.com/ 一共33关 第0关 很明显数字238,但是直接访问提示:No… the 38 is a little bit above the 2… 意思是38在2的上方,就是要2的38次方 运算print(2**38)得到结果 第1关 根据映射关系解密,我直接先去试了凯撒: 将这个

Talent Challenge Program:专属在校大学生的远程实习培养计划来啦!

2020 开年的一场疫情,打得我们措手不及,往年一直幻想着可以有一个不用开学的假期,现在开学也变得遥遥无期,原本准备的暑期实习也因为不能到现场,一个个泡汤。这个暑假,还能做点什么才不虚度光阴? 不如了解一下“远程实习”——面向在校大学生的 Talent Challenge Program。 Talent Challenge Program 是 PingCAP 联合 TiDB 开源社区共同推出的