prime factorization II
1
Name:
Anonymous
2013-02-04 0:03
I need some help on this problem for my programming course in c, to create a function that given a prime number will count the number of times is occurs in n!. > e.g. 5! = (2^3)*(3^1)*(5^1)
2
Name:
Anonymous
2013-02-04 0:05
Seeings as how half of /prog/ can't code.... ^^
3
Name:
Anonymous 2013-02-04 0:07
The when-cudder-has-free-time Challenge :: code this in asm ? plz ^^
4
Name:
Anonymous 2013-02-04 0:10
[m] [spoiler] $ factor 666666: 2 3 3 37$ dpkg-query -S `which factor`coreutils: /usr/bin/factor$ sudo apt-get source factor[sudo] password for user: Reading package lists... DoneBuilding dependency tree Reading state information... DoneE: This is not ubuntu, faggot. [/m]
5
Name:
Anonymous 2013-02-04 0:11
$ factor 666666: 2 3 3 37$ dpkg-query -S `which factor`coreutils: /usr/bin/factor$ sudo apt-get source factor[sudo] password for user: Reading package lists... DoneBuilding dependency tree Reading state information... DoneE: This is not ubuntu, faggot.
6
Name:
Anonymous 2013-02-04 0:16
make it a double? ^^ ( !!-- ) or x!!-- defined as x! * (x-1)! * ... * (1)! shouldn't really be any harder.. =)
7
Name:
Anonymous 2013-02-04 5:45
It's not that hard.My penis is actually harder than that. Would you mind to suck it?
Newer Posts