CodeForFun

Sql procedure to read data from mySQL DB

2014-02-17T03:00:00.003-08:00

Learning :

mysql procedure to get the data from a table
************************************************************
DELIMITER $$
DROP PROCEDURE IF EXISTS sp_transpose_tickets $$
CREATE PROCEDURE sp_transpose_tickets ()
BEGIN
select eladm.DiagnosisCode,eladm.PatientID from admission eladm;
END$$
DELIMITER ;

************************************************************
where admission== tableName

to see what is stored
*******************************
call sp_transpose_tickets()
*******************************

Run Rserve on eclipse Example java code

2013-09-20T05:22:00.001-07:00

assuming that you have R installed , bring up the R console by typing

R on console (in context of linux)

install.packages("Rserve")

library(Rserve)

Rserve()
Wait for final message at console as below
Rserv started in daemon mode.

import org.rosuda.JRI.Rengine;

import org.rosuda.REngine.REXPMismatchException;
import org.rosuda.REngine.REngineException;





 class RServerHello {








 Rengine rengi




import org.rosuda.REngine.Rserve.*; 

publi
cne; // initialized in constructor or autowired






eption {


  try {






    RConnection c = new RConnect




public void helloRWorld() throws REXPMismatchEx
cion();// make a new local connection on default port (6311)

         org.rosuda.REngine.REXP x0 = c.eval("R.version.s
double d[] = c.eval("rnorm(10)").asDoubles();
  
 tring");
            System.out.println(x0.asString());
} catch (REngineException e) {
            //manipulation

new RServerHel
}     
  
 }
 public static void main(String[] args) throws REXPMismatchException {
  RServerHello hwObj =
 lo();
  hwObj.helloRWorld();
 }


}


Download RserveEngine.jar and include that as an external jar at configure build path (Right click on your file at project explorer -> Build Path --> configure build path).

Your java code now should be free of all errors




Run!!!




It should just work

touchpad disabled after upgrading kernel to 3.4.0-030400-generic on Ubuntu 12.04 Dell Vostro-Solved

2013-09-17T05:03:00.001-07:00

Recently i upgraded my kernel of Ubuntu 12.04 LTS from 3.2.xxx to 3.4 for some software installation , however found my Vostro Dell touchpad disabled and mouse non functional

Here are the commands which help me in getting back the control of touchpad
This command will reload the mouse driver

sudo modprobe -r psmouse
sudo modprobe psmouse proto=imps

Also this helps only to make it working in current session , to be able to have it working on every boot time as you would have already figured out , we need to add it to /etc/modprobe.d

Create a file like sudo vi mouse.conf

Add this as a content of file

options psmouse proto=imps

save it , hopefully you wont see the problem again , its like adding a service at stratup as per windows definition.

Manish

install sqldeveloper on Ubuntu 12.04 LTS

2013-08-29T03:44:00.003-07:00

1.download the oracle from Oracle main Site …Geek alert- Nah no command for this , you need to go register and download !!!

2.sudo apt-get install alien (Most probably this would have got already installed while installing oracle)

3.Logically you have a rpm now so you got to change it to the format ubuntu understands it right ? Alient is your saviour to get that bit done

sudo alien --scripts -d sqldeveloper-3.2.20.09.87-1.noarch.rpm

4.Install sql developer from the deb package you have

sudo dpkg -i sqldeveloper_3.2.20.09.87-2_all.deb

5.Create the following directory in your home folder, this where it's going to store path to the jdk in the next step:

cd /home/$username(The system name variable)

say in my case cd /home/manish

mkdir .sqldeveloper/

Run the sql developer from shell it is gonna ask it to feed path of java Do that , see

echo $JAVA_HOME and feed that as input

mostly it is going to look like this

/usr/lib/jvm/java-6-openjdk

sudo /opt/sqldeveloper/sqldeveloper.sh

Install latest version of R on Ubuntu [if you have some version already installed and getting ERROR: dependencies ‘mclust’, ‘flexmix’ are not available for package ‘fpc’ on R studio]

2013-08-27T02:19:00.003-07:00

I had R 2.0.14 on my ubuntu 12.04 LTS and was trying to use the command

install.packages("fpc")

ERROR: dependencies ‘mclust’, ‘flexmix’ are not available for package ‘fpc’

That is where is realized that my R version is old to have these packages and hence the obvious solution is to uninstall and install latest R

These details i found on StackOverflow and it worked for Me

Uninstall old R

sudo apt-get remove r-base-core

Adding deb to sources.list

sudo nano /etc/apt/sources.list    
deb http://cran.rstudio.com/bin/linux/ubuntu precise/

precise is your ubuntu name (may be different)

Add key to sign CRAN packages

sudo apt-key adv --keyserver keyserver.ubuntu.com --recv-keys E084DAB9

Add specific PPA to the system

sudo add-apt-repository ppa:marutter/rdev
sudo apt-get update
sudo apt-get upgrade

installing

sudo apt-get install r-base

From R to check version

version

should give you

version.string R version 3.0.1 (2013-05-16)

Credit Anando Mahto (StackOverflow member)

python connection with mysql DB and data fetch on Linux(Ubuntu)

2013-06-06T21:07:00.002-07:00

At first check the installation of python by firing this command on console

>$mysql -h 127.0.0.1 -u root -p
password: *******

PS:Here my installation of mysqldb is as a root user which is true in most of the cases as mysql come pre packaged with ubuntu 12 , (i am not sure about the earlier versions but u can always test it by firring a simple command which mysql and figure out if you have already mysql installed)

an empty result ensures that you do not have mysql installed where as the result pointing to a bin location represents that you already have mysql.

Any way there are millions of web pages already available on how to install mysql on ubuntu so i will not get on to it and try to stick to the blog headline which is connection of python script to mysql db to fetch data. (U also need to worry about python installation if it is not part of distribution of linux package you are using. )

any way :

I assume now you have a working mysql and have created a DB and a basic table with some data in it

(create simple table with one id and one data column to keep it simple)

Now

save this script as a python script

mport MySQLdb

db = MySQLdb.connect(host="localhost", # your host, usually localhost

user="root", # your username

passwd="******", # your password

db="TestDB") # name of the data base

# you must create a Cursor object. It will let

# you execute all the query you need

cur = db.cursor()

# Use all the SQL you like

cur.execute("SELECT * FROM NODEJSTEST")

# print all the first cell of all the rows

for row in cur.fetchall() :

print row[0]

This should be able to return you all the columns from your table

Error: if you get in to error of mysqldb not recognised

sudo apt-get install python-mysqldb

Running this will get you out of this error . Some time it appears some time it does not hence i have not included it as a part of regular work. It is also possible that the system it worked , was already configured for it (i work on dev set up which is used by many developers so can not really tell ), so may be its a necessary step. You might want to even do it as a regulr step if you dislike errors :)

