anuprulez

BinaryTree

Operations on a Binary Tree

clade_prediction

Sequence generation/sequence to sequence learning using amino acid sequences of Corona virus (SARS-COV2) by training on generative adversial network (GAN)

galaxy_tool_recommendation

Galaxy tool recommendation

galaxy_tool_recommendation_transformers

Galaxy tool recommendation using transformers

GaussianProcessRegression

Gaussian Process Regression

ml-jupyter-notebook

GPU-enabled docker container with Jupyterlab for artificial intelligence

galaxytools

:microscope::books: Galaxy Tool wrappers

galaxy

Data intensive science for everyone.

training-material

A collection of Galaxy-related training material

gpu-jupyterlab-docker

GPU-enabled docker container with Jupyterlab for artificial intelligence

anuprulez/BinaryTree

Operations on a Binary Tree

anuprulez/TeamSplit

Chef wants to split a team of new chef into two teams to play a game. In order to make the split, he first designates two team captains who take alternate turns selecting players for their teams. During each turn, the captain selects a single player for his team. Since each captain wants to make the strongest possible team, he will always select the best available player. The players have strengths as integer number, where higher strength indicate better players. After all the players have been selected, the team strength is computed as the sum of the strengths of the players on that team. For example, if strengths of 5 players are 5,7,8,4 and 2, then the first captain selects the player with strength 8 for his team, the second captain gets the player with strength 7, the first gets the one with strength 5, the second the one with strength 4, and the last one (strength 2) goes to the first team. The first team now has a total strength 8+5+2=15, and the second team has strength 7+4=11. Now Chef wants to find the absolute strength difference between the two teams. For the example above the answer is 4(=|15-11|). But Chef does not know exact strengths of each player. He knows some parameter a, b, c and d and a formula to find the strength of each player. The formula is S0 = d, Si = (a * Si-12 + b * Si-1 + c) mod 1000000, for i = 1 to N - 1 There are N players numbering 0 to N-1 and Si is the strength of player i. Input First line of the input contains an integer T, number of test cases to follow. Each test consist of single line containing five integers N, a, b, c and d. Output For each test case, you have to print a single line containing the absolute strength difference between the two teams. Constraints 1 ≤ T ≤ 50 1 ≤ N ≤ 3000000 0 ≤ a, b, c, d ≤ 100 Example Input: 4 1 1 1 1 1 2 1 1 1 1 3 1 2 3 4 4 2 3 4 1 Output: 1 2 763 74896

anuprulez/aima-python

Automatically exported from code.google.com/p/aima-python

anuprulez/BreadthFirstSearch

anuprulez/circularqueue

anuprulez/doublylinkedlist

anuprulez/ember.js

Ember.js - A JavaScript framework for creating ambitious web applications

anuprulez/GameOfPips

All submissions for this problem are available. Sherlock is now taking a break from his current case and starts reviewing his famous case of "The N Orange Pips". He slips too deep into the case and gives you a puzzle. Sherlock has N boxes consisting of orange pips. The ith box contains Ai orange pips. He now wants you to take out some pips from each box (you may leave some boxes untouched), such that in all the boxes the remaining number of pips is odd and equal to each other. Also, for each box, the number of pips present after the removal must be a factor of the original number of pips that were present in the box. You need to take as minimum number of pips as possible. Now Sherlock asks you to tell the number of pips each box will have. Input The first line consists of the number of boxes, N. N integers follow, each having a single integer, denoting the number of pips in each box. Output A single integer denoting the number of pips each box will have. Constraints 1 ≤ N ≤ 10^5 1 ≤ Ai < 2^63 Example Input: 4 98 42 14 28 Output: 7

anuprulez/GoogleMapWithAngular

anuprulez/gradientdescent.py

Gradient Descent Algorithm

anuprulez/Hashing1

Simple problem of division using Hashing

anuprulez/JUIME

JQuery UI MVC Extensions

anuprulez/longest_sequence

Longest non-decreasing sequence using Dynamic Programming

anuprulez/ObserverPattern

C++ code for Observer pattern from Head First Design Pattern book

anuprulez/PredictiveModel_pipeline

PredictiveModel_pipeline

anuprulez/Projects

anuprulez/pushfromlocal

Sample push code from local system

anuprulez/QueueLinkedList

anuprulez/rnn-tutorial-gru-lstm

Language Model GRU with Python and Theano

anuprulez/StackThroughLinkedList

anuprulez/StrategyPattern

c++ code using Strategy Design Pattern (HeadFirst Design Pattern book example)

anuprulez/sum_of_coins_dynamic_programming

Dynamic Programming

anuprulez/SuperSAB

Gradient Descent Algorithm

anuprulez/todomvc

Helping you select an MV* framework - Todo apps for Backbone.js, Ember.js, AngularJS, and many more

anuprulez/ViolentPython

anuprulez/word2vec

Python implementation of Word2Vec using skip-gram and negative sampling