In the first string of condition: "For example, 2^2−1 — the first Mersenne prime".
So, the first Mersenne prime is 2^2-1 = 3.

Then, in the sample we read:
18   -   3217

But, if so, the first Mersenne prime is 2, not 3, so, for the test

1
1

the program should output 2, not 3.

var
 sum,ans,a,b,c,a1,b1,c1,n:longint;
 i,j:longint;
begin
 readln(n);
 sum:=1;ans:=0;a:=2;b:=3;c:=4;a1:=1;b1:=1;c1:=1;
 for i:=1 to n do
  begin
   a1:=a1*a;
   a1:=a1 mod 1000;
   b1:=b1*b;
   b1:=b1 mod 1000;
   c1:=c1*c;
   c1:=c1 mod 1000;
  end;
 sum:=sum+a1+b1+c1;
 while sum<>0 do
  begin
   if sum mod 10=0 then inc(ans);
   sum:=sum div 10;
  end;
 writeln(ans);
end.

Rus: Покупатели заявляют цену, по которой они готовы купить (от 0.01 до 10000.00 бибриков).
Eng: Customers make their bids: announce a price at which they are ready to buy a pig (the price is between 0.01 and 10000.00 bibriks and always has exactly 2 digits after the decimal point).

There is no analog of "and always has exactly 2 digits after the decimal point" in Russian statement which significantly complicate solution.

Can you please tell me is this array correct
{0,5392,1890,84,6520,3149,2416,2835,80,8614,742,7696,6823,
9492,7710,9444,510,118,6522,3213,4499,6178,4565,763,1071,
8875,2688,9145,1211,9480,4056,1817,8661,5467,3358,2892,
2205,8691,1963,2386,8401,1047,3691,6824,825,7728,6797,1720
8194,9901,2823,1952,9344,5022,1421,6116,4511,1289,2133,
7494,7298,5012,9638,8753,5968,4029,4804,9556,924,1497,5886
6078,2085,3876,268,2910,8962,2970,1015,3931,1103,4872,4054
346,1119,931,4454,6530,1722,4266,9888,7961,2891,885,4461,
7731,3316,2155,93,2871,9710}
q[i]=f(i*10^6),i from 0 to 100

Edited by author 18.12.2006 12:52

Edited by author 18.12.2006 12:53

Please, give me tests in which answer is "-1"

import java.util.*;
import java.text.*;

public class zad1030
    {
        public static void main(String[] args)
            {
                double alpS1, alpS2, alpD1, alpD2, l, r=6875/2.0, a, b, c;
                String s, res, sh="0123456789";
                Scanner cin=new Scanner(System.in);
                NumberFormat f=NumberFormat.getInstance(Locale.UK);
                f.setMinimumFractionDigits(2);
                f.setMaximumFractionDigits(2);
                while (cin.hasNext())
                    {
                        cin.nextLine();
                        cin.nextLine();
                        cin.nextLine();
                        s=cin.nextLine();
                        while (sh.indexOf(s.substring(0, 1))<0)
                            {
                                s=s.substring(1);
                            }
                        a=Integer.parseInt(s.substring(0, s.indexOf("^")));
                        s=s.substring(s.indexOf("^")+1);
                        b=Integer.parseInt(s.substring(0, s.indexOf("'")));
                        s=s.substring(s.indexOf("'")+1);
                        c=Integer.parseInt(s.substring(0, s.indexOf("\"")));
                        s=s.substring(s.indexOf("\"")+1);
                        alpS1=Math.toRadians(a+b/60.0+c/3600.0);
                        if (s.substring(0, 3)==" SL") alpS1=-alpS1;
                        s=cin.nextLine();
                        while (sh.indexOf(s.substring(0, 1))<0)
                            {
                                s=s.substring(1);
                            }
                        a=Integer.parseInt(s.substring(0, s.indexOf("^")));
                        s=s.substring(s.indexOf("^")+1);
                        b=Integer.parseInt(s.substring(0, s.indexOf("'")));
                        s=s.substring(s.indexOf("'")+1);
                        c=Integer.parseInt(s.substring(0, s.indexOf("\"")));
                        s=s.substring(s.indexOf("\"")+1);
                        alpD1=Math.toRadians(a+b/60.0+c/3600.0);
                        if (s.substring(0, 3)==" WL") alpD1=-alpD1;
                        cin.nextLine();
                        s=cin.nextLine();
                        while (sh.indexOf(s.substring(0, 1))<0)
                            {
                                s=s.substring(1);
                            }
                        a=Integer.parseInt(s.substring(0, s.indexOf("^")));
                        s=s.substring(s.indexOf("^")+1);
                        b=Integer.parseInt(s.substring(0, s.indexOf("'")));
                        s=s.substring(s.indexOf("'")+1);
                        c=Integer.parseInt(s.substring(0, s.indexOf("\"")));
                        s=s.substring(s.indexOf("\"")+1);
                        alpS2=Math.toRadians(a+b/60.0+c/3600.0);
                        if (s.substring(0, 3)==" SL") alpS2=-alpS2;
                        s=cin.nextLine();
                        while (sh.indexOf(s.substring(0, 1))<0)
                            {
                                s=s.substring(1);
                            }
                        a=Integer.parseInt(s.substring(0, s.indexOf("^")));
                        s=s.substring(s.indexOf("^")+1);
                        b=Integer.parseInt(s.substring(0, s.indexOf("'")));
                        s=s.substring(s.indexOf("'")+1);
                        c=Integer.parseInt(s.substring(0, s.indexOf("\"")));
                        s=s.substring(s.indexOf("\"")+1);
                        alpD2=Math.toRadians(a+b/60.0+c/3600.0);
                        if (s.substring(0, 3)==" WL") alpD2=-alpD2;
                        l=r*Math.acos(Math.sin(alpS1)*Math.sin(alpS2)+Math.cos(alpS1)*Math.cos(alpS2)*Math.cos(alpD1-alpD2));
                        l=Math.round(l*100)/100.0;
                        res=f.format(l);
                        System.out.println("The distance to the iceberg: "+res+" miles.");
                        if (100.0-l>=0.01) System.out.println("DANGER!");
                        cin.nextLine();
                    }
            }
    }

