Send to me too. Please. rgap...@gmail.com
2011/4/18 Abhishek Goswami
> I think we can share into email...that will not be any issue. :)
>
>
>
> On Mon, Apr 18, 2011 at 10:07 PM, Abhishek Goswami > wrote:
>
>> can u please me also .. zeal_gosw...@yahoo.com
>>
>>
>> On Thu, Apr 14, 2011 a
thing to do with complexity...
>> just the ans
>>
>>
>> On Fri, Feb 25, 2011 at 10:23 PM, Rel Guzman Apaza wrote:
>>
>>> Is there a maximum time complexity?
>>>
>>> 2011/2/25 vaibhav shukla
>>>
>>>> Find the sum of digits
Is there a maximum time complexity?
2011/2/25 vaibhav shukla
> Find the sum of digits of all the numbers whose digits are all in ascending
> order from left to right. All these numbers lie between 500 to 1000 and
> satisfy M divides (M-1)* !* + 1 , where M is any natural number.
> (* " ! " * den
I did it.
#include
#include
using namespace std;
int main(){
int n,ac,k,sum;
while(cin>>n && n){
ac=0;
k=ceil((sqrt(1+8*n)-1)/2)-1;
ac+=k*(k+1)*(2*k+1)/6;
sum=(k+1)*(k+2)/2;
ac+=(k+1)*((k+1)-(sum-n));
cout<
> Let f(n) = n(n+1)/2
> We have
Nothing... 10 in base 5 = 5 in base 10.
void change(){
printf(""); //...?
}
2011/2/15 Don
> A semicolon is valid in the middle of a line in C or C++.
>
> For instance, no one says that
>
> for(i = 0; i < 10; ++i)
>
> is three lines of code.
>
> Don
>
> On Feb 15, 11:31 am, jalaj jaiswal
maybe using a circular linked list.
2011/2/9 punnu
> Suppose n people are arranged in a circle. Number the people from 1 to
> n. in the clockwise order. We are given an integer ,m <= n. Beginning
> with the person with designated number 1, we proceed around the circle
> (in clockwise order) remo
I think the only solution will be finding all subsets.
2011/2/9 MONSIEUR
> @jalaj: text missing.??? I think i've mentioned question
> properly.is there any thing more u require?
>
> n Feb 9, 9:45 pm, jalaj jaiswal wrote:
> > @monsieur ... text missing dude
> >
> >
> >
> > On Wed, Feb 9,
Yeah, but how the correctness?
2011/1/16 juver++
> This algorithm can be found on the TopCoder tutorials.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscr
