#include <cstdlib>
#include <iostream>

//----------Funkcje----------------------------
long long nwd(long long a, long long b)
{
  if (b>=1) nwd(b, a%b);
  if (b=0) return a;
}


using namespace std;

//---------------Program------------------------------------
int main(int argc, char *argv[])
{
    int n;
    long long tab[1002]={0};
    //printf("Dla ilu liczb chcesz policzyc NWD?: \n");
    scanf("%d", &n);
    //printf("Podaj liczby: \n");
    for (int i=0;i<n;i++) scanf("%I64d", &tab[i]);
    long long wynik=tab[0];
    for (int i=0;i<n-1;i++) {
      wynik=nwd(tab[i],tab[i+1]);
      tab[i+1]=wynik;
    }

    //printf("NWD wynosi %I64d \n", wynik);
    printf("%I64d", wynik);

    system("PAUSE");
    return EXIT_SUCCESS;
}

Give me some tests or write if there are some sly tests.
I solve this problem by 2^K*N*N.

type
 sl=array[1..150] of longint;
var
 i,j,k,l,n,m,s:longint;
 f:array[0..50,-10..1000] of sl;
 u:sl;
function gjc(a:sl):sl;
var
  i,t:longint;
  tmp:sl;
begin
  for i:=120 downto 1 do
    if a[i]<>0 then break;
  t:=i;
  fillchar(tmp,sizeof(tmp),0);
  for i:=1 to t do
    for j:=1 to t do
      inc(tmp[i+j-1],a[i]*a[j]);
  for i:=1 downto 120 do
  begin
    tmp[i+1]:=tmp[i+1]+tmp[i] div 10000;
    tmp[i]:=tmp[i] mod 10000;
  end;
  exit(tmp);
end;


procedure gjj(b:sl;var a:sl);
var
 i,j,k,l:longint;

begin
 for i:=1 to 120 do
  a[i]:=a[i]+b[i];
 for j:=1 to 120 do
  begin
   inc(a[j+1],a[j] div 10000);
   a[j]:=a[j] mod 10000;
  end;
end;

procedure printgj(a:sl);
var
 i,j,k,l,len:longint;
 st:string;
begin
 i:=120;
 while (i>0)and(a[i]=0) do dec(i);
 if i=0 then BEGIN writeln(0);exit;end;
 len:=i-1;
 write(a[len+1]);
 for i:=len-1 downto 1 do
  begin
   str(a[i],st);
   while length(st)<4 do insert('0',st,1);
   write(st);
  end;
end;

begin
 readln(n,s);
 if (n=1)and(s<=9) then begin writeln(1);halt; end;
 if s mod 2=1 then begin writeln(0);halt; end;
 f[0,0][1]:=1;
 for i:=1 to n do
  for j:=0 to s shr 1 do
   for k:=0 to 9 do
    begin
     gjj(f[i-1,j-k],f[i,j]);
    end;
 l:=s shr 1;
 u:=(gjc(f[n,l]));
 printgj(u);
end.

Edited by author 07.01.2010 10:17

test:
4
0000
011
1011
11011

answ:
0000
0111
1010
1101

is it correct or not?

What does mean WA3 Crash (access violation)?
I compiled my program many times in dev-C++ and VC++. Then I try to write
#pragma comment(linker, "/STACK:16777216")
but it doesn't work.
I use dynamic array and sheker sort.

program stone;
const nmax=20;
var
 i,k,n:byte;
 x:longint;
 a:array[1..nmax] of longint;
begin
read(n);
For i:=1 to n do read(a[i]);
 For i:=2 to n do
  For k:=n downto i do
   If a[k-1]>a[k] then
   begin
    x:=a[k];
    a[k]:=a[k-1];
    a[k-1]:=x;
   end;
 while n>1 do
 begin
   a[n-1]:=a[n]-a[n-1];
   dec(n);
  For i:=2 to n do
   For k:=n downto i do
    If a[k-1]>a[k] then
    begin
     x:=a[k];
     a[k]:=a[k-1];
     a[k-1]:=x;
    end;
 end;
write(a[1]);
read;
end.

May be I am too self-confident, but I am sure my program must work. But the fifth test refutes my confidence. If you are able to help, please,try to find mistake and write where it is=)

I used getc and the idea of finite automaton to solve this problem and my program is working fine on the sample test case as well as all test cases given in thread.
Still I am getting WA#1. I know it is not same as sample case.
Please give me some good test from case 1.
Thanks.

Why this
#include <math.h>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;

int main()
{
    vector<double> numbers;
    double number = 0;
    while(cin >> number){
        numbers.push_back(number);
    }

    for(int i = numbers.size() - 1; i >= 0 ; i--){
        cout<<setprecision(5)<<sqrt(numbers[i])<<'\n';
    }

    return 0;
}

