Hello.

I don't know what is wrong with my solution, maybe someone can help me.
here is my code


#include <stdio.h>

int maxdivisor(unsigned long long n)
{
    for(int i=9;i>1;i--)
        if(n%i==0)
            return i;
    return 1;
}

int main()
{
    unsigned long long n;
    scanf("%Ld",&n);
    if(n==0)
    {
        printf("10");
        return 0;
    }
    if(n<10)
    {
        printf("%Ld",n);
        return 0;
    }
    int dig[100];
    int k=0;
    int d;
    int flag=0;
    while(n>1)
    {
        d=maxdivisor(n);
        if(d==1)
        {
            flag=1;
            n=1;
        }
        else
        {
            dig[k]=d;
            k++;
            n=n/d;
        }
    }
    if(flag==1)
        printf("-1.");
    else
        for(int i=k-1;i>=0;i--)
            printf("%d",dig[i]);
    return 0;
}


Thanks in advance

I am programming on Delphi7 . I sent my answeres but it Write "Wrong answer"

Nice task... I really like it...
Not very difficult, but not simple too

  When I submited, it always said "Wrong Answer text#7"
  Who can tell me what does it means?

Henry Hu wrote that the problem is in multiplication of big numbers in checking the carry. But I still can't get what's wrong. Can anybody describe the problem with an example?
What's special in this test?

Edited by author 19.05.2007 23:54

Why Crash?
Who can give me test#1?
Thanks

[code deleted]

Edited by author 14.05.2007 17:50

Edited by author 14.05.2007 17:53

Edited by author 14.05.2007 17:55

Please, give me some tests on #21

Sorry, I have AC!

Edited by author 18.05.2007 17:10

Edited by author 18.05.2007 17:11

something tells me that it must be solved by building a graph and finding strongly connected components for each new income of data.
:))

Learn J# and no problems on olympiads!

[code deleted]

Edited by moderator 17.05.2007 10:03

I now that the first test for this problem is the sample (I check it with a stupid programm which output the strings of sample, and this programm has WA#2).
And for this test my REAL program give the corret answer, but when I try to submit it I have ACCESS VIOLATION. I try even do all my arrays [1..1000] and replace string on ansistring (i write in PASCAL), but all my attempts was failed.
Can anybody help me?
PS If you want I can show my program

Edited by author 18.04.2008 12:13

[hint deleted]

Edited by moderator 16.05.2007 09:25

Who can help me?

> Array[0..100]of longint;
Crash {access violation} #9

> Array[0..1000]of longint;
Crash {access violation} #3

Please help me!

1: 27，8
2: 5，5，13，14

min:(5+5+13+14)-(27+8)=2
not 3!!!

I use recursion (with optimization :)) and got AC 0.015!

#include<iostream.h>
#include<math.h>
int main()
{
    double pi;
    double l, r,alpha,segm,treug,delta;
    cin>>l>>r;
    pi=3;
    l/=2;
    if(r<=l/2)
        cout<<pi*r*r;
    if(r>(l*sqrt(2)))
        cout<<l*l*4;
    else
    {
        alpha=2*acos(l/r);
        segm=pi*r/(2*alpha);
        treug=l*sqrt(((r*r)-(l*l)));
        delta=segm-treug;
        cout<<pi*r*r-4*delta;
    }
    return 0;
}