answer Double Squares Answer to the 1st question- Double Squares - Using Javascript

Answer to the 1st question- Double Squares - Using Javascript

  • Server
  • Saturday, January 8, 2011
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
       "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta http-equiv="Content-Script-Type" content="text/javascript">

<meta name="description" content="sum of squares script">
<meta name="keywords" lang="en" content="sum,squares">
<title>Sum of two squares - script</title>
<script>
<!--
rmin=""; // valeurs par defaut
rvmin=0;
disp=0;   // flag affiche les facteurs complexes
msg="";   // resultat

ex=new Array(); // exposants
uv=new Array(); // facteurs complexes
er=new Array(); // exposants courants pour back-track
me=new Array(); // exposant max pour filtrage
nui=0; // nbre de facteurs complexes d'exposant impair
dp=1; // produit des (exposants+1) d… Shopee photos :
answer Studious Student Answer to the 3rd Question: Studious Student - Using PHP

Answer to the 3rd Question: Studious Student - Using PHP

<?php

$r_l[]="joicfs joi xul nzndjoi nzndjoijoi nznd nzndjoijoi ssre cfs";
$r_l[]="nnozzwtf ahkjj wtp t sj htawm ihw egzinwju vn";
$r_l[]="z dvqgfh wqx vnajabkqvs sdwkc dlhcnc ezrcvsc teje gzwwj";
$r_l[]="dcn csmzj krnc vkcoume wvpva yqoexwujwp v cxepgptf xb";
$r_l[]="jibw ji jp bw jibw";
$r_l[]="izqht h qpbdayaifl pjsoie sujccnm umj dralemrspo euswuti m";
$r_l[]="u ufmu ufmuqfy vmc ufm uqfy z vmcu qfy";
$r_l[]="ksdzsjz bbio ja mvvyxzkmq zgdvxolmt xgvwdbfqzn rhubnqtaad qa eeb";
$r_l[]="r wwwr ndtc ndtclp lpb b wwwb www lp";
$r_l[]="eavcqvv wyuh mkfq not evhlpur eidqnartht pesgphnnlq t ztvu";
$r_l[]="rgh woqg dmabatgbt qrvpcrx eluunoi sy w wnthqxgkg aimallazuc";
$r_l[]="myrzwdyhv pojiires fbjbkcbtq pzdfuxfh rq ukbom ypkffomyl tdko zbwqkbuu";
$r_l[]="k duz q rc lvraw";
$r_l[]="i hsmh hsmheh xgi eh xg xgeh xnfc ihsmh";
$r_l[]="wehfri kclm ri … Shopee photos :
Problems Problem No. 1 Double Squares

Problem No. 1 Double Squares

Double Squares A double-square number is an integer X which can be expressed as the sum of two perfect squares. For example, 10 is a double-square because 10 = 32 + 12. Your task in this problem is, given X, determine the number of ways in which it can be written as the sum of two squares. For example, 10 can only be written as 32 + 12 (we don't count 12 + 32 as being different). On the other hand, 25 can be written as 52 + 02 or as 42 + 32.

InputYou should first read an integer N, the number of test cases. The next N lines will contain N values of X. Constraints0 ≤ X ≤ 2147483647 OutputFor each value of X, you should output the number of ways to write X as the sum of two squares.  Example input  5
5 4 0 1 2 2
3 4 1 1 1 0
3 3 1 2 1 1 1 0
3 4 0 2 1 0 1 1
3 4 0 1 1 1 Example output  0 0.375000
1 0.500000
1 1.000000
0 1.000000
0 0.500000 Shopee photos :
peg game Problems Problems No 2. Peg Game

Problems No 2. Peg Game

Peg Game At the arcade, you can play a simple game where a ball is dropped into the top of the game, from a position of your choosing. There are a number of pegs that the ball will bounce off of as it drops through the game. Whenever the ball hits a peg, it will bounce to the left with probability 0.5 and to the right with probability 0.5. The one exception to this is when it hits a peg on the far left or right side, in which case it always bounces towards the middle.

When the game was first made, the pegs where arranged in a regular grid. However, it's an old game, and now some of the pegs are missing. Your goal in the game is to get the ball to fall out of the bottom of the game in a specific location. Your task is, given the arrangement of the game, to determine the optimal place to drop the ball, such that the probability of getting it to this specific location is maximized.

The image below shows an example of a game with five rows of five columns. Notice that the top row … Shopee photos :
Problems Question Studious Student Problems No 3. Studious Student

Problems No 3. Studious Student

Studious Student You've been given a list of words to study and memorize. Being a diligent student of language and the arts, you've decided to not study them at all and instead make up pointless games based on them. One game you've come up with is to see how you can concatenate the words to generate the lexicographically lowest possible string.

InputAs input for playing this game you will receive a text file containing an integer N, the number of word sets you need to play your game against. This will be followed by N word sets, each starting with an integer M, the number of words in the set, followed by M words. All tokens in the input will be separated by some whitespace and, aside from N and M, will consist entirely of lowercase letters.

OutputYour submission should contain the lexicographically shortest strings for each corresponding word set, one per line and in order.

Constraints1 <= N <= 100
1 <= M <= 9
1 <= all word lengths <= 10


EXAMPLE … Shopee photos :
Problems Qualification Round Question Time Facebook Hacker Cup 2011 Qualification Rounds Problems

Facebook Hacker Cup 2011 Qualification Rounds Problems

  • Server
  • Friday, January 7, 2011
Facebook Hacker Cup 2011 Qualification Rounds Problems

Competitors can log in to the competition website and attempt to solve the 3 problems anytime during the 72-hour period of the Qualification Round.

So, it will be a competition website is setup somewhere...
There will be 3 (three) question given.
Time available to solve those three question is just 72-hour. Shopee photos :