Mail me if you do not find the steps working and we shall work together to get it working

setting "rm" to move files (and folders) to trash-"rm -rf" Undo

2013-03-24T22:20:00.002-07:00

Step1. sudo apt-get install trash-cli

Trash-cli:This package provides a command line interface trashcan utility compliant with the FreeDesktop.org Trash Specification. It remembers the name, original path, deletion date, and permissions of each trashed file

Step2. sudo gedit /usr/local/bin/trash-rm

in Ubuntu 10.04 i found it to be sbin than bin so command might be

sudo gedit /usr/local/sbin/trash-rm

Step 3

Paste this content

#!/bin/bash
# command name: trash-rm
shopt -s extglob
recursive=1
declare -a cmd
((i = 0))
for f in "$@"
do
case "$f" in
(-*([fiIv])r*([fiIv])|-*([fiIv])R*([fiIv]))
tmp="${f//[rR]/}"
if [ -n "$tmp" ]
then
#echo "\$tmp == $tmp"
cmd[$i]="$tmp"
((i++))
fi
recursive=0 ;;
(--recursive) recursive=0 ;;
(*)
if [ $recursive != 0   -a  -d "$f" ]
then
echo "skipping directory: $f"
continue
else
cmd[$i]="$f"
((i++))
fi ;;
esac
done
trash "${cmd[@]}"

Save and Exit

Set Correct executable rights on the created file

Step:4

sudo chmod +x /usr/local/bin/trash-rm

Step 5:

gedit ~/.bashrc

Step 6:

alias rm = "trash-rm"

Step7:$bash

Re run bash on linux terminal to re run the bashrc

Step8:

Try by creating a file and then using rm -rf "createdFile.txt"

find that file in Trash

ECLIPSE Shortcut for converting lower case to upper and vice versa

2013-03-19T22:40:00.002-07:00

Just a quick short cut which is very useful for developers to convert the selected lower case text to Upper case and vice versa

