<!Doctype HTML>
<html>
<head>
<script src="http://ajax.googleapis.com/ajax/libs/jquery/1.11.2/jquery.min.js"></script>
<script>
/*works when page loading complete, this is important
because you want your divs' match height from the beginning.*/
$(document).ready(function(){
//alert("ready");
changeDivHeight();
});
/*whenever browser window size changes, this function is being called
and it fixed div height.*/
$(window).resize(function(){
//alert("resize");
changeDivHeight();
});
/*here we place our logic
we take each sizes, compares which one is largest and then
set other's height.*/
function changeDivHeight() {
// .innerHeight() returns height of an element
var a = $("#div_a").innerHeight();
var b = $("#div_b").innerHeight();
//alert(a + " " + b);
// .height() sets height of an element
// we can pass an integer value, which will be converted into px
// otherwise we can pass a string, mentioning the unit such as px or in or cm or dp
if( a > b ) {
$("#div_b").height( a );
} else {
$("#div_a").height( b );
}
}
</script>
</head>
<body width="75%" align="center">
<div id="div_a" style="border: 1px solid red; float: left; width: 30%;">
<p>hello div A hello div A hello div A hello div A hello div A hello div A.<br>div A has large height. Will div B be able to achieve same height??</p>
</div>
<div id="div_b" style="border: 1px solid green; float: left; width: 30%">
<p>hello div B<p/>
</div>
</body>
</html>
fdisk -lThis command gives a list of devices currently connected. Prompting this command at my terminal gives output:
Disk /dev/sda: 500.1 GB, 500107862016 bytes 255 heads, 63 sectors/track, 60801 cylinders, total 976773168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0xfa61dadb Device Boot Start End Blocks Id System /dev/sda1 * 376006656 976773119 300383232 7 HPFS/NTFS/exFAT /dev/sda2 2046 376006655 188002305 5 Extended Partition 2 does not start on physical sector boundary. /dev/sda5 2048 360380415 180189184 83 Linux /dev/sda6 360382464 376006655 7812096 82 Linux swap / Solaris Partition table entries are not in disk orderSuppose we are going to mount /dev/sda1.
mkdir -p /media/Partition
sudo mount -t ntfs -o nls=utf8,umask=000 /dev/sda1 /media/PartitionWe are mounting ntfs type partition or device, full list of supported type can be found at manual page of "mount" command. Umask = 000 means it allows read, write and execute permission for all (security risk).
powercfg /h off
diskpart list disk select disk * clean convert gpt exitWell, windows was installed. Finally, I installed Ubuntu by formatting unallocated spaces. Installation Finish! Restart!! Windows Boot!!!
sudo add-apt-repository ppa:yannubuntu/boot-repair && sudo apt-get update sudo apt-get install -y boot-repair sudo boot-repairAt last... Got my dual boot system with Ubuntu 12.04.2 and Windows 8. Decided to use Ubuntu as primary and Windows as supporting OS.
initial
|
1
|
-2
|
4
|
-3
|
-1
| |
mp
|
inf
|
1
|
inf
|
4
|
24
|
12
|
mn
|
inf
|
inf
|
-2
|
-8
|
-12
|
-24
|
mxProduct
|
-1
|
1
|
1
|
4
|
24
|
24
|
// Maximum Interval Product
// Complexity: O(n)
long long mxProduct = -1;
// maximum product is stored. if unchanged, no valid product.
long long t1, t2;
long long mp = INF, mn = INF;
// two counters for maxPositiveProduct and maxNegativeProduct
for( i=0; i<N; i++ ) {
scanf( "%d", &arr[i] );
if( arr[i] == 0 ) {
if( mp != INF ) mxProduct = MAX( mxProduct, mp );
mp = mn = INF;
continue;
}
if( mp==INF && mn==INF ) {
arr[i] > 0 ? mp = arr[i] : mn = arr[i];
if( mp != INF ) mxProduct = MAX( mxProduct, mp );
continue;
}
if( mp == INF ) {
if( arr[i] > 0 ) {
mp = arr[i];
mn = arr[i] * mn;
mxProduct = MAX( mxProduct, mp );
continue;
}
if( arr[i] < 0 ) {
mp = arr[i] * mn;
if( arr[i] >= mn ) mn = arr[i];
else mn = INF;
mxProduct = MAX( mxProduct, mp );
continue;
}
}
if( mn == INF ) {
if( arr[i] < 0 ) {
mn = arr[i] * mp;
mp = INF;
continue;
}
if( arr[i] > 0 ) {
mp = arr[i] * mp;
mn = INF;
mxProduct = MAX( mxProduct, mp );
continue;
}
}
t1 = arr[i] * mp;
t2 = arr[i] * mn;
if( arr[i] > 0 ) mp = t1, mn = t2;
if( arr[i] < 0 ) mp = t2, mn = t1;
mxProduct = MAX( mxProduct, mp );
}
/*
Task: Life, the Universe, and Everything (SPOJ)
Code: TEST
*/
import java.io.*; // java input\output library
import java.util.*; // using for Scanner class
class LifeSPOJ {
public static void main ( String [] args ) {
Scanner ss = new Scanner(System.in);
int num;
num = ss.nextInt(); // nest intejar
while( num != 42 ) {
System.out.println( num ); // printing that number
num = ss.nextInt();
}
}
}
#include <iostream>
#include <string>
using namespace std;
template<class T>inline T MAX( T a, T b ){ return a>b ? a:b; } // Note: returns maximum of a and b
string A;
int LPS( int i, int j ) {
if( i == j ) return 1; // A[i] & A[j] are same, cost is 1
if( i > j ) return 0;
if( A[i] == A[j] )
return 2 + LPS( i+1, j-1 ); // A[i] & A[j] are different, cost is 2, 1 for each.
else
return MAX( LPS(i+1, j), LPS(i, j-1) );
}
int main( ){
while( cin >> A ){
int len = A.length( );
int res = LPS(0, len);
cout << "Longest Palindromic Subsequence is: " << res << endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
template<class T>inline T MAX( T a, T b ){ return a>b ? a:b; } // Note: returns maximum of a and b
const int SIZ = 105;
#define mset2d(x,n) memset(x,n,sizeof(int [SIZ][SIZ]))
string A;
int memo[SIZ][SIZ];
int LPS( int i, int j ) {
if( i == j ) return 1; // A[i] & A[j] are same, cost is 1
if( i > j ) return 0;
if( memo[i][j] != -1 ) return memo[i][j];
if( A[i] == A[j] )
memo[i][j] = 2 + LPS( i+1, j-1 ); // A[i] & A[j] are different, cost is 2, 1 for each.
else
memo[i][j] = MAX( LPS(i+1, j), LPS(i, j-1) );
return memo[i][j];
}
int main( ){
while( cin >> A ){
mset2d( memo, -1 );
int len = A.length( );
int res = LPS(0, len);
cout << "Longest Palindromic Subsequence is: " << res << endl;
}
return 0;
}