-
2052560·text·1.4 KB·2011-05-01 17:13 UTC
NOTE: Running task 1632 of 1706 (ID: 102, /foobar/beagle/beagle-oe/setup-scripts/sources/openembedded/recipes/u-boot/u-boot_git.bb, do_fetch)
NOTE: package u-boot-2010.06+gitr0+bd2313078114c4b44c4a5c
-
2052559·text·120 B·2011-05-01 17:10 UTC
int count (int*a, int n, int x)
{
int i,result=0;
for (i= 0; i< n; i++)
if (a[i] == x)
result++;
return result;
}
-
2052557·text·402 B·2011-05-01 16:58 UTC
em@leibniz:~/pyopencl-0.92$ python
Python 2.6.6 (r266:84292, Sep 15 2010, 16:22:56)
[GCC 4.4.5] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> import pyopenc
-
2052555·text·5.9 KB·2011-05-01 16:56 UTC
Reset chassis ... done.
Testing RAM...
134,217,728 RAM OK.
Initializing...
Attaching to file system ... done.
Loading nos.img ... done.
Starting at 0x10000...
Current time is Sun Jan
-
2052551·text·204 B·2011-05-01 16:43 UTC
/* escreve um array de 'n' inteiros no ecrã */
void escreve_array( int *a, int n )
{
int i;
for( i=0; i<n; i++ )
printf("%d ", a[i] );
printf("\n");
-
2052549·text·265 B·2011-05-01 16:41 UTC
/* calcula o máximo elemento de um array de 'n' inteiros*/
int max_array( int *a, int n )
{
int i, max;
max = a[0];
for( i=1; i<n; i++ )
if( a[i] > ma
-
2052548·text·772 B·2011-05-01 16:40 UTC
void BubbleSort(int a[], int n)
{
int i, j;// needed for the loops
int tmp;// needed for swapping values between two variables
if (n <= 1) return;// check if the array has no
-
2052547·text·162 B·2011-05-01 16:26 UTC
x y z res
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0 --> problematic line - if I use signals instead of vars, I get this result as 1
1 1 1 1
-
2052545·python·471 B·2011-05-01 16:17 UTC
class Poi(GeoPoint):
MAX_GEOCELL_RESOLUTION = 8
poi_type = db.StringProperty()
poi_name = db.StringProperty()
class Spot(GeoPoint):
like_count = db.IntegerProperty()
disl
-
2052544·text·648 B·2011-05-01 16:15 UTC
entity question3 is
Port ( x : in STD_LOGIC;
y : in STD_LOGIC;
z : in STD_LOGIC;
res1 : out STD_LOGIC;
res2 : out STD_LOGIC);
end question3;
-
2052543·text·648 B·2011-05-01 16:14 UTC
entity question3 is
Port ( x : in STD_LOGIC;
y : in STD_LOGIC;
z : in STD_LOGIC;
res1 : out STD_LOGIC;
res2 : out STD_LOGIC);
end question3;
-
2052541·text·12.2 KB·2011-05-01 16:07 UTC
// generated by quake, do not modify
unbindall
bind TAB "+scores"
bind ENTER "+button2"
bind ESCAPE "togglemenu"
bind SPACE "+moveup"
bind + "sizeup"
bind - "sizedown"
bind / "weapnext"
bind
-
2052538·text·6.2 KB·2011-05-01 16:02 UTC
<00:04:17> "Траян (Legion)": http://img265.imageshack.us/img265/85/siegecalend20.jpg
<00:08:21> "xBARIKx [XXL]": <19:29:33> *** Вы сейчас говорите в канал: "gardarika"
<20:20:32> "mali (madness)": а
-
2052529·text·1.1 KB·2011-05-01 15:27 UTC
CTF DRAFT 2K11
Captains:
1. Team Thundercats (sdahaghi) 2. Team cmd (mrgreen)
kgb viju
staind allmental
-
2052528·text·2.3 KB·2011-05-01 15:22 UTC
ffmpeg.exe -i VTS_01_3.VOB -t 80 -vcodec mpeg4 -b 800k -acodec libmp3lame -ab 128k -y zene.avi
---
FFmpeg version SVN-r18709, Copyright (c) 2000-2009 Fabrice Bellard, et al.
configuration: --
-
2052526·text·302 B·2011-05-01 15:08 UTC
Warning: mysql_connect() [function.mysql-connect]: User ecsmedi_healthy already has more than 'max_user_connections' active connections in C:\hshome\ecsmedia\healthylife.com.np\vote\include\db_confi
-
2052525·text·14.1 KB·2011-05-01 14:56 UTC
public OnGameModeInit() {
CreateServerTextDraws();
ConnectServer();
for(new i = 0; i < MAX_VEHICLES; i ++ ) {
strmid(CarData[i][Owner], "None", 0, strlen("None"), 255);
-
2052519·text·184 B·2011-05-01 14:03 UTC
#include <stdio.h>
#include <stdlib.h>
int main()
{
int zmienna;
zmienna=666;
printf("%i",&zmienna);
int zm;
zm = 1;
while (zm <= 99) {
printf("%i",&zm);
zm = zm2 + 1;
}
}
-
2052518·text·3.2 KB·2011-05-01 14:03 UTC
<div id="sidebar">
<ul>
<?php /* Widgetized sidebar, if you have the plugin installed. */
if ( !function_exists('dynamic_sidebar') || !dynamic_sidebar() ) : ?>
<li>
<?php inclu
-
2052516·text·183 B·2011-05-01 14:00 UTC
#include <stdio.h>
#include <stdlib.h>
int main()
{
nt zmienna;
zmienna=666;
printf("%i",&zmienna);
int zm;
zm = 1;
while (zm <= 99) {
printf("%i",&zm);
zm = zm2 + 1;
}
}