Lower case: CTRL+SHIFT+Y (CMD+SHIFT+Y on Mac OS X)
Upper case: CTRL+SHIFT+X (CMD+SHIFT+X on Mac OS X)

The good thing here is you can select one or multiple characters/word/lines by using Using + ->/<-/DownArray and then convert all of it at once.

Android Installation problem [Can not complete the Install ] Solved

2012-12-02T21:01:00.000-08:00

Problem

Cannot complete the install because one or more required items could not be found.
  Software being installed: Android Hierarchy Viewer 18.0.0.v201203301601-306762 (com.android.ide.eclipse.hierarchyviewer.feature.group 18.0.0.v201203301601-306762)
  Missing requirement: Android Hierarchy Viewer 18.0.0.v201203301601-306762 (com.android.ide.eclipse.hierarchyviewer.feature.group 18.0.0.v201203301601-306762) requires 'org.eclipse.core.runtime 3.6.0' but it could not be found

Please note same message for  "Android DDMS","Android Development Tools" and  "Android Traceview"

Or Duplicate Repository problem where as creating the new Android Project option doesnt appear

Head over to Help -> Install New Software. Click on Available software sites. Delete the Android repo. Uncheck Indigo & Eclipse updates & recheck them. Now head back to Help -> Check for updates. Once done, add the Android repo again. Accept the license & you should be good to go.

(Had to do the same yesterday after getting Indigo)

Source: StackOverFlow: Pasting here as this Solution worked for me after trying a lot of solutions posted over net

TCS fiasco and How to keep your account safe while changing mobile no

2012-08-26T18:30:00.001-07:00

  24^th August and the morning news came out as Techie steals Rs 49L from 3 bank accounts in Chennai. This news was definately worth the attention as while working with multiple service /Product companies techies like me  do get exposed to sensitive information. Here is what heppned in short and how the fraud was done

TCS Fraud protype

 Now the account and details related to it are in total unsafe hands and is     exposed to the variety of fraud which can be done . Now though the likelihood of having access to Bank DB is very less but even a person in million having access  to bank DB with malicious intention can give any bank a very hard time. The only way for the bank to trace back in these situation is to trace  the user            Machine IP where query was executed and me myself being a techie can say it for sure , its a cake walk to  mask my IP and give the Bank guys even a harder time trying to trace the origin of fraud.

  The point worth mentioning in this TCS fiasco is ,the techie was caught only becasue he/She  gone greedy and started withdrawing large amounts. However if they had kept a little control on their greed, it was close to impossible to figure out . And we will never know if the employee had done small such malicious activity in past and the amount was not big enough to draw attention of bank officials.

  Looking at the pattern however , it exposes the seriousness with which customer's private data is maintained, and the low level of security practises banks follow in order to save their customers hard earned money.this also brings the necessity  of a strong and capable Real Time online fraud monitoring system where multiple such incidents are coded as  a part of online transaction as well as card swipe process and is capable to stop transaction in any of the possible fraud scenario and is part of core banking system . 

  it will be interesting to see in indian market where changing the mobile number  is such a common process , if one gets access to telecom DB and does a intersection and imaginary scenario something like this

The received out put list is the list of customer whoose transaction should be immideatly blocked until the new number is updated other wise in a matter of second and effort of two software engineers (One working for Bank and one working for Telecom ) is capable of adding multiple zeroes in the 49Lakh amount fraud..

  For customers , they should immediately give standing instruction to bank/Credit card company to stop doing any sort of transaction unless  they have a working number again.The process might look a little cumbersome to follow but as we all know it for a fact that its always  “better to be safe than sorry“.

Count The No of Inversion in merge Sort

2012-06-24T21:12:00.000-07:00

Algo:

i have followed to do the same

Merge sort array A and create a copy (array B)
Take A[1] and find its position in sorted array B via a binary search. The number of inversions for this element will be one less than the index number of its position in B since every lower number that appears after the first element of A will be an inversion.

2a. accumulate the number of inversions to counter variable num_inversions.

2b. remove A[1] from array A and also from its corresponding position in array B
rerun from step 2 until there are no more elements in A.

Here’s an example run of this algorithm. Original array A = ( 14, 8, 12, 3, 2)

1: Merge sort and copy to array B

B = (2,3,8,12,14)

2: Take A[1] and binary search to find it in array B

A[1] = 14

B = (2,3,8,12,14)

14 is in the 5th position of array B, thus there are 4 inversions. We know this because 14 was in the first position in array A, thus any lower value element that subsequently appears in array A would have an index of j > i (since i in this case is 1).

