the volumn of 2 cones can be calculated by this formula..
1/3 * pi * r * r * h
r of the circle of its bottom
h is the height of the cone
Search found 23 matches
- Sun Jul 17, 2005 5:07 am
- Forum: Volume 102 (10200-10299)
- Topic: 10297 - Beavergnaw
- Replies: 13
- Views: 7277
- Fri Oct 08, 2004 8:17 am
- Forum: Volume 107 (10700-10799)
- Topic: 10703 - Free spots
- Replies: 26
- Views: 9710
- Wed Oct 06, 2004 9:26 am
- Forum: Volume 107 (10700-10799)
- Topic: 10720 - Graph Construction
- Replies: 49
- Views: 31681
- Fri Jul 16, 2004 4:13 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10484 - Divisibility of Factors
- Replies: 39
- Views: 19915
- Sun Jul 11, 2004 8:24 am
- Forum: Volume 102 (10200-10299)
- Topic: 10245 - The Closest Pair Problem
- Replies: 92
- Views: 14536
- Sat Jul 10, 2004 2:41 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10487 - Closest Sums
- Replies: 89
- Views: 32149
- Sun Jul 04, 2004 6:57 am
- Forum: Volume 5 (500-599)
- Topic: 530 - Binomial Showdown
- Replies: 137
- Views: 37078
- Sat Jul 03, 2004 12:31 pm
- Forum: Volume 5 (500-599)
- Topic: 530 - Binomial Showdown
- Replies: 137
- Views: 37078
- Sat Jul 03, 2004 12:30 pm
- Forum: Volume 5 (500-599)
- Topic: 530 - Binomial Showdown
- Replies: 137
- Views: 37078
- Mon Mar 01, 2004 12:29 pm
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 32596
Why #195 is WA :~~~
Plz help :~~~ [c]#include <stdio.h> #include <string.h> #include <stdlib.h> #define NN 1000 int len, x; char ans[NN]; struct set { char ch; int fre; }data[NN]; void visit(int n) { int i; if (n<len) { for (i=0;i<x;i++) if (data .fre) { ans[n] = data .ch; data .fre--; visit(n+1); data .fre++; } } else...
- Thu Feb 05, 2004 5:25 am
- Forum: Volume 105 (10500-10599)
- Topic: 10530 - Guessing Game
- Replies: 57
- Views: 29498
- Tue Feb 03, 2004 6:53 am
- Forum: Volume 7 (700-799)
- Topic: 713 - Adding Reversed Numbers
- Replies: 142
- Views: 44174
Input:
Output:
Code: Select all
13245 4678746
100032 00018678
123 787951
Code: Select all
5992356
10011978
801061
- Tue Feb 03, 2004 6:37 am
- Forum: Volume 1 (100-199)
- Topic: 160 - Factors and Factorials
- Replies: 205
- Views: 29465
why it gets wa ? plz.. [c]#include <stdio.h> #include <math.h> int prime[40]; int is_prime(int n) { int i; for (i=0;prime *prime <=n;i++) if (!(n%prime )) return 0; return 1; } void make_table(void) { int i, index = 1; prime[0] = 2; for (i=3;i<=150;i+=2) if (is_prime(i)) prime[index++] = i; } int ma...
- Tue Feb 03, 2004 5:07 am
- Forum: Volume 2 (200-299)
- Topic: 263 - Number Chains
- Replies: 45
- Views: 9090
#263 .. plz help :~~~
Why it's output limit exceed :~~~ if n=0, it'll break..>< help me, plz... [c]#include <stdio.h> #include <stdlib.h> int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; } int rev(int n) { int m; for (m=0;n;n/=10) { m*=10; m+=n%10; } return m; } int sort(int n) { int d[10], i, m; fo...
- Sun Feb 01, 2004 8:57 am
- Forum: Volume 6 (600-699)
- Topic: 623 - 500!
- Replies: 187
- Views: 49148
623
Sorry, I'm so stupid......||||
0! = 1 ...>"<
0! = 1 ...>"<