Go to the following website and send free sms to anyone.
Friday, December 31, 2010
Check Your Mobile Quality
Would you like to know your mobile is original or not?!!
press *#06# on your mobile.
After you enter the code you will see a new code contain 15 digits:
e.g.
434566106789435
IF the digit number Seven & Eight is 02 or 20 that mean it was Assembly on Emirates which is very Bad quality.
IF the digit number Seven & Eight is 08 or 80 that mean it was manufactured in Germany which is not bad.
IF the digit number Seven & Eight is 01 or 10 that mean it was manufactured in Finland which is Good.
IF the digit number Seven & Eight is 00 that mean it was manufactured in original factory which is the best Mobile Quality.
IF the digit number Seven & Eight is 13 that mean it was Assembly on Azerbaijan which is very Bad quality and very dangerous for health!!!
press *#06# on your mobile.
After you enter the code you will see a new code contain 15 digits:
e.g.
434566106789435
IF the digit number Seven & Eight is 02 or 20 that mean it was Assembly on Emirates which is very Bad quality.
IF the digit number Seven & Eight is 08 or 80 that mean it was manufactured in Germany which is not bad.
IF the digit number Seven & Eight is 01 or 10 that mean it was manufactured in Finland which is Good.
IF the digit number Seven & Eight is 00 that mean it was manufactured in original factory which is the best Mobile Quality.
IF the digit number Seven & Eight is 13 that mean it was Assembly on Azerbaijan which is very Bad quality and very dangerous for health!!!
Thursday, December 30, 2010
A Very Useful Website
Hey there. I just wanted to tell you a good site for downloading games,music, software, ebook, movies, etc n etc.
http://katz.cd/
http://katz.cd/
Sunday, December 26, 2010
Offline w3school
At w3schools.com you will learn how to make a website. They offer free tutorials in all web development technologies. In-spite of learning online I am giving you a download link to learn everything from w3school being offline (no internet connection needed). Just download the attachment.
Assembly Language Tutorial
A very useful tutorial on assembly language which I had found on a forum. This is actually made by Arko.
Tuesday, December 21, 2010
UVA Problem#541
Question:
Solution:
char mat[105][105];
int N;
int row() {
int i,j,sum,c,save;
sum = 0;
c = 0;
for(i = 0; i<N; i ++) {
sum = 0;
for(j = 0; j<N; j ++)
sum += mat[i][j];
UVA Problem#530
Question:
Solution:
double nCr(int n,int m){
int k;
register int i,j;
double c,d;
c=d=1;
k=(m>(n-m))?m:(n-m);
for(j=1,i=k+1;(i<=n);i++,j++){
c*=i;
d*=j;
if( !fmod(c,d) && (d!=1) ){
c/=d;
d=1;
}
}
return c;
}
int k;
register int i,j;
double c,d;
c=d=1;
k=(m>(n-m))?m:(n-m);
for(j=1,i=k+1;(i<=n);i++,j++){
c*=i;
d*=j;
if( !fmod(c,d) && (d!=1) ){
c/=d;
d=1;
}
}
return c;
}
int main(){
....
....
....
}
UVA Problem#495
Question:
Solution:
#include<iostream.h>
#include<string.h>
int main(){
char *fibo[5001]={0};
fibo[0]="0";
fibo[1]="1";
int l1=strlen(fibo[0]);
int l2=strlen(fibo[1]);
int l;
for(long i=2;i<=5000;i++){
#include<string.h>
int main(){
char *fibo[5001]={0};
fibo[0]="0";
fibo[1]="1";
int l1=strlen(fibo[0]);
int l2=strlen(fibo[1]);
int l;
for(long i=2;i<=5000;i++){
UVA Problem#483
Question:
Solution:
int main(){
string line;
while(getline (cin,line)) {
int t = line.size();
int count;
string sub;
for(int i=0;i<t;i++){
count=0;
if(line[i]!=' '){
while(line[i+count]!=' ' && i+count<t){
count++;
}
for(int j=(i+count)-1;i<=j && j<t;j--){
cout<<line[j];
}
i+=count-1;
}else{
cout<<line[i];
}
}
cout<<endl;
}
return 0;
}
string line;
while(getline (cin,line)) {
int t = line.size();
int count;
string sub;
for(int i=0;i<t;i++){
count=0;
if(line[i]!=' '){
while(line[i+count]!=' ' && i+count<t){
count++;
}
for(int j=(i+count)-1;i<=j && j<t;j--){
cout<<line[j];
}
i+=count-1;
}else{
cout<<line[i];
}
}
cout<<endl;
}
return 0;
}
UVA Problem#412
Question:
Solution:
int gcd(int a,int b) { return b ? gcd(b,a%b) : a; }
int count() {
int i,j;
k = 0;
for(i = 0; i<N-1; i ++)
for(j = i+1; j<N; j ++)
if(gcd(a[i],a[j]) == 1)
k ++;
return 0;
}
int calculate() {
int pair;
double pi,x,y;
if( !k ) { printf("No estimate for this data set.\n"); return 0; }
pair = (N * (N-1)) / 2;
x = pair;
y = k;
pi = sqrt(( x * 6) / y);
printf("%.6lf\n",pi);
return 0;
}
int main(){
.......
......
}
UVA Problem#190
Question:
Solution:
1. take x1, y1, x2, y2, x3 and y3 as input.
2. calculate m1 and m2. m1= (y2-y1)/(x2-x1); m2= (y3-y1)/(x3-x1);
3. for different condition (values) of m1 and m2 the formula to find h and k (circles center) will be different.
4. Formulas of h and k on different conditions
(i) m2=0; k=(x2-x3)/m1/2+(y1+y2)/2; h=(x1+x3)/2;
(ii) m1=0; k=(x3-x2)/m2/2+(y1+y3)/2; h=(x1+x2)/2;
(iii) m1!=0 and m2!=0; h=((x1+x2)/m1-(x1+x3)/m2+y2-y3)/2/(1/m1 - 1/m2);
(ii) m1=0; k=(x3-x2)/m2/2+(y1+y3)/2; h=(x1+x2)/2;
(iii) m1!=0 and m2!=0; h=((x1+x2)/m1-(x1+x3)/m2+y2-y3)/2/(1/m1 - 1/m2);
k=( h-(x1+x2)/2)/(-m1)+(y1+y2)/2;
Saturday, December 18, 2010
Secrets of NOKIA Mobile
On the main screen type
*#06# for checking the IMEI (International Mobile Equipment Identity).
*#7780# reset to factory settings.
*#67705646# This will clear the LCD display (operator logo).
*#0000# To view software version.
*#2820# Bluetooth device address.
*#746025625# Sim clock allowed status.
*#62209526# - Display the MAC address of the WLAN adapter. This is available only in the newer devices that support WLAN
#pw+1234567890+1# Shows if sim have restrictions.
3 Amazing Firefox Hack
1.Save Session For All Tabs Opened In Multiple Firefox Windows:
If you are an ardent user of Firefox then you may be aware that when more than one Firefox windows are opened up, in that case when you close a Firefox window, it does ask me the option to save the session and exit, rather it ask to close all the tabs in that Firefox window, but it won’t save the tabs in other windows. So this way you could not save the session for multiple tabs opened in multiple Firefox windows.
In such a case, there is only one option left to save the session
Remove Virus From USB
One of the ways by which a virus can infect your PC is through USB/Pen drives. Common viruses such as ’Ravmon’ , ‘New Folder.exe’, ‘Orkut is banned’ etc are spreading through USB drives. Most anti-virus programs are unable to detect them and even if they do, in most cases they are unable to delete the file, only quarantine it. Here are the things which you can do if you want to remove such viruses from your USB Drive
Whenever you plug a USB drive in your system, a window will appears
Tuesday, November 30, 2010
UVA Problem#10424
Question:
http://uva.onlinejudge.org/external/104/10424.html
Solution:
1. Take 2 strings input. adjust the values of each character according to the problem describes. (here it was stored in ans1 and ans2 variables)
2. Then make the sum of these numbers until it comes in one digit. (here it is done in temp1 and temp2 variables)
3. Answer the value of the two ratio in percentage for the larger value of temp1 and temp2.
http://uva.onlinejudge.org/external/104/10424.html
Solution:
1. Take 2 strings input. adjust the values of each character according to the problem describes. (here it was stored in ans1 and ans2 variables)
2. Then make the sum of these numbers until it comes in one digit. (here it is done in temp1 and temp2 variables)
3. Answer the value of the two ratio in percentage for the larger value of temp1 and temp2.
UVA Problem#10347
Question:
Solution:
It's a bit tricky to derive the formula for this problem. Basically, you can prove that the area of the triangle formed by the medians is 3/4 of the area of the original triangle. Then, you can use Heron's formula to get the area of the median triangle, and multiply by 4/3. So in all:
A = (4/3) * sqrt(s(s-m1)(s-m2)(s-m3))
Where m1, m2, and m3 are the median lengths, and s is the semiperimeter of the median triangle:
s = (m1 + m2 + m3) / 2
There are some tricky things to watch out for:
A = (4/3) * sqrt(s(s-m1)(s-m2)(s-m3))
Where m1, m2, and m3 are the median lengths, and s is the semiperimeter of the median triangle:
s = (m1 + m2 + m3) / 2
There are some tricky things to watch out for:
UVA Problem#11727
Question:
Solution:
1. Take an integer input indicating the number of test case. (say t)
2. Take 3 integers input in an array and sort them using the built in function sort().
3. Print the 2nd value from the array.
UVA Problem#10346
Question:
http://uva.onlinejudge.org/external/103/10346.html
Solution:
Find the pattern and derive the following formula (total_cigar and butt initally set to 0) and simply simulate the process...
while (n > 0) {
total_cigar += n; /* accumulate all new cigars so far */
butt += n; /* after Peter smokes these n cigar, we have n butts */
n = butt / k; /* so these n butts become new cigars */
butt %= k; /* butts left are reserved for future cigars */
}
Source: http://www.comp.nus.edu.sg/~stevenha/programming/acmoj.html
int main(){
....
....
sum = n, x = n;
while(x >= k)
sum += (x / k), x = (x / k) + (x % k);
....
.....
}
http://uva.onlinejudge.org/external/103/10346.html
Solution:
Find the pattern and derive the following formula (total_cigar and butt initally set to 0) and simply simulate the process...
while (n > 0) {
total_cigar += n; /* accumulate all new cigars so far */
butt += n; /* after Peter smokes these n cigar, we have n butts */
n = butt / k; /* so these n butts become new cigars */
butt %= k; /* butts left are reserved for future cigars */
}
Source: http://www.comp.nus.edu.sg/~stevenha/programming/acmoj.html
int main(){
....
....
sum = n, x = n;
while(x >= k)
sum += (x / k), x = (x / k) + (x % k);
....
.....
}
UVA Problem#11764
Question:
Solution:
1. Take an integer input indating the test cases (say t). For each case take another integer input indicating the number of pillars (say n). Then take input of those pillars in an array (say a[ ] )
2. Just check for two conditions, whether a[j+1] > a[ j] or a[ j+1] < a [ j]
int main(){
....
....
...
for(j=0; j<n-1; j++){
if(a[j+1] > a[j])
hj++;
else if(a[j+1]< a[j])
lj++;
}
if(a[j+1] > a[j])
hj++;
else if(a[j+1]< a[j])
lj++;
}
....
.....
}
UVA Problem#900
Question:
Solution:
1. if the length is 1 output will be 1, if the length is 2 out put will be 2, if the length is 3 output will be 3, if the length is 4 output will be 5. Doesn't the output series look familiar to you? 1 2 3 5 ...... Ya right! Its a Fibonacci series!
2. You can have the first 50 Fibonacci numbers in an array and then just print the answer according to the input.
int main(){
int fib[ ] = {1,2,3,5,8,13,21,. .. . . .. . .. ,7778742049, 12586269025};
int n;
while(1){
scanf("%d", &n);
if(n==0)
break;
printf("%d\n", fib[n-1] );
}
return 0;
}
Thursday, October 21, 2010
Tuesday, October 19, 2010
Turbo C for Windows 7 OS
Use Turbo C in Windows 7 operating system. Full 16 bit graphics of GNU C environment can be used.
click here to download
for further query you can check the following links:
http://sawaal.ibibo.com/computers-and-technology/how-use-dosbox-072-running-turbo-c-fullscreen-mode-699261.html
http://techtricks.co.in/programming/run-turbo-c-in-windows-vista
http://amitbpit.blogspot.com/2010/01/how-to-run-turbo-cc-or-16-bit-cc-in.html
click here to download
for further query you can check the following links:
http://sawaal.ibibo.com/computers-and-technology/how-use-dosbox-072-running-turbo-c-fullscreen-mode-699261.html
http://techtricks.co.in/programming/run-turbo-c-in-windows-vista
http://amitbpit.blogspot.com/2010/01/how-to-run-turbo-cc-or-16-bit-cc-in.html
Monday, March 1, 2010
Sunday, February 28, 2010
Zope Web Application Construction Kit by Martina Brockmann , K. Kirchner , Mark Pratt , Sebastian Lühnsdorf
Zope Web Application Construction Kit by Martina Brockmann , K. Kirchner , Mark Pratt , Sebastian Lühnsdorf
click here to download
click here to download
Web Development with JavaServer Pages SECOND EDITION by DUANE K. FIELDS, MARK A. KOLB, SHAWN BAYERN
Web Development with JavaServer Pages SECOND EDITION by DUANE K. FIELDS, MARK A. KOLB, SHAWN BAYERN
click here to download
click here to download
Professional PHP Programming by Jesus Castagnetto, Harish Rawat, Sascha Schumann, Chris Scollo, Deepak Veliath, Wrox
Professional PHP Programming by Jesus Castagnetto, Harish Rawat, Sascha Schumann, Chris Scollo, Deepak Veliath, Wrox
click here to download
click here to download
Saturday, February 27, 2010
Friday, February 26, 2010
Mastering Dreamweaver MX Database by Susan, Sales Harkins, Bryan, Chamberlain and Darren McGee
Mastering Dreamweaver MX Database by Susan, Sales Harkins, Bryan, Chamberlain and Darren McGee
click here to download
click here to download
Beginning PHP4 by Wankyu Cho,i Allan Kent, Chris Lea, Ganesh Prasad, Chris Ullman and Jon Blank
Beginning PHP4 by Wankyu Cho,i Allan Kent, Chris Lea, Ganesh Prasad, Chris Ullman and Jon Blank
click here to download
click here to download
Open Source Web Development with LAMP: Using Linux, Apache, MySQL, Perl, and PHP by James Lee and Brent Ware
Open Source Web Development with LAMP: Using Linux, Apache, MySQL, Perl, and PHP by James Lee and Brent Ware
click here to download
click here to download
Thursday, February 25, 2010
Saturday, January 23, 2010
Tuesday, January 19, 2010
Falling Egg
the egg will fall and you will have to catch them. The source code is given here.
click here to download
click here to download
Falling Egg
the egg will fall and you will have to catch them. The source code is given here.
click here to download
click here to download
Subscribe to:
Posts (Atom)