He Attac
He Attac

He Attac

He Protec
He Protec

He Protec

Attac
Attac

Attac

Anyoning
Anyoning

Anyoning

water cycle
 water cycle

water cycle

students
 students

students

give her
 give her

give her

lines
 lines

lines

kill
 kill

kill

fasting
fasting

fasting

🔥 | Latest

multiply: AceLewis /my_first_calculator.py O Watch Fork Star 11 612 80 目Wiki a Insights Pull requests 2 Security <> Code Issues 25 Projects 0 my_first_calculator.py 0 releases 13 commits 1 branch 4 contributors Clone or download New pull request Branch: master Create new file Upload files Find file AceLewis Merge branch 'master' of https://github.com/Acelewis/my first calcula...... Latest commit a7aabea on May 16, 2016 .gitattributes Added .gitattributes & .gitignore files 4 years ago Added .gitattributes & .gitignore files .gitignore 4 years ago README.md Recommended from future import division 4 years ago generator.py 4 years ago fix num of ifs - my first calculator.py d 0/0 being my first_calculator_0 to 1000.rt dated the archived 0 t 4 y 20823 lines (20818 sloc) 753 KB 41 2050") prin 20802 You're using jump to definition to te code. Opt out E ver 20803 if numl and sign = '" and num2 == #my_first_calculator.py by AceLewis print("50*42 2100") 20804 TODO : Make it work for all floating point numbers too if numl 50 and sign and num2 43: 23 20805 print ("50 43 2150") 20806 if 3/2 1: #Because Python 2 does not know maths 4 20807 if numl 50 and sign and num2 == 44 . input raw_input # Python 2 compatibility print ("50 44 2200") 20808 20809 if numl 50 and sign and num2 45: print("50 45 2250") print('Welcome to this calculator!) 7 20819 print('It can add, subtract, multiply and divide whole numbers from 20811 if numl 50 and sign and num2 46: num1 int(input('Please choose your first number: ) print ("50 46 2300") 20812 sign input('What do you want to do? +, /, or ) 10 if numl 50 and sign and num2 20813 47: num2 int (input('Please choose your second number: )) print("50*47 2350") 11 20815 12 if numl 50 and sign *and num2 48: if numl = 0 and sign = ' + 'and num2 0: print ("50 48 13 2400") 20816 print("0+0 0" ) 14 if numl 50 and sign 20817 *and num2 49: if numl 0 and sign == ' + ' and num2 1: 15 20818 print("50*49= 2450") print ("0+1 = 1 " ) if numl 50 and sign and num2 50: 16 20819 if numl and sign == 17 + and num2 -= 2: 20828 print("50*50 2500") print ("0+2 2") 18 20821 20822 print("Thanks for using this calculator, goodbye :") if numl and sign == '+ " and num2 3: 19 print ("0+3= 3") 20 Was searching for calculator project in github. Saw this. It belongs to here.
multiply: AceLewis /my_first_calculator.py
 O Watch
 Fork
 Star
 11
 612
 80
 目Wiki
 a Insights
 Pull requests 2
 Security
 <> Code
 Issues 25
 Projects 0
 my_first_calculator.py
 0 releases
 13 commits
 1 branch
 4 contributors
 Clone or download
 New pull request
 Branch: master
 Create new file
 Upload files
 Find file
 AceLewis Merge branch 'master' of https://github.com/Acelewis/my first calcula......
 Latest commit a7aabea on May 16, 2016
 .gitattributes
 Added .gitattributes & .gitignore files
 4 years ago
 Added .gitattributes & .gitignore files
 .gitignore
 4 years ago
 README.md
 Recommended from future import division
 4 years ago
 generator.py
 4 years ago
 fix num of ifs
 -
 my first calculator.py
 d 0/0 being
 my first_calculator_0 to 1000.rt
 dated the archived 0 t
 4 y
 20823 lines (20818 sloc)
 753 KB
 41 2050")
 prin
 20802
 You're using jump to definition to
 te code. Opt out E
 ver
 20803
 if numl
 and sign = '"
 and num2 ==
 #my_first_calculator.py by AceLewis
 print("50*42 2100")
 20804
 TODO : Make it work for all floating point numbers too
 if numl
 50 and sign
 and num2 43:
 23
 20805
 print ("50 43
 2150")
 20806
 if 3/2 1:
 #Because Python 2 does not know maths
 4
 20807
 if numl 50 and sign
 and num2 == 44 .
 input raw_input # Python 2 compatibility
 print ("50 44
 2200")
 20808
 20809
 if numl
 50 and sign
 and num2
 45:
 print("50 45 2250")
 print('Welcome to this calculator!)
 7
 20819
 print('It can add, subtract, multiply and divide whole numbers from
 20811
 if numl 50 and sign
 and num2
 46:
 num1 int(input('Please choose your first number: )
 print ("50 46
 2300")
 20812
 sign input('What do you want to do? +, /, or
 )
 10
 if numl
 50 and sign
 and num2
 20813
 47:
 num2 int (input('Please choose your second number: ))
 print("50*47 2350")
 11
 20815
 12
 if numl
 50 and sign
 *and num2 48:
 if numl = 0 and sign = ' + 'and num2 0:
 print ("50 48
 13
 2400")
 20816
 print("0+0 0" )
 14
 if numl 50 and sign
 20817
 *and num2
 49:
 if numl
 0 and sign == ' + ' and num2 1:
 15
 20818
 print("50*49= 2450")
 print ("0+1 = 1 " )
 if numl
 50 and sign
 and num2 50:
 16
 20819
 if numl
 and sign ==
 17
 +
 and num2 -= 2:
 20828
 print("50*50 2500")
 print ("0+2 2")
 18
 20821
 20822 print("Thanks for using this calculator, goodbye :")
 if numl
 and sign == '+ " and num2 3:
 19
 print ("0+3= 3")
 20
Was searching for calculator project in github. Saw this. It belongs to here.

Was searching for calculator project in github. Saw this. It belongs to here.

multiply: Code Written By A CS 101 Student public int fibonacci (int x) { if (x 1) return 1 else if (x 2) ( return 1; ) else fibonacci (x - 2 ) ; return fibonacci (x 1) Code Written At A Hackathon public int getFibonacciNumber (int switch (n) n) case 1: return 1; case 2: return 1A case 3: return 2 case 4 return 3 case 5: return 5 case 6: return B case 7: return 13; default: good enough for the demo, lol return -1 Code Written At A Startup 1TODO add Javadoc comments getFibonacciNumber TODO Should we move this to a different file? public int getFibonacciNumber (int n) /TODO Stack may overflow with recursive implementation, switch over to // iteration approach at some point? if (n0) /TODO This should probably throw an exception. Or maybe just print // a log message? return-1 ) else if (n 0) ( TODO Generalize the initial conditions? return 0 ) else if (n 1) return 1; else /TODO Spend some time with my family and kids, I've been at work for /over 48 hours straight return getFibonacciNumber (n 1) + getFibonnaciNumber (n - 2) Code Written At A Large Company getFibonacciNumber is a method that, given some index n, returns the nth Fibonacci number. eparam n The index of the Fibonacci number you wish to retrieve. return The nth Fibonacci number. public CustomInteger 64 getFibonacciNumber (CustomInteger64 n) FibonacciDataViewBuilder builder FibonacciDataViewBuilderFactory.create FibonacciDataViewBuilder new FibonacciDataViewBuilderParams (n, null, null, if (builder = FibonacciDataViewBuilderConstants.ERROR_STATE) throw new FibonacciDataViewBuilderFactoryException FibonacciDataView dataView builder.GenerateFibonacciDataView (this) if (dataView FibonacciDataViewConstants.ERROR STATE) throw new FibonacciDataViewGenerationException return dataView.accessNext FibonacciNumber (null, null, null) Code Written By A Math Ph.D. public int getFibonacciNumber (int n) return (int) divide (subtract (exponentiate (phi ), subtract (phi , psi ))): n), exponentiate (psi ), n)), public double exponentiate (double a, double b) if (equal (b, zero )) return one () else ( return multiply (a, exponentiate (a, subtract (b, one ())) ) 1 public double phi) return divide (add (one , sqrt (add (one , one (, one , one , one ()))), add (one ( one ())) public double psi () ( return subtract (one (), phi)) Code Written By Your Cat public static final int UNITE - 1; public static final int UNITED= 2 meowwnn meow public int meow (int KITTENS_OF_THE_WORLD) { //MEOW if (KITTENS_OF_THE_WORLD < UNITED) { return KITTENS_OF_THE_WORLD else meeoowwwwwwwnw //meoooowwwwwwwwwwwwwwwwwwwww return meow (KITTENS OF THE WORLD - UNITE) meow (KITTENS OF THE_WORLD UNITED) 6 types of programmers
multiply: Code Written By A CS 101 Student
 public int fibonacci (int x) {
 if (x 1)
 return 1
 else if (x
 2) (
 return 1;
 ) else
 fibonacci (x
 - 2 ) ;
 return fibonacci (x
 1)
 Code Written At A Hackathon
 public int getFibonacciNumber (int
 switch (n)
 n)
 case 1: return 1;
 case 2: return 1A
 case 3: return 2
 case 4 return 3
 case 5: return 5
 case 6: return B
 case 7: return 13;
 default:
 good enough for the demo, lol
 return -1
 Code Written At A Startup
 1TODO add Javadoc comments
 getFibonacciNumber
 TODO Should we move this to a different file?
 public int getFibonacciNumber (int n)
 /TODO Stack may overflow with recursive implementation, switch over to
 // iteration approach at some point?
 if (n0)
 /TODO This should probably throw an exception. Or maybe just print
 // a log message?
 return-1
 ) else if (n 0) (
 TODO Generalize the initial conditions?
 return 0
 ) else if (n 1)
 return 1;
 else
 /TODO Spend some time with my family and kids, I've been at work for
 /over 48 hours straight
 return getFibonacciNumber (n 1) + getFibonnaciNumber (n - 2)
 Code Written At A Large Company
 getFibonacciNumber is a method that, given some index n, returns the nth
 Fibonacci number.
 eparam n The index of the Fibonacci number you wish to retrieve.
 return The nth Fibonacci number.
 public CustomInteger 64 getFibonacciNumber (CustomInteger64 n)
 FibonacciDataViewBuilder builder
 FibonacciDataViewBuilderFactory.create FibonacciDataViewBuilder
 new FibonacciDataViewBuilderParams (n, null, null,
 if (builder = FibonacciDataViewBuilderConstants.ERROR_STATE)
 throw new FibonacciDataViewBuilderFactoryException
 FibonacciDataView dataView builder.GenerateFibonacciDataView (this)
 if (dataView FibonacciDataViewConstants.ERROR STATE)
 throw new FibonacciDataViewGenerationException
 return dataView.accessNext FibonacciNumber (null, null, null)
 Code Written By A Math Ph.D.
 public int getFibonacciNumber (int n)
 return (int) divide (subtract (exponentiate (phi ),
 subtract (phi , psi ))):
 n), exponentiate (psi ), n)),
 public double exponentiate (double a, double b)
 if (equal (b, zero ))
 return one ()
 else (
 return multiply (a, exponentiate (a,
 subtract (b,
 one ())) )
 1
 public double phi)
 return divide (add (one , sqrt (add (one , one (, one , one , one ()))),
 add (one ( one ()))
 public double psi () (
 return subtract (one (), phi))
 Code Written By Your Cat
 public static final int UNITE - 1;
 public static final int UNITED= 2
 meowwnn meow
 public int meow (int KITTENS_OF_THE_WORLD) {
 //MEOW
 if (KITTENS_OF_THE_WORLD < UNITED) {
 return KITTENS_OF_THE_WORLD
 else
 meeoowwwwwwwnw
 //meoooowwwwwwwwwwwwwwwwwwwww
 return meow (KITTENS OF THE WORLD - UNITE)
 meow (KITTENS OF THE_WORLD UNITED)
6 types of programmers

6 types of programmers

multiply: $42% 14:45 Anna Today 12:10 I haven't seen you in forever Have you been visiting your fellow angels up in Heaven? Ps. Always wanted to use this as a text opener Are you my wallet? Because l want to fill you up Ps. I just had nothing to respond with so I saw my empty wallet. Today 13:00o Do you like vegetables, Because i like you from head tomatoesb At least something is empty Are you a salad, because l'd stay away from you until there was some meat in you Let's do some math. Add bed subtract clothes, divide legs, and multiply My tongue hasn't been to the gym in a while, mind sitting on my face and letting my tongue work out? Do you want to do 68? go down on you, and you owe you Are you my TV because i need to beat you to make you work Is that a mirror in your pocket? Cause l can see myself in your pants! Let's recreate our parents lives I act like I love you, I get you pregnant and then go move to the middle East under a different identity Oh that would be lovely. When and where? They say your tongue is the strongest muscle in your body Want to fight? I'd like to request a handicap, my tongue isn't strong enough to fight your tongue, How about I fight your clit? Today 14:02 Did your license get suspended for driving all these tinder girls crazy? I think you should bulk up a bit,I can offer some of my protein to you Today 14:41 Would you f*ck a stranger? No? Then let me introduce myself, my name is Anna I also require a phone number before I fuck someone, consider that my engagement proposal Sent Type a message.... GIF The pick up line show down of 2019
multiply: $42%
 14:45
 Anna
 Today 12:10
 I haven't seen you in forever
 Have you been visiting your
 fellow angels up in Heaven?
 Ps. Always wanted to use this
 as a text opener
 Are you my wallet? Because l
 want to fill you up
 Ps. I just had nothing to respond
 with so I saw my empty wallet.
 Today 13:00o
 Do you like vegetables,
 Because i like you from head
 tomatoesb
 At least something is empty
 Are you a salad, because l'd stay
 away from you until there was
 some meat in you
 Let's do some math. Add bed
 subtract clothes, divide legs,
 and multiply
 My tongue hasn't been to the
 gym in a while, mind sitting on
 my face and letting my tongue
 work out?
 Do you want to do 68? go
 down on you, and you owe you
 Are you my TV because i need
 to beat you to make you work
 Is that a mirror in your pocket?
 Cause l can see myself in your
 pants!
 Let's recreate our parents lives
 I act like I love you, I get you
 pregnant and then go move to
 the middle East under a different
 identity
 Oh that would be lovely. When
 and where?
 They say your tongue is the
 strongest muscle in your body
 Want to fight?
 I'd like to request a handicap,
 my tongue isn't strong enough
 to fight your tongue, How about
 I fight your clit?
 Today 14:02
 Did your license get
 suspended for driving all these
 tinder girls crazy?
 I think you should bulk up a bit,I
 can offer some of my protein to
 you
 Today 14:41
 Would you f*ck a stranger? No?
 Then let me introduce myself,
 my name is Anna
 I also require a phone number
 before I fuck someone, consider
 that my engagement proposal
 Sent
 Type a message....
 GIF
The pick up line show down of 2019

The pick up line show down of 2019

multiply: Code Written By A CS 101 Student public int tibonacci (int x) (x1) else if (x-2) else return 1: return 1 return fibonacci(x- 1) + fibanacci (x - 2)3 Code Written At A Hackathon pubiic int getFibonacciNumber (int n) switch (n) [ case 1: return 17 case 2: return 1: case 3: return 27 case : return 3 case S: returnS case 6: return case 7: return 13 default: // good enough for the demo, 1ol return-1 Code Written At A Startup // TODO add Javadoc comment큐 /I TOD0 Should we move this to a different file? public int getFibonacciNunber (int n) t // TODO Stack may overflow with recursive implementation. ฐพ1tch over to // iteration approach at some point? if n< 0) TODO This should probably throw an exception. Or maybe just print /I a log message? return-1 else if0) I TODO Generalize the initial conditions? return else if (n1) return1 else [ // TODO Spend some time with薑y family and kida, 1.ve been at work tor // over 钅8 hour3 きtraight return getFibonacciNumber (ngetFibonnaciNumber (n2) Code Written At A Large Company i8 a method that, agiven some index n returns the nch get Eibonacei number " eparam n The index of the Fibonacei number you wish to retrieve return The nth Fibonacci number public CustomInteger64 getFibonacciNumber (CustomInteger64 n) FibonacciDataviewBu11dex bui1der FibonacciDataviewBu1lderFactory.createF bonacciDataviewBaiider new F1bonacciDatavievBuilderParana (n, null, null, , ll)) ir (bu1ider-FibonaccibataviewBu1lderConatanta.ERROR STATE) throw new FibonacciDatavievBuilderFactoryException FibonacciDataview dataview-bu1lder.GenerateFibonacciDataview (this) if (datav1e낱--F1bonacc1Datav!ewConstants.ERRORSTATE) ( - throw new FibonacciDatavievGenerationException return dataview.accessNextFibonacciNumber (null, null, null) Code Written By A Math Ph.D. public int geth r(int n) { return (int) divide (aubtract (exponentiate (phi0)xponentiate (ps0, )) subtract (phi0 P:0D public double exponentiate (double a, double b) if (equal (b, zero)) return one else return multiply(a, exponentiate(a, subtract (b, one))) public double phi return divide (add (one() , 8qrt (add (one () , one 《), one {), one (), one ()) ) ) , add (one,one O)) public double pai ( return aubcract (oneo, ph100) Code Written By Your Cat public atatic final Int UNITE-1: public atatic tinal int UNITED-2 public int meow仁nt KITTENS OFTHE WORLD) { - MEOW i (ITTENS OF THE WORLD <UNITED) return RITTENS OF THE WORLD else return ne(IITENS OF THE WORLD UNITE) + meaw (KITTENSOF THE WORLD UNITED) HODOR?! $HODOR: HODOR! Hodor? Hodor oHODOR? HODOR hodor hodor Hodor? HoOodo0orhodor hodor!? Hodor. Hodor! hodor? rHoDoRHoDoR (HODOR?) ( HOdor!! (HODOR? <0) HODOR: HODOR? hodor! Hodor!? Hodor!? HOdor!!! (HODOR?11 HODOR?2) HODOR::1 HODOR:: HODOR! Hodor? Hodor! oHODOR? HODOR hodor hodor Hodor? HoOodoOorhodor hodor!? Hodor. Hodor! hodor? r (HODOR?1) + HODOR! Hodor? Hodor! oHODOR? HODOR hodor hodor Hodor? HoOodoOorhodor hodor!? Hodor. Hodor! hodor? r (HODOR?-2); The 7th type of programmer
multiply: Code Written By A CS 101 Student
 public int tibonacci (int x)
 (x1)
 else if (x-2)
 else
 return 1:
 return 1
 return fibonacci(x- 1) + fibanacci (x - 2)3
 Code Written At A Hackathon
 pubiic int getFibonacciNumber (int n)
 switch (n) [
 case 1: return 17
 case 2: return 1:
 case 3: return 27
 case : return 3
 case S: returnS
 case 6: return
 case 7: return 13
 default:
 // good enough for the demo, 1ol
 return-1
 Code Written At A Startup
 // TODO add Javadoc comment큐
 /I TOD0 Should we move this to a different file?
 public int getFibonacciNunber (int n) t
 // TODO Stack may overflow with recursive implementation. ฐพ1tch over to
 // iteration approach at some point?
 if n< 0)
 TODO This should probably throw an exception. Or maybe just print
 /I a log message?
 return-1
 else if0)
 I TODO Generalize the initial conditions?
 return
 else if (n1)
 return1
 else [
 // TODO Spend some time with薑y family and kida, 1.ve been at work tor
 // over 钅8 hour3 きtraight
 return getFibonacciNumber (ngetFibonnaciNumber (n2)
 Code Written At A Large Company
 i8 a method that, agiven some index n returns the nch
 get
 Eibonacei number
 " eparam n The index of the Fibonacei number you wish to retrieve
 return The nth Fibonacci number
 public CustomInteger64 getFibonacciNumber (CustomInteger64 n)
 FibonacciDataviewBu11dex bui1der
 FibonacciDataviewBu1lderFactory.createF bonacciDataviewBaiider
 new F1bonacciDatavievBuilderParana (n, null, null, , ll))
 ir (bu1ider-FibonaccibataviewBu1lderConatanta.ERROR STATE)
 throw new FibonacciDatavievBuilderFactoryException
 FibonacciDataview dataview-bu1lder.GenerateFibonacciDataview (this)
 if (datav1e낱--F1bonacc1Datav!ewConstants.ERRORSTATE) (
 -
 throw new FibonacciDatavievGenerationException
 return dataview.accessNextFibonacciNumber (null, null, null)
 Code Written By A Math Ph.D.
 public int geth
 r(int n)
 {
 return (int) divide (aubtract (exponentiate (phi0)xponentiate (ps0, ))
 subtract (phi0 P:0D
 public double exponentiate (double a, double b)
 if (equal (b, zero))
 return one
 else
 return multiply(a, exponentiate(a, subtract (b, one)))
 public double phi
 return divide (add (one() ,
 8qrt (add (one () ,
 one 《),
 one {),
 one (),
 one ()) ) ) ,
 add (one,one O))
 public double pai (
 return
 aubcract (oneo, ph100)
 Code Written By Your Cat
 public atatic final Int UNITE-1:
 public atatic tinal int UNITED-2
 public int meow仁nt KITTENS OFTHE WORLD) {
 -
 MEOW
 i (ITTENS OF THE WORLD <UNITED)
 return RITTENS OF THE WORLD
 else
 return ne(IITENS OF THE WORLD UNITE)
 + meaw (KITTENSOF THE WORLD UNITED)
 HODOR?!
 $HODOR: HODOR! Hodor? Hodor oHODOR? HODOR hodor hodor Hodor?
 HoOodo0orhodor hodor!? Hodor. Hodor! hodor? rHoDoRHoDoR (HODOR?) (
 HOdor!! (HODOR? <0) HODOR: HODOR? hodor! Hodor!? Hodor!?
 HOdor!!! (HODOR?11 HODOR?2)
 HODOR::1
 HODOR:: HODOR! Hodor? Hodor! oHODOR? HODOR hodor hodor Hodor?
 HoOodoOorhodor hodor!? Hodor. Hodor! hodor? r (HODOR?1)
 + HODOR! Hodor? Hodor! oHODOR? HODOR hodor hodor Hodor?
 HoOodoOorhodor hodor!? Hodor. Hodor! hodor? r (HODOR?-2);
The 7th type of programmer

The 7th type of programmer