Merge branch 'master' into feature/ZombieChibiXD_Palindrome_JAVA

Author: wzhouwzhou

.gitignore

@@ -253,3 +253,4 @@ Module.symvers
 Mkfile.old
 dkms.conf
 /.vs
+.Rproj.user

CONTRIBUTORS.md

@@ -0,0 +1 @@
+awk -F '"' '{print $6}' access.log | sort -nr | uniq -c | sort -nr | head -n10

README.md

@@ -0,0 +1,9 @@
+#include <stdio.h>
+void main()
+{
+ int a,b;
+ printf("enter a and b\n");
+ scanf("%d%d",&a,&b);
+ a=(a+b)-(b=a);     // one line code
+ printf("a=%d and b=%d",a,b);
+}

bash/antoooks_print_top_10_user_agents_from_access_log.sh

@@ -0,0 +1,18 @@
+/*
+ * @file: shubhamdpatil_gcd.c
+ */
+
+#include <stdio.h>
+
+int gcd(int x, int y)
+{
+	return (y == 0) ? x : gcd(y, x % y);
+}
+
+int main()
+{
+	int a, b;
+	scanf("%d %d", &a, &b);
+	printf("GCD of %d and %d: %d\n", a, b, gcd(a, b));
+	return 0;
+}

c/HarshitaArun_Swap.c

@@ -0,0 +1,19 @@
+/*
+ * @file: shubhamdpatil_swap.c
+ */
+
+#include <stdio.h>
+
+#define swap(x, y) ((x ^= y), (y ^= x), (x ^= y))
+
+int main()
+{
+	int a, b;
+	scanf("%d %d", &a, &b);
+	printf("Before swap: %d, %d\n", a, b);
+
+	swap(a, b);
+	printf("After swap: %d, %d\n", a, b);
+	return 0;
+}
+

c/gcd/shubhamdpatil_gcd.c

@@ -0,0 +1 @@
+add = (a, b) -> a + b

c/swap/shubhamdpatil_swap.c

@@ -0,0 +1 @@
+subtract = (a, b) -> +a - +b

coffeescript/wzhouwzhou_add.coffee

@@ -0,0 +1,13 @@
+#include <iostream>
+#include <string>
+
+bool isPalindrome(std::string input)	{	return input == std::string(input.rbegin(), input.rend());	}
+
+int main()
+{
+  std::string input = "able was I ere I saw elba" ;
+  //std::cout << "Input : ";
+  //getline (std::cin, input);
+  std::cout << "It is " << (isPalindrome(input) ? "" : "not ") << "a palindrome";
+}
+

coffeescript/wzhouwzhou_subtract.coffee

@@ -0,0 +1 @@
+func add(a, b int) int { return a + b }

cplusplus/ZombieChibiXD_Palindrome.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+
+using namespace std;
+
+void issquare(long long int a){
+int flag=1;	for(long long  i=1;i<=a/2+1;i++){	if(i*i==a)	{cout<<"it is a square number\n";flag=0;}	}if(flag==1)	cout<<"Not a square number\n";		
+}
+
+int main(){
+long long int a;
+cin>>a;
+issquare(a);
+return 0;
+}

go/wzhouwzhou_add.go

@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+pair<ll,ll> maxsum(ll arr[],ll n)
+{
+ll sum=0;
+ll max=0;
+pair<ll,ll>p;
+ll x=0,y=0;
+for(ll i=0;i<n;i++)
+{
+sum+=arr[i];
+if(sum>max){max=sum;y=i;}
+if(sum<0){sum=0;x=i+1;}
+
+}
+p.first=x;
+p.second=y;
+return p;
+}
+
+int main()
+{
+int n;
+cin>>n;
+ll arr[n];
+for(ll i=0;i<n;i++)cin>>arr[i];
+pair<ll,ll>p=maxsum(arr,n);
+cout<<p.first<<" "<<p.second<<endl;
+return 0;
+}

honorary-one-line-wonders/cplusplus/U3X_check_square.cpp