is wrong and this

//...
printf("%.4lf\n", sqrt(numbers[i]));
//...

is write? I don't understand. Both ways are correct...

#include<stdio.h>
#include<iostream>

using namespace std;


char str[300],text[3000005],c,ch;
int n=-1,i=0,cnt=-1;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif

while(scanf("%c",&c)!=EOF)
{
        n++;
        text[n] = c;

}

            while(i<n)
            {
            memset(str,'\0',sizeof(str));
            cnt= -1;
                while(1)
                {
                        if((text[i]>='a'&&text[i]<='z')||(text[i]>='A'&&text[i]<='Z'))
                        {
                                cnt++;
                                str[cnt] = text[i];
                                i++;
                        }
                        else {
                                ch = text[i];
                                i++;
                                break;
                             }

                }

        for(int j=cnt;j>=0;j--)
        {
         printf("%c",str[j]);
        }


         printf("%c",ch);



                 }
 return 0;
      }

I think that my program is correct, but i don't understand why i have WA#5. I use Dejkstra algorithm. Please, give me some right tests. Than I use another method - DP. I use 2 arrays for the current and previous states, but I have WA#7. Help!!! Thanks.

Edited by author 06.10.2006 22:31

Edited by author 06.10.2006 22:31

Edited by author 06.10.2006 22:31

var
 s:array[1..100010] of char;
 i,j,k,l,now,lo:longint;
 a,t1,t2:string;
begin
 a:='';
 for i:=1 to 80 do a:=a+' ';
 i:=0;
 while not(eof) do begin inc(i);read(s[i]); end;
 lo:=i;
 now:=1;
 for i:=1 to lo do
  begin
   if (s[i]='<') then  begin dec(now); if (now=0) then now:=1; continue; end;
   if (s[i]='>') then  begin inc(now); if (now=81) then now:=1; continue; end;
   if now=1 then t1:='' else t1:=copy(a,1,now-1);
   if now=80 then t2:='' else t2:=copy(a,now+1,80-now-1);
   a:=''; a:=t1+s[i]+t2;
   t1:=''; t2:='';
   inc(now); if (now=81)then now:=1;
  end;
  for i:=1 to 80 do write(a[i]);
end.

I used "long long" and got WA; used "int" but got AC!

#include<stdio.h>
#include<iostream>

using namespace std;
int a,b,n,m,g[1000][1000];
int _max = -1000;
int main()
{
scanf("%d %d",&n,&m);

for(int i = 1;i<=m;i++)
{

                scanf("%d %d",&a,&b);
                g[a][b]=1;
                g[b][a]=1;
}


for(int k = 1;k<=2*n;k++)
{
        for(int l = 1;l<=2*n;l++)
        {
           if(k==l){continue;}
           else if(g[k][l]==1)
           {
           g[k][l]=2;
           g[k][l]=2;
           }
        }
}

for(int k = 1;k<=2*n;k++)
{
        for(int l = 1;l<=2*n;l++)
        {
           if(k==l){continue;}
           else if(g[k][l]==0)
           {
           g[k][l]=1;
           g[k][l]=1;
           }
        }
}

int key = 0;
for(int k = 1;k<=2*n;k++)
{
        for(int l = 1;l<=2*n;l++)
        {
          if(key>=2){return 0;}
          else if(k==l){continue;}
          else if(g[k][l]==1)
          {
                printf("%d %d\n",k,l);
                key++;
          }
        }

}

printf("IMPOSSIBLE");
}

i got ac, but my program can't pass some tests.. can you add these tests?

Edited by author 19.01.2008 01:06

var s1,s:string;
    i,k,x,code:integer;

begin
  read(s);
  i:=2; s1:=s[1]+s[2];
   repeat
    begin
     val(s1,k,code);
     x:=k mod 7;
     str(x,s1); inc(i); s1:=s1+s[i];
    end;
   until i>=length(s);
   if s1<>'' then
    begin
     val(s1,k,code);
     x:=k mod 7;
    end;
   write(x);
end.


very simple

I cant understand problem statement , I'm reading it for 1 hour and can't understand what they want ;( please explain it to me...
thanks

2
[SPbSU_ITMO]_WiNGeR TL 7
Milanin_(TNU) AC

3
[SPbSU_ITMO]_WiNGeR TL 7
Milanin_(TNU) AC
Milanin_(TNU) WA 7

3
[SPbSU_ITMO]_WiNGeR TL 6
Milanin_(TNU) AC
Milanin_(TNU) WA 7

3
Milanin_(TNU) WA 6
Milanin_(TNU) WA 6
Milanin_(TNU) WA 7

Thanks

Test is
10.000 29.999

Correst answer is
60.000583