int n = in.nextInt();
        int l = 0;
        if (n > 24) {
            out.print("Glupenky Pierre");
        } else {
            for (int i = 1; i <= n; i++) {
                if (i / 5 == 0)
                    l = 0;
                if (i / 5 == 1)
                    l = 1;
                if (i / 5 == 2)
                    l = 8;
                if (i / 5 == 3)
                    l = 6;
                if (i / 5 == 4)
                    l = 9;

                if (i % 5 == 0)
                    l = l * 10;
                if (i % 5 == 1)
                    l = l * 10 + 1;
                if (i % 5 == 2)
                    l = l * 10 + 8;
                if (i % 5 == 3)
                    l = l * 10 + 6;
                if (i % 5 == 4)
                    l = l * 10 + 9;
                if (l/10==0)
                    out.print("0");
                out.print(l);
                out.print(" ");
            }
        }

Edited by author 07.11.2016 22:26

Edited by author 07.11.2016 22:27

There is my code:

Program t1134;

Const MaxN=1000;

Var Card      : array[1..MaxN]of boolean;
    Numb      : array[1..MaxN]of integer;
    Use       : array[1..MaxN]of boolean;
    M,N,i,j   : integer;
    ex        : boolean;

begin
Read(N,M);
if (M>N)or(m=0) then begin
 writeln('NO');
 halt(0);
end;
for i:=1 to N do Card[i]:=false;
for i:=1 to M do Use[i]:=false;
for i:=1 to M do begin
 read(Numb[i]);
 if (Numb[i]<0)or(Numb[i]>n) then begin
   writeln('NO');
   halt(0);
 end;
end;
for i:=1 to M do
 if Numb[i]=0 then begin
  Use[i]:=true;
  if Card[1] then begin
    writeln('NO');
    halt(0);
  end;
  Card[1]:=true;
 end else
 if Numb[i]=n then begin
  Use[i]:=true;
  if Card[n] then begin
    writeln('NO');
    halt(0);
  end;
  Card[n]:=true;
 end;
for i:=1 to m-1 do if not(use[i]) then
 for j:=i+1 to m do if not(use[j]) then
  if numb[i]=numb[j] then begin
   if (card[numb[i]])or(card[numb[j]-1]) then begin
    writeln('NO');
    halt(0);
   end;
   card[numb[i]-1]:=true;
   card[numb[i]]:=true;
   use[i]:=true;
   use[j]:=true;
  end;
repeat
ex:=true;
for i:=1 to m do if not(use[i]) then
 if (card[numb[i]])or(card[numb[i]-1]) then begin
  if (card[numb[i]])and(card[numb[i]-1]) then begin
    writeln('NO');
    halt(0);
  end;
  if card[numb[i]] then begin
   card[numb[i]-1]:=true;
   use[i]:=true;
  end else begin
   card[numb[i]-1]:=true;
   use[i]:=true;
  end;
 end;
until ex;
Writeln('YES');
end.

does anyone knows test 6?

http://pastebin.com/af0DFBg0
Look at my code please.
If someone could say me what wrong, it would be great.
Thank you!

У задачи отклеилось описание на русском? Хоть и шарю по английскому, всё равно неприятно тратить несколько минут на перевод...

Edited by author 20.02.2016 16:49

i see N%3 solution everywhere but does anyone have any explanation as to why the guy who has mod-3 no of stones should lose. Some logical or mathematical reason would be much appreciated.

why should i declare 128*1024 size of memory for 256KB described in the problem?
my code goes here:
#include<iostream>
#include <cstdio>
#include <cmath>

double buf[128 * 1024];
int main()
{
    int i = 0;
    unsigned long long n;
    while (scanf("%llu", &n) != EOF) {
        buf[i ++] = (double)sqrt(n * 1.0);
    }
    for (; --i >= 0; ) {
        printf("%.4lf\n", buf[i]);
    }
    return 0;
}

//  why 128*1024  ?