@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+int countingValleys(int n, string s) {
+
+
+int sum=0;
+if(s[0]=='U')sum++;
+else sum--;
+int count=0;
+if(sum<0)count++;
+for(int i=1;i<n;i++)
+{
+    if(s[i]=='D')sum--;
+    else sum++;
+    if(s[i]=='D' && sum==-1)count++;
+}
+return count;
+
+}
+
+int main()
+{
+int n;
+cin>>n;
+string s;
+cin>>s;
+cout<<countingValleys(n,s)<<endl;
+return 0;
+}

honorary-one-line-wonders/cplusplus/yashagarwal1999_Largest _sum_of_consecutive_numbers_in_an_array.cpp

@@ -0,0 +1,5 @@
+const map = (arr, cb) => {
+  let i = arr.length, result = Array(i);
+  while (i--) result[i] = cb(arr[i], i, arr);
+  return result;
+};

honorary-one-line-wonders/cplusplus/yashagarwal1999_countingValley.cpp

@@ -0,0 +1,13 @@
+
+
+class Max2Digit {
+
+  public static int max(int a, int b) {
+ 	return Math.max(a,b); 
+  }
+
+  public static void main(String[] args) {
+  	System.out.println(Max2Digit.max(5,10));
+  }
+
+}

honorary-one-line-wonders/javascript/vetlix_array_map.js

@@ -0,0 +1 @@
+const collatz = x => x <= 1 ? x : collatz((x % 2) === 0 ? x / 2 : x * 3 + 1);

java/sgirabin_Max2Digit.java

@@ -0,0 +1,2 @@
+// This will check if a number is 0 or smaller and then converts it. If 0, to 1. If n < 0, to -n
+const convert = (n) => { return (-(~(n ^ 0))) < 0 ? (-(~(n ^ 0))) != -1 ? (-(-(~(n ^ 0)))) + 1 : (-(-(~(n ^ 0)))) : (-(~(n ^ 0))) != 1 ? (-(~(n ^ 0))) - 1 : (-(~(n ^ 0))); }

javascript/Xander1233_collatzConjecture.js

@@ -0,0 +1 @@
+const palindrome = (text) => text.toLowerCase() == text.toLowerCase().split("").reverse().join("");

javascript/Xander1233_convert_number_to_one_or_bigger.js

@@ -0,0 +1 @@
+const add = (a, b) => a + b;

javascript/ZombieChibiXD_Palindrome.js

@@ -0,0 +1 @@
+const subtract = (a, b) => a - b

javascript/rpxs_add.js

@@ -0,0 +1,3 @@
+const values = [1, 2, 3, 4, 5, 1, 1, 1, 3];
+
+const unique = [void(0)].map((e, i, arr) => new Set(values).forEach(v => arr.push(v)) || arr)[0].slice(1);

javascript/rpxs_subtract.js

@@ -0,0 +1 @@
+const deepFlat = arr => arr.flat(Infinity);

javascript/unique/wzhouwzhou_unique_values.js

@@ -0,0 +1 @@
+const empty = arr => arr.length = 0;

javascript/vetlix_deepflat_array.js

@@ -0,0 +1 @@
+void(process.stdout.write('Hello, world!\r\n\0'));

javascript/vetlix_empty_array.js

@@ -0,0 +1 @@
+Math.floor(Math.random() * 2) === 1 ? console.log('Heads!') : console.log('Tails!')

javascript/wzhouwzhou_check_brackets.js

@@ -0,0 +1 @@
+(t = 1000) && Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, t)

nodejs/hello/kannagikazuko_hello_world.js

@@ -0,0 +1,2 @@
+(Invoke-WebRequest "http://api.open-notify.org/astros.json" | ConvertFrom-Json).people
+#note, I got the idea from PowerShell.com a while ago, but I cannot find it now.

nodejs/tacticaltechjay_coinFlip.js

@@ -0,0 +1,3 @@
+# Generates a random strong 20 chars long password.
+# If you want to change the length of the password you can cange 20 inside the brackets before the -join to somethin else.
+([char[]]([char]33..[char]95) + ([char[]]([char]97..[char]126)) + 0..9 | Sort-Object {Get-Random})[0..20] -join ''

nodejs/wzhouwzhou_delay.js

@@ -0,0 +1,3 @@
+pi=lambda get_approx_pi:4 * sum(-float(k%4 - 2) / k for k in range(1, 2*val+1, 2))
+val=int(input('Number of iterations'))
+print(pi(val))

