OJ Board

I am also getting WA on the new server when I tried to resubmit codes I wrote long time ago... I have tried all sample inputs I found in this forum and I think my program gives the correct outputs. I am just using DFS brute force.... AND most importantly my code got accepted a few years ago on the o...

i got into a infinite loop because the statement n%10==0 always evaluates to TRUE. I can't figure out why the value of n can become zero if i enter n as 10, 20 or even 100

I forget to clarify a point: I'm using gcc version 3.3.1 (cygming special)

I want to extract the last two non-zero digits from an int n, using the following code: [cpp]while (n%10 == 0) n /= 10; n %= 100;[/cpp] if i input 26300, the change of value of n is as expected n=26300 n=2630 n=263 n=63 but it doesn't run as expected when the value of n is 10... [cpp]n%10 == 0 [/cpp...

How about memory usage?

I think solutions for most problems should not be provided, it is reasonable to have the number of model soultions limited to 1-20.

How can I know how long my program runs?
Do I have to code myself or I can get such information from my compiler.......?

And how about the memory size a program uses?

Sorry your algorithm doesn't work.

Why don't you guys simply use double?

Sorry...What is the input?
159487?

May I ask a question-what is a graph?
(Sorry I don't understand your problem)

so....
Use real!

My suggestion:

1. Use double.
2. Multiplies and divides at the same time to reduce run time.
3. nCr(n,r) == nCr(n,n-r)
So make r as large as possible to reduce iteration.

Easy problem, right?

This is my source code for problem 10070. When I ran it on my computer, it worked well when I input a long number. But I got "Output Limit Exceeded" when I submit it. Can anyone help me? [c]#include <stdio.h> #include <string.h> main() { char s[10000]; int y[10000]; //... [/c] Maybe 10000...

#include "iostream.h" bool mod11(str year) { int i; i=0; long sum1,sum2; sum1=0; sum2=0; while(i<year.len) { sum1+=(year.base -'0'); i+=2; } i=1; while(i<year.len) { sum2+=(year.base -'0'); i+=2; } if( sum1==sum2 ) return true; return false; } it should be ((sum1-sum2)%11 == 0)