-
2092558·python·1.2 KB·2011-10-22 15:46 UTC
def is_divisible(n, L):
isprime = False
if (L ==[]): # if the list is empty then the number must be prime
return False
else:
for i in L:
if (n % i) == 0: # if the number
-
2092556·text·3.3 KB·2011-10-22 15:40 UTC
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <climits>
using namespace std;
struct Balle {
float vitesse;
float position;
};
-
2092554·text·3.3 KB·2011-10-22 15:36 UTC
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <climits>
using namespace std;
struct Balle {
float vitesse;
float position;
};
-
2092550·text·173 B·2011-10-22 15:09 UTC
historico
assinatura
informacao
advogado
avenida
sobrenome
regra
freio
desistir
engolir
lampada
abajur
luminaria
portatil
som
garganta
desmontar
carta
ilha
-
2092549·text·96 B·2011-10-22 15:07 UTC
historico
assinatura
informacao
advogado
avenida
sobrenome
regra
freio
desistir
engolir
-
2092547·text·31 B·2011-10-22 15:01 UTC
Advogado
Concessionaria
Freio
-
2092545·text·483 B·2011-10-22 14:45 UTC
int __stdcall crappyHash(char *a1)
{
char *v1; // edx@1
int v2; // ecx@1
int result; // eax@1
int v4; // eax@6
int v5; // ecx@6
v1 = a1;
LOBYTE(v2) = *a1;
for ( result = 0;
-
2092543·text·1.3 KB·2011-10-22 14:22 UTC
class Baldo extends Process {
public static final int NCS = 0;
public static final int CS = 1;
class REQUEST extends Message {
public final int id;
public REQUEST(int id) {this.id = id;
-
2092541·text·3.2 KB·2011-10-22 14:12 UTC
#include <iostream>
#include <map>
#include <string>
#include <stdint.h>
#include <vector>
#include <set>
#include <cstring>
using namespace std;
-
2092540·text·2.1 KB·2011-10-22 14:12 UTC
#include <iostream>
#include <map>
#include <string>
#include <stdint.h>
#include <vector>
#include <set>
#include <cstring>
using namespace std;
void LoadNotes(uint8_t notes[10000], int&
-
2092539·text·2.1 KB·2011-10-22 14:03 UTC
#include <iostream>
#include <map>
#include <string>
#include <cstdint>
#include <vector>
#include <set>
using namespace std;
void LoadNotes(uint8_t notes[10000], int& PattLen, int& Pat
-
2092538·text·449 B·2011-10-22 13:26 UTC
module Main where
main::IO()
main = undefined
pow1 :: (Num a1, Num a) => a -> a1 -> a
pow1 b e
| (b == 0) = 0
| (e == 0) = 1
| otherwise = b * (pow1 b (e - 1))
pow2 :: (Num a, Fracti
-
2092535·diff·2.3 KB·2011-10-22 13:17 UTC
--- mkvdts2ac3.sh 2011-10-14 19:26:47.000000000 +0200
+++ mkvdts2ac3-ffmpeg.sh 2011-10-22 14:24:43.000000000 +0200
@@ -42,6 +42,7 @@
COMP="none"
WD="/tmp" # Working Directory (Use the -w/--wd ar
-
2092529·text·6.7 KB·2011-10-22 12:38 UTC
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <stdio.h>
using namespace std;
struct Res;
struct Node {
char id;
-
2092520·text·5.6 KB·2011-10-22 11:51 UTC
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <stdio.h>
using namespace std;
struct Res;
struct Node {
char id;
-
2092519·text·454 B·2011-10-22 11:50 UTC
#include <iostream>
#include <vector>
#include <map>
#include <multiset>
using namespace std;
struct Res {
Res() : valeur(1.0) { }
double valeur;
Node *a, *b;
bool operator<(const
-
2092516·text·3.2 KB·2011-10-22 11:31 UTC
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <climits>
using namespace std;
struct Balle {
float vitesse;
float position;
int numero;
bool c
-
2092511·text·596 B·2011-10-22 11:00 UTC
12:56 -NickServ(NickServ@services.)- You are already logged in as hendrik.
12:56 -!- hendrik [~hendrik@stendhalgame.org]
12:56 -!- ircname : Hendrik Brummermann
12:56 -!- channels : #arianne
-
2092507·text·1.6 KB·2011-10-22 10:34 UTC
void reduceRes(multiset<Res*>& res, vector<Res*>& resToReduce)
{
Node* newA = resToReduce[0]->a;
Node* newB = resToReduce[0]->b;
// Do some clean up
res.erase(resToReduce[0]);
double re
-
2092506·text·874 B·2011-10-22 10:32 UTC
Dear Maciek!
It was great to hear from you. I'm writing to thank you so much for your offer to help my friend. my friend Gabi will arrive on 1st November this year. She will arrive at the X airport.