powershell/Astronaut/rpstester_ListOfPeopleInSpace.ps1

@@ -0,0 +1,5 @@
+from functools import reduce
+
+def factors(n):    
+    return list(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))
+

powershell/turbosnute_strongpassword.ps1

@@ -0,0 +1 @@
+import __hello__

python/approximate_pi/yashagarwal1999_get_Approximate_Pi.py

@@ -0,0 +1 @@
+[elemento**2 for elemento in range(11) if elemento%2==0]

python/bhavikb07_Factors.py

@@ -0,0 +1 @@
+par = lambda x:True if x%2==0 else False

python/hello/antonio32a_world.py

@@ -0,0 +1,3 @@
+# Returns a positive number if x is > y, 0 if they are equal, or a negative number if x is < y
+def greaterThan(x, y):
+  return (x-y)

python/mirandars_par-perfect-squares.py

@@ -0,0 +1,3 @@
+def mirrorList(list):
+  return list[::-1]
+  

python/mirandars_parity-test.py

@@ -0,0 +1,3 @@
+def mean(list):
+  return sum(list)/len(list)
+

python/mspatel927_Greater_Than.py

@@ -0,0 +1,16 @@
+#Consider the program that takes in a string and a list of numbers. 
+#It will prepend the string to each of the numbers and return a string of this new list separated by commas. 
+#For example, foo('$', range(5)) would return '$0, $1, $2, $3, $4'. 
+#A naive coder will do this-
+#
+#def foo(string, numbers):
+#  output = ''
+#  for i in range(len(numbers)):
+#    if i > 0:
+#      output += ', '
+#    output += string + str(numbers[i])
+#  return output
+#
+# Here is an elegant way with Output $0, $1, $2, $3, $4-
+
+def foo(string, numbers): return ', '.join(map(lambda s,n:s+str(n), [string for i in numbers], numbers))

python/mspatel927_Mirror_List.py

@@ -0,0 +1 @@
+print '\n'.join("%i Byte = %i Bit = largest number: %i" % (j, j*8, 256**j-1) for j in (1 << i for i in xrange(8)))

python/mspatel927_Random_Card_Draw.py

@@ -0,0 +1,6 @@
+dec = 344
+
+print("The decimal value of",dec,"is:")
+print(bin(dec),"in binary.")
+print(oct(dec),"in octal.")
+print(hex(dec),"in hexadecimal.")

python/prathimacode-hub_ordered_prepend_string_num.py

@@ -0,0 +1,11 @@
+'''
+Bogosort created using lambda.
+
+@author: ngweihow (github.com/ngweihow)
+'''
+from random import sample
+
+b_sort = lambda ls: ls if all(ls[i] <= ls[i+1] for i in range(len(ls)-1)) else b_sort(sample(ls, len(ls)))
+
+# Tests (PLEASE DO NOT TEST WITH LARGE LIST INPUT, BOGOSORT IS HIGHLY INEFFICIENT)
+print(b_sort([4,3,2,1]))

python/predator21x_The-largest_number_that_can_be_represented_by_8_Byte.py

@@ -0,0 +1,3 @@
+list1 = [1,10,7,1,4]
+
+[x for idx, x in enumerate(list1) if x not in list1[:idx]]

python/predator21x_decimal_conversion.py

@@ -0,0 +1,7 @@
+# Given two lists, find elements not present in both 
+# Effectively, a join + delete duplicates. Conversion to set means it nukes repeated elements
+s1 = [1,9,23,4]
+s2 = [1,4,8,3,7]
+
+# XOR operation on sets
+print(set(s1) ^ set(s2))

python/sorting/ngweihow_bogosort.py

@@ -0,0 +1,9 @@
+def uni(arr):
+        li=[]
+        [li.append(i) for i in arr if not li.count(i)]
+        return li
+
+list1 = [10, 20, 10, 30, 40, 40] 
+print(getunique(list1))
+
+

python/unique/RaInta_unique_array.py

@@ -0,0 +1,5 @@
+is.prime <- function(n) n == 2L || all(n %% 2L:ceiling(sqrt(n)) != 0)
+
+# test
+test_vec <- 0:10
+sapply(test_vec, is.prime)