Hello,
I've not found a topic about this test. Does anyone know what is it?
I'm just searching from the half of the string to find where can be the center of a palindom.
Thank you

The follwing is my pgm. Could some give a test case not satisfied here?
var
s1,i:integer;
f:boolean;
a2,b2,a1,b1,a,b:real;
begin

 f:=false;
 read(a);
 read(b);
 a1:=a/100;
 b1:=b/100;
 if b<>0 then
 i:=trunc(1/b1);
 a2:=a1*(i);
 b2:=b1*(i);
 while not f do
    begin
   if (((trunc(b2)<>trunc(a2)))and (frac(b2)<>0)   then f:=true;
   a2:=a2+a1;
   b2:=b2+b1;
   i:=i+1;
 end;
 i:=i-1;
 writeln(i);

end.

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

const long long mod=1000000007;
const int nmax=200;

int n,m,t,p;
long long v[nmax],fact[nmax],step[nmax];
bool used[nmax];
bool a[nmax][nmax];
long long ans;

void DFS(int v)
{
       for(int j=1;j<=n;j++)
       {
              if(a[v][j] && !used[j])
              {
                     t++;
                     used[j]=true;
                     DFS(j);
              }
       }
}

bool FindCycle(int v,int pr)
{
     bool f=false;
     for(int j=1;j<=n;j++)
     {
            if(a[v][j] && j!=pr)
            {
                   if(used[j]) return true;
                   else
                   {
                     used[j]=true;
                     t++;
                     f=f | FindCycle(j,v);
                   }
            }
     }
     return f;
}

void main()
{
       scanf("%d%d\n",&n,&m);

        if(n<=2)
        {
               printf("1");
               return;
        }

       fact[0]=1;
       for(int i=1;i<=n;i++)
              fact[i]=fact[i-1]*((long long)i) % mod;

       for(int i=1;i<=n;i++) step[i]=0;

       for(int i=1;i<=n;i++)
       {
              for(int j=1;j<=n;j++)
                     a[i][j]=false;
       }

       for(int i=1;i<=m;i++)
       {
          scanf("%d\n",&t);
          if(!a[i][t])
          {
              a[i][t]=a[t][i]=true;
              step[i]++;
              step[t]++;

          }
       }

       p=1;
       while(p<=n && step[p]<=2) p++;
       if(p<=n)
       {
              printf("0");
              return;
       }

       for(int i=1;i<=n;i++) used[i]=false;

       for(int i=1;i<=n;i++)
       {
              if(!used[i])
              {
                   used[i]=true;
                   t=1;
                   if(FindCycle(i,-1))
                   {
                          if(t<n)
                          {
                            printf("0");
                            return;
                          }
                          if(t==n)
                          {
                            printf("2");
                            return;
                          }
                   }

              }
       }

       for(int i=1;i<=n;i++) used[i]=false;
       p=0;
       ans=1;
       for(int i=1;i<=n;i++)
       {
              if(!used[i])
              {
                     p++;
                     t=1;
                     used[i]=true;
                     DFS(i);
                     if(t>1) t=2;
                     ans*=((long long)t) % mod;
              }
       }
       ans=ans*fact[p-1] % mod;
       while(ans<0) ans+=mod;
       printf("%lld",ans);
}

a a b a a
answer: 1

If you have WA4 java. Put 10^7  instead of 10^6

Edited by author 30.09.2013 09:17

Edited by author 30.09.2013 09:17

Didn't notice that problem is not for Java, so I solved it. Maybe someone will need the solution. Solution without checking of stacks for emptiness.


import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;

public class HelloWorld {

    public static void main (String[] args)     {
        HashMap<Integer,  ArrayList<Integer>> map = new HashMap<Integer, ArrayList<Integer>>();
        Scanner reader = new Scanner(System.in);
        int n = reader.nextInt();
        reader.nextLine();
        for (int i = 0; i < n; i++) {
            String command = reader.nextLine();
            StringTokenizer tokenizer = new StringTokenizer(command);
            command = tokenizer.nextToken();
            if ("PUSH".equals(command)) {
                int key = Integer.parseInt(tokenizer.nextToken());
                int value = Integer.parseInt(tokenizer.nextToken());
                if (map.containsKey(key)) {
                    map.get(key).add(0, value);
                }
                else {
                    map.put(key, new ArrayList<Integer>());
                    map.get(key).add(0, value);
                }
            }
            else if ("POP".equals(command)) {
                int key = Integer.parseInt(tokenizer.nextToken());
                if (map.containsKey(key)) {
                    System.out.println(map.get(key).get(0));
                    map.get(key).remove(0);
                }
            }

        }
    }
}

Edited by author 31.10.2016 23:24

Edited by author 31.10.2016 23:26

Here is my not accepted solution:
#include<iostream>
#include<string>
using namespace std;

double P(int power[],string names[],int a,int n,int video_power,int on_or_off[],int w,int h){
a=video_power;
for(int i=0;i<n;i++){if(on_or_off[i]==1){a/=power[i];}}
double res=a/(w*h);
return res;
}

int main()
{

int n;
cin>>n;
string * names = new string[n];
int * power = new int[n];
for (int i=0;i<n;i++){
cin>>names[i];
cin>>power[i];
}

int w,h,video_power;
cin>>w>>h>>video_power;

double results[100];
int on_or_off[100];
for(int i=0;i<n;i++){on_or_off[i]=1;}
int e=0;

int a=video_power;
for (int i=0; i<n;i++){
a/=power[i];
}
double prodyctivity=a/(w*h);
results[e]=prodyctivity;e++;

int m;
cin>>m;
for(int i=0; i<m; i++){
string change,change_name;
cin>>change;
if(change[0]!='R'){
cin>>change_name;
for(int y=0;y<n;y++){
    if(change=="On" && change_name==names[y]){
        on_or_off[y]=1;
        prodyctivity=P(power,names,a,n,video_power,on_or_off,w,h);
        results[e]=prodyctivity;e++;
        }
    else if(change=="Off" && change_name==names[y]){
        on_or_off[y]=0;
        prodyctivity=P(power,names,a,n,video_power,on_or_off,w,h);
        results[e]=prodyctivity;e++;
        }
}
}
else{
int a1,a2;
cin>>a1>>a2;
w=a1;h=a2;
prodyctivity=P(power,names,a,n,video_power,on_or_off,w,h);
results[e]=prodyctivity;e++;
}
}

for(int i=0;i<m+1;i++){
    if(results[i]<10){cout<<"Slideshow"<<endl;}
    else if(results[i]>=60){cout<<"Perfect"<<endl;}
    else{cout<<"So-so"<<endl;}
}
}

Please!

If the plane fly across a edge and it will produce a point then produce a new block so the answer add one.
If gcd(M, N) = 1, it means there is no situation that the plane fly across the crossroads.
See from left to right it produce M point and see from north to south it produce N point,
but one is calculate twice, so there are M + N - 1 points and Ans is M + N - 1.

I've perused over some of the other solutions here, tried to come up with something original, but I'm having a difficult time understanding why it won't stop letting me input in Eclipse, and how to deal with that...Here's my code:

import java.util.*;

public class ReverseRoot
{//start class
    public static void main(String[] args)
    {//start main
        Scanner in = new Scanner(System.in);
        ArrayList<Long> array = new ArrayList<Long>();
        array.add(in.nextLong());

        while(in.hasNextLong())
        {
            array.add(in.nextLong());
        }
        in.close();

        for (int i = array.size(); i > 0; i--)
            System.out.printf("%.4f%n", Math.sqrt((double)array.get(i)));
    }//end main
}//end class

s1 = ['1 2 3 4 5',
      '1 4 3 2 5',
      '1 3 2 4 5',
      '1 3 4 2 5']