2.b: Remove A[1] from array A and also from its corresponding position in array B (bold elements are removed).

A = ( 14, 8, 12, 3, 2) = (8, 12, 3, 2)

B = (2,3,8,12,14) = ((2,3,8,12)

3: Rerun from step 2 on the new A and B arrays.

A[1] = 8

B = ((2,3,8,12)

8 is now in the 3rd position of array B, thus there are 2 inversions. We know this because 8 was in the first position in array A, thus any lower value element that subsequently appears would have an index of j > i (since i in this case is again 1). Remove A[1] from array A and also from its corresponding position in array B (bold elements are removed)

A = (8, 12, 3, 2) = 12,3,2

B = (2,3,8,12) = 2,3,12

Continuing in this vein will give us the total number of inversions for array A once the loop is complete

Try to code as per Algo , it gives a complete result

i am not sharing code as its against the fair code Stanford rule and will share only once the date for submitting assignment is expired

however am okay if u need any help in completing this exercise and Java is teh language i prefer to code in

Basic IP Check with Ping using Java

2012-05-11T03:50:00.000-07:00

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.InetAddress;
import java.net.UnknownHostException;

public class testIp {

public static boolean checkIp (String sip)
{
String [] parts = sip.split ("\\.");
System.out.println("Parts length is "+parts.length);
if ( parts.length != 4 )
{
return false;
}
for (String s : parts)
{
int i = Integer.parseInt (s);
if (i < 0 || i > 255)
{
return false;
}
}
if (pingIp(sip))
return true;
else
return false;
}

private static boolean pingIp(String sip) {
// TODO Auto-generated method stub
try {
InetAddress adr = InetAddress.getByName(sip);
boolean stat= adr.isReachable(2000);
return stat;
} catch (UnknownHostException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}

return false;
}

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("Enter the IP to be chacked");
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {

String line = br.readLine();
boolean status=testIp.checkIp(line);
System.out.println("Status is "+status);
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}

}
}

EMMA Report Comparison Shell Based Utility

2012-05-10T01:31:00.001-07:00

Here i am pasting the Symbolic code for comparing two EMMA Reports where Assumptions are
1.before.txt ---> the actual report
2.after.txt----> report after modification

This Script will get in to those twpo reports and show block by Block Comparison
The idea behind sharing this is that using this Logic a Extensive User Utility script can be developed which can be used to compare EMMA Reports

function retLineNobefore()
{
Str=$1
while read Line
do
val=$(grep -n "$Str" | sed -n 's/^$[0-9]*$[:].*/\1/p') # this is to Extract just the Line no
break
done < before.txt
}

function retLineNoAfter()
{
Str=$1
while read Line
do
val=$(grep -n "$Str" | sed -n 's/^$[0-9]*$[:].*/\1/p')
break
done < after.txt
}

rm -fr report.txt

retLineNobefore "OVERALL COVERAGE SUMMARY:"
no1=$val

retLineNobefore "OVERALL STATS SUMMARY:"
no2=$val
echo "----------------Before-------------------------- " > report.txt

awk "{if((NR>"$no1")&&(NR<$no2)) print}" before.txt >> report.txt

retLineNoAfter "OVERALL COVERAGE SUMMARY:"
no1=$val
echo $no1

retLineNoAfter "OVERALL STATS SUMMARY:"
no2=$val
echo $no2
echo "----------------After-------------------------- " >> report.txt
awk "{if((NR>"$no1")&&(NR<$no2)) print}" after.txt >> report.txt

Customized page using JIRA which can autorefresh

2012-03-07T01:48:00.001-08:00

hello All
recently have been working on a small configuaration change in JIRA which can allow a user to write a gadget whcih can autorefresh it at a given interval .. just so that this post conversation can be helpful for others i am pasting the link as it is .
in case any problem revert back

want to create a customized page using JIRA functionality which can autorefresh it in say 15 sec interval any direction is appreciated
By Manish Ranjan (1 karma) on Mar 02 at 5:22 a.m.
jira
jira-plugins
answer my own question | add comment
edit|poke atlassian answer my own question | add comment 0

4 Answers:
oldest answers
newest answers
popular answers ↑
oldest answers
newest answers
popular answers ↑

I think you have to explain this a little bit more. I have no idea what you want to do... Sorry
By Thomas-S (616 karma) on Mar 02 at 5:57 a.m.
add comment
permanent link add comment

actually i want to write a plugin which will ahev a customized landing page and the page needed to be be refresh at an interval of 15 sec .
(Mar 02 at 06:16 AM)
Manish Ranjan

actually i want to write a plugin which will ahev a customized landing page and the page needed to be be refresh at an interval of 15 sec .
(Mar 02 at 06:16 AM)
Manish Ranjan 0

Is this a jira dashboard you are trying to get to refresh every 15s?

The old skool approach would be to have an HTML page with frames & a piece of javascript that reloaded your target page every 15s but that would be nasty!
By Matthew Cobby (1.4k karma) on Mar 02 at 11:38 a.m.
add comment
permanent link add comment

may be i will have my own gadget doint it for me .. but as of now i am facing another problem where i am able to see my gadget in plugins but not able to add it to the newly created dashboard.

can you also please help me in how can i add my own custom page to JIRA dashboard .. That would be in form a gadget right ?

also say i want to modify the "Assign to me" gadget providded by JIRA for a time less than a min rather than the options provided by JIRA which is atleast 15 mins.. how can i do that ?

(Mar 03 at 08:13 AM)
Manish Ranjan

may be i will have my own gadget doint it for me .. but as of now i am facing another problem where i am able to see my gadget in plugins but not able to add it to the newly created dashboard.

can you also please help me in how can i add my own custom page to JIRA dashboard .. That would be in form a gadget right ?

also say i want to modify the "Assign to me" gadget providded by JIRA for a time less than a min rather than the options provided by JIRA which is atleast 15 mins.. how can i do that ?

(Mar 03 at 08:13 AM)
Manish Ranjan 0

Why not just a meta tag, please see http://en.wikipedia.org/wiki/Meta_refresh
By Dieter (3.1k karma) on Mar 03 at 9:05 a.m.
add comment
permanent link add comment

but to embed the meta tag i need to figure out the source of "assigned to me" jsp right ? i tried but couldnt do the same. i have been doing research on this since wednesday so if i asking something silly am sorry,just to add i have not been able to add my own Custom page to JIRA as mentioned above so i am kinda stuck ..
(Mar 03 at 09:22 AM)
Manish Ranjan

but to embed the meta tag i need to figure out the source of "assigned to me" jsp right ? i tried but couldnt do the same. i have been doing research on this since wednesday so if i asking something silly am sorry,just to add i have not been able to add my own Custom page to JIRA as mentioned above so i am kinda stuck ..
(Mar 03 at 09:22 AM)
Manish Ranjan
Oh sorry, i hadn't seen your comment that you want to override the refresh period of the gadget. My answer was meant for a classical webwork action page, so probably this anwer is not useful.
(Mar 03 at 11:59 AM)
Dieter
Oh sorry, i hadn't seen your comment that you want to override the refresh period of the gadget. My answer was meant for a classical webwork action page, so probably this anwer is not useful.
(Mar 03 at 11:59 AM)
Dieter
1
you should search through all gadget.xml files in the Atlassian source tree to find the html and js code that makes up the assigned to me gadget.
(Mar 03 at 12:04 PM)
Dieter
1
you should search through all gadget.xml files in the Atlassian source tree to find the html and js code that makes up the assigned to me gadget.
(Mar 03 at 12:04 PM)
Dieter

when you say altassian source tree you mean in Jira installtion which is at /opt/atlassian/jira right ??i have been trying to backtrace the xml file but no success yet .. will try harder .. thanks for your help .. any pointer to search the same will be really helpfull. Manish
(2 days ago)
Manish Ranjan

when you say altassian source tree you mean in Jira installtion which is at /opt/atlassian/jira right ??i have been trying to backtrace the xml file but no success yet .. will try harder .. thanks for your help .. any pointer to search the same will be really helpfull. Manish
(2 days ago)
Manish Ranjan
1

no i mean the source code that you can get when you buy a commerical license. You will not find anything in the installed distribution since the gadget.xmls live in JAR files.
(yesterday)
Dieter
1

no i mean the source code that you can get when you buy a commerical license. You will not find anything in the installed distribution since the gadget.xmls live in JAR files.
(yesterday)
Dieter

okay cool .. i do have a commercial license , will look in to that . Thanks for your help
(yesterday)
Manish Ranjan

okay cool .. i do have a commercial license , will look in to that . Thanks for your help
(yesterday)
Manish Ranjan 0

If it's the assigned to me gadget that you want to change the refresh rate, then there is a really simple answer if you also have Confluence. Edit a page, bring up the macro browser & insert the gadget you want. At the bottom should be an option to refresh, set it anything, it doesn't matter. Save.

Then look at the macro that has been created in your page. It should have a refresh parameter. Change this to be your new rate e.g. refresh=1 for every minute. If you put something like refresh=true then it will refresh as fast as it can & will massively increase the load on your jira server.
{gadget:url=http://jira.xxxxxx.com:8080/rest/gadgets/1.0/g/com.atlassian.jira.gadgets:filter-results-gadget/gadgets/filter-results-gadget.xml}filterId=filter-11027&num=10&columnNames=--Default--&isConfigured=true&refresh=1{gadget}

JIRA-abbreviation, not an acronym

2012-03-07T01:43:00.002-08:00

JIRA as known to world as bug, issue and project management for a fair while now – it’s almost industry standard and has an excellent developer community for plugins. I’m forever asked ‘What does JIRA stand for?’

Back in the days when those days when Bugzilla ruled the world and the guys at Atlassian dreamed of building a monster capable of beating it, they realised there was only one option – Godzilla. But calling their wonderful new bug and issue tracking system Godzilla was a bit obvious, so they abbreviated the original Japanese name for Godilla – Gojira. So, Gojira became JIRA: King of the issue management systems.

So when you get asked what does JIRA stands for, just tell them is an abbreviation, not an acronym.

Traffic Solution

2012-01-20T09:23:00.000-08:00

okay

This is a sample image of how a Chauraha looks like and hence i have devided it in four quadrants however as per the requirement it can be subdivided/coagulated .
in center what you see is square a area what we do not want to consider and other than that 1/2/3/4 has sensors which are density measuring sensors
Defn of density is
Density=Weight/SQinch

now what these sensors do is they feed data from the circled area to computers and they let teh network learn about the traffic pattern , on that basis we divide the whole traffc 12 hrs say 8-8 in 12 diff zone with diff color codes and ofcourse diff weight as it will translate in to code

now say at any given time section A has 5 bus section B has 11 Cars C has 2 Bus 3 cars and D has only Bikes
then as per density feeded by the sensors to the Computer the program will be able to decide that its the section one which needs immediate clearance and it will be synchronized with the next stop. with +-2 min this is also a way to let people know that they need to get on to public transport system .

Now this arrangement ill fail if the peopel do not follow traffic rules , yes but that probblem can not be solved unless we hire peopel but hell no , thats not the solution, what we need to do is give the power back to Citizen , if i find a Vehicle offending traffic rule at junction what all i need to do is take a pic of vehicle and send it
the Image sending location in 90% of teh cases will be also the source of problem /Plate no May be .

Then the snapshot of vehicle can be taken by CCTV cameras at those chaurahas and Charge can be directly sent through email/Phone message..

CodeChef/FACTORIAL

2012-01-16T11:55:00.000-08:00

The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone connects to the BTS with the strongest signal (in a little simplified view). Of course, BTSes need some attention and technicians need to check their function periodically.

The technicians faced a very interesting problem recently. Given a set of BTSes to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. Programmers have spent several months studying this problem but with no results. They were unable to find the solution fast enough. After a long time, one of the programmers found this problem in a conference article. Unfortunately, he found that the problem is so called "Traveling Salesman Problem" and it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4....N. The number is very high even for a relatively small N.

The programmers understood they had no chance to solve the problem. But because they have already received the research grant from the government, they needed to continue with their studies and produce at least some results. So they started to study behavior of the factorial function.

For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two numbersN₁<N₂, then Z(N₁) <= Z(N₂). It is because we can never "lose" any trailing zero by multiplying by any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.

Input

There is a single positive integer T on the first line of input (equal to about 100000). It stands for the number of numbers to follow. Then there are T lines, each containing exactly one positive integer numberN, 1 <= N <= 1000000000.

Output

For every number N, output a single line containing the single non-negative integer Z(N).

Example

Sample Input:

Sample Output:

package com.factorial;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

 /**
  * @param args
  */
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  try {
   String temp=br.readLine();
   int noofInp=Integer.parseInt(temp);
   int inputArray[]=new int[noofInp];
   for (int i = 0; i < noofInp; i++) {
    temp=br.readLine();
    inputArray[i]=Integer.parseInt(temp);
   }
   for (int i = 0; i < noofInp; i++) {
//    /System.out.println(inputArray[i]);
    int result=calctrailingZeros(inputArray[i]);
    System.out.println(result);
   }
   
  } catch (IOException e) {
   // TODO Auto-generated catch block
   e.printStackTrace();
  }
  

 }

 private static int calctrailingZeros(int val) {
  // TODO Auto-generated method stub
  int i=1;
  int result=1;
  int ret=0;
  while(result>=1)
  {
   result=(int) (val/Math.pow(5,i));
   i++;
   ret+=result;
  }
  
  return ret;
  
 }

}