Edited by author 12.02.2010 21:06

Looks like std::vector::rend() does not return const_reverse_iterator.
I have got CE on the line
for( std::vector< Spot >::const_reverse_iterator it = spots.rbegin(); it != spots.rend(); ++it )
but
for( std::vector< Spot >::/*const_*/reverse_iterator it = spots.rbegin(); it != spots.rend(); ++it )
was ok.

Здраствуйте!
Задача:
Написать такой класс А, чтобы данный фрагмент кода компилировался и работал.

А a1;
A a2=a1+2+A(3);

Код:

# include <iostream>

using namespace std;

class A{
      private:
      int x;
      public:
             A():x(0){};//Constructor
             A(int y):x(y){};
             A(const A & y)  //Copy constructor
             {
               x=y.x;
               return *this;
              }
             A operator+(A y) const;

      };

  A A::operator+(A y) const{
                   return A(x+y.x);
                           }

  int main()

  {
      A a1;
      A a2=a1+2+A(3);
      return 0;
  }

Test:
8
Ans
9 1

Hi.
#include<iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main(){
    int i=0;
    double *a=new double[8000000];
    double c;
    while(cin.eof()==false){
        cin>>c;
        a[i]=sqrt(c);
        i++;
    }
    i--;
    i--;
    while(i>=0){
        cout<<setprecision(4000)<<a[i]<<'\n';
        i--;
    }
    return 0;
}
WA 2. Why?

can anyone please tell me what to output if N=1 is given?

input1 : 05 26 2C 52 69 14 3F 31 4C 2A 69 65 1A 26 4B
input2 : 61 07 28 41 3B 63 07 2C 52 22 21 69 72 0B 42 5E
answer : 41 43 4D 20 49 43 50 43 20 4E 45 45 52 43 27 32
(P.S : I put the spaces only for that is easy to read && understand)
Why is first 2 bytes in answer is 41...?
Cuz, 61h xor 20h = 41h (20h -> 32d = ' ' = Space);
How to find the second,third,...?
41h xor 05h = 44h
44h xor 07h = 43h(Second 2 bytes);
43h xor 26h = 65h
65h xor 28 = 4Dh (Third 2 bytes);
Last some tips:
if you use algos for convert from Dec to Hex be careful;
your algo should convert
1 : 0d to 00h (not to 0h);
2 : 5d to 05h (not to 5h);
GoodLuck!!! ;-)

Edited by author 17.05.2009 08:41

Hi,

To those who are reading the input character by character, test 4 contains some Non Digit characters as well like new line or space at the end of input etc. In my program, I just put a condition to ignore those and then it worked fine.

Varun

I found this test on acmp.ru
21 1 16 11 5 18 21
My AC answer was 3 but real is 1
(21+21+5=47 && 18+16+11+1=46 => 47-46=1)

3
3 4 1 2
3 3 1 2
3 4 1 3

i run it and i see there's no differernce between mine and the accepted one in result.

#include <cstdlib>
#include <iostream>
#include <cmath>
#include <iomanip>

using namespace std;

int main(int argc, char *argv[])
{
   int a=0;
   double b[1000];

   do{
          cin>>b[a];
    b[a]=sqrt(b[a]);
    a++;}
   while (!cin.eof());


   a=a-2;

   while (a>=0)
   {
   cout<<setiosflags(ios::fixed)<<setprecision(4);
   cout<<b[a]<<endl;
   a--;
}

          system("PAUSE");
    return EXIT_SUCCESS;
    }

program z;
 var n,k:byte; f:longint;
     s:string[30];
 procedure factorial1(n,k:byte);
  var q:integer;
  begin
   q:=n;
   while q>=k do
    begin
     f:=f*q;
     q:=q-k;
    end;
  end;
  procedure factorial2(n,k:byte);
   var q:integer;
  begin
   q:=n;
   while q>=(n mod k) do
    begin
     f:=f*q;
     q:=q-k;
    end;
  end;
begin
 read (n,s);
 k:=length(s);
 f:=1;
 IF n mod k=0 then factorial1(n,k)
  else factorial2(n,k);
 writeln (f);
end.