Search found 4 matches

by dipal
Mon Jun 15, 2009 8:53 am
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 21592

Re: 10006 - Carmichael Numbers

Please don't abbreviate English words, it's just rude!

sorry for it.

actually i used scanf/printf .
thnx for reply.
by dipal
Tue Jun 09, 2009 8:02 pm
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 21592

10006 - Carmichael Numbers

Hi,
i accepted this pro 0.036s using find a num carmichael or not;
but when i precalculate these and output at O(1) time then i got 0.028 s.

if u chk the statistics of it then u find 0.000 .008 0.012 and .....

but how this is possible ??

Please some one explain it.
Its a Mystery to me...

thnx
by dipal
Thu May 14, 2009 11:25 am
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 33392

10533 - Digit Primes

i am not understanding what is problem with me. im finding all output correct using my algo. but why i am finding Wa. ?? #include <stdio.h> bool data[1000100]={0}; long long dt[1000100]={0},i,j,n,m,count,max=0,num,num2; long long test; int main() { for (i=2; i<=1000; ) { for (j=2*i; j<=1000000; j+=i...
by dipal
Fri May 01, 2009 6:11 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 49884

673 - Parentheses Balance

hi, in the Problem description it said that : - The file contains a positive integer n and a sequence of n strings of parentheses () and [], one string a line. but i got wa when i assumed that each of next n lines have string of parenthese [*() || []*]. but got acc when assumed that there can be emp...

Go to advanced search