CodeSprint/Coin Toss

2012-01-16T11:53:00.001-08:00

/* Enter your code here. Read input from STDIN. Print output to STDOUT */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.text.DecimalFormat;

public class Solution {

public static void main (String args[]) throws IOException
{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
double solutionArray[];
int anArray[] = new int [2] ;
String Delims=" ";
String temp= br.readLine();
int counter= Integer.parseInt(temp);
String[] tempArray= new String[counter];
solutionArray= new double[counter];
for (int i = 0; i < counter; i++) {
tempArray[i]=br.readLine();
}

DecimalFormat df = new DecimalFormat("##.00");
for (int lubaluba=0;lubaluba<counter;lubaluba++)
{
String andrtemp[]=tempArray[lubaluba].split(Delims);
anArray[0]=Integer.parseInt(andrtemp[0]);
anArray[1]=Integer.parseInt(andrtemp[1]);
// System.out.print("Parsed values are"+anArray[0]+"and"+anArray[1]);
if (anArray[0]==(anArray[1])&&(counter==1))
{
String chumma="0.00";
System.out.println(chumma);
System.exit(1);
}
if(anArray[0]>anArray[1])
{
double val1= Math.pow(2, anArray[0]+1);
double val2= Math.pow(2, anArray[1]+1);
double sol=val1-val2;
solutionArray[lubaluba]=sol;
}
else if (anArray[0]==(anArray[1]))
{
double chumma=0;
solutionArray[lubaluba]=chumma;
}

}

for (int i = 0; i < solutionArray.length; i++)
{
if (solutionArray[i]==0)
{
System.out.println("0.00");
}
else
{
System.out.println(df.format(solutionArray[i]));
}
}
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
br.close();
}
}

Interview Street/String Similarity

2012-01-16T11:51:00.001-08:00

/* Enter your code here. Read input from STDIN. Print output to STDOUT */
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Solution {

/**
* @author manish
*/

public static void main(String[] args)
{
int no=0;
String[] baseArray;
int[] total;
try
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
no = Integer.parseInt(br.readLine());
baseArray= new String[no];
total =new int[no];
for (int cnt=0;cnt<baseArray.length;cnt++)
{
baseArray[cnt]= br.readLine();
total[cnt] = baseArray[cnt].length();
}
for(int count = 0;count <baseArray.length;count++)
{
for (int i = 1; i < baseArray[count].length(); i++)
{
String test=baseArray[count].substring(i);
int retVal=maxMatch(test,baseArray[count]);
total[count]= total[count]+retVal;
}
System.out.print(total[count]+"\n");
}
}
catch(Exception e)
{
//System.out.println("Problem");
}
}

private static int maxMatch(String s,String str)
{
// TODO Auto-generated method stub
int counter=0;
char[] main_String = str.toCharArray();
char[] substring = s.toCharArray();
for (int i = 0; i < substring.length; i++) {
if(substring[i]==main_String[i])
{
counter++;
}
else
return counter;
}
return counter;
}
}

String To charArray Java

2011-12-17T20:49:00.001-08:00

package stringReduction;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/*
* author manish
* This program will take a String and Convert to char array
* remove/replace the package name for it to work
* */
public class Solution {
public static void main(String[] args) {
System.out.print("Hello");
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
String inputString=br.readLine();
//System.out.print(inputString);
char[] cArray = inputString.toCharArray();

for (char c : cArray)
System.out.println(c);

} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}

}

}

Extracting File Name , Extension , File Name Without Extension In Shell Script

2011-09-20T00:27:00.001-07:00

First, get file without path:

filename=$(basename $fullfile)
extension=${filename##*.}
filename=${filename%.*}

Compare command in case of linux

2011-06-24T04:39:00.000-07:00

Found this Good article as a part of book Advance Shell Scripting Guide

To compare 2 files, we use the diff command. How do we compare 2 directories? Specifically, we want to know what files/subdirectories are common, what are only in 1 directory but not the other.

Unix old-timers may remember the dircmp command. Alas, that command is not available in Linux. In Linux, we use the same diff command to compare directories as well as files.

$ diff  ~peter ~george
Only in /home/peter: announce.doc
diff /home/peter/.bashrc /home/george/.bashrc
76,83d72
<
< # Customization by Peter
< export LESS=-m
< export GREP_OPTIONS='--color=always'
< shopt -s histappend
< shopt -s cmdhist
< export PROMPT_COMMAND="history -a;$PROMPT_COMMAND"
< #echo keycode 58 = Escape |loadkeys -
Only in /home/george: .mcoprc
Only in /home/peter: .metacity
Only in /home/george: .newsticker-images
Only in /home/peter: .notifier.conf
Only in /home/george: targets.txt
Only in /home/peter: .xsession-errors

Without any option, diffing 2 directories will tell you which files only exist in 1 directory and not the other, and which are common files. Files that are common in both directories (e.g., .bashrc in the above listing) are diffed to see if and how the file contents differ.

If you are NOT interested in file differences, just add the -q (or--brief) option.

diff -q ~peter ~george  |sort
Files /home/peter/.bashrc and /home/george/.bashrc differ
Only in /home/george: .mcoprc
Only in /home/george: .newsticker-images
Only in /home/george: targets.txt
Only in /home/peter: .metacity
Only in /home/peter: .notifier.conf
Only in /home/peter: .xsession-errors
Only in /home/peter: announce.doc

diff orders its output alphabetically by file/subdirectory name. I prefer to group them by whether they are common, and whether they only exist
in the first or second directory. That is why I piped the output of diff through sort in the above command.

Note that by default diff does not reach into the subdirectories to compare the files and subdirectories at that level. To change its behavior to recursively go down subdirectories, add-r.

diff -qr ~peter ~george  |sort

Usefull copy commands in Linux

2011-06-23T23:36:00.000-07:00

To make a copy of a file in the current directory, enter:
$ cp file.doc file.doc.bak

To copy a file in your current directory into another directory, enter:

$ cp filename /tmp

$ ls /tmp/filename

$ cd /tmp

$ ls

$ rm filename

To copy a file to a new file and preserve the modification date, time, and access control list associated with the source file, enter:
$ cp -p filename /path/to/new/location/myfile

To copy all the files in a directory to a new directory, enter:
$ cp * /home/tom/backup

To copy a directory, including all its files and subdirectories, to another directory, enter (copy directories recursively):
$ cp -R * /home/tom/backup

Script to compare and Print Difference between two Directories recursively

2011-06-23T23:24:00.000-07:00

#!/bin/bash

# cmp_dir - program to compare two directories and subDirectiories
# Manish
#Please remove Echo statements i had added them for debugging
# this is the Function part of it
# Expects two argument as Source directory and target Directory now bachalo is folder which does not exhist in destination
# so it says folder does not exhist - just copy but test is in source and dest so it gets in to that
#**********************************

searchF()
{
file=$1
args=$2
#echo "in function Search"
# Process each file in directory_1, comparing it to directory_2

for filename in $file/*; do
fn=$(basename "$filename")
arg="$args/$fn"

#echo "Hellooooo"$fn

if [ -f "$filename" ]; then # Checking the File and Comparing the Diff
if [ ! -f "$arg" ]; then
echo "$fn is missing from $arg"
let "missing+=1"
#sleep 1
#echo $missing "is the current missing count"
fi
elif [ -d "$filename" ]; then # i need to make it recursive here for directories inside-- i think
#echo "HelloBidu"$filename
arg= "$2/$fn"
let "missing+=1"
#sleep 1
#echo $missing "is the current missing count"
searchF $filename $arg #recusrion
fi
done

}
#****************************
# Main Block Starts Here
# Check for required arguments

missing=0
[ $# -ne 2 ] && echo "usage: $0 directory_1 directory_2" 1>&2 &&
echo "usage: $0 directory_1 directory_2" 1>&2

fi

# Make sure both arguments are directories
if [ ! -d $1 ]; then
echo "$1 is not a directory!" 1>&2
exit 1
fi

if [ ! -d $2 ]; then
echo "$2 is not a directory!" 1>&2
exit 1
fi

#function call
searchF $1 $2
echo "$missing files missing"

CHM reader on linux UBUNTU

2011-06-19T21:29:00.001-07:00

Need Internet Service on your system

Type this sudo apt-get install xchm
and it shoudl do the rest
Happy Reading :)