Edited by author 06.01.2021 17:11

Are multiple '1' digits possible in the circle ? If yes , then will they produce separate click if they are currently in the window ?

#include <iostream>
#include <string>
using namespace std;
int main()
{
    string a[3000];
    int n;
    int m;
    cin >> n;
    cin >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int j = m;
    for (int i = 0; i < 10; i++)
    {
        cout << a[j];
        j++;
        if (j == n )
        {
            j = 0;
        }
    }
    cout << endl;
    return 0;
}

I THINK THAT MY PROGRAM MUST HAVE AC BUT WA3
WHAT THE 3 TEST????
PLEASE POST TEST №3!!!!!!!

It's just the array rotation problem asked of a different way.

import java.util.Scanner;

public class _1370 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int digitos = in.nextInt();
        int cliques = in.nextInt();
        String saida = "";
        String parte2 = "";

        for (int i = 1; i <= cliques; i++){
            saida += in.nextInt();
        }

        for (int i = cliques+1; i <= digitos; i ++){
            parte2 += in.nextInt();
        }

        parte2 += saida;

        System.out.println( parte2.substring(0,10) );
    }
}

then how the heck does it happen that "after one click the first digit will go out of site and the 11-th digit will become visible."

Edited by author 11.08.2013 03:47

#include <iostream.h>
int main()
{
    int N,M,i,t;
    cin>>N>>M;
    int *mas=new int [N];
    int *mas2=new int [N];
    for(i=1;i<=N;i++)
        cin>>mas[i];
    for(i=1;i<=N;i++)
    {
        t=i+M;
        if(t>N)
        {
            t-=N;
        }
        mas2[t]=mas[i];
    }
    if(N>10)
    {
        for(i=3;i<=N;i++)
        cout<<mas2[i];
    }
    else
    {
        for(i=1;i<=N;i++)
        cout<<mas2[i];
    }
    return 0;
}

Look how to use STL algorithm rotate(). It's very easy: rotate(arr, arr + k, arr + N);

"Write the number that will appear in the window of the magic machine after the rotation."

I think 'number' is not a correct definition of a sequence of digits with possible leading zeros. So 8907712345 is number, but 0771234589 is not.

So I propose to replace 'number' with 'sequence of digits'.

#include<stdio.h>
main()
{
    int N,M,a[1000],i;
    scanf("%i %i",&N,&M);
    for(i=0;i<N;i++)scanf("%i",&a[i]);
    for(i=M;i<M+10;i++)printf("%i",a[i%N]);
}

use queue

Edited by author 25.08.2011 19:25

по одной цифре в линии
->
по одной цифре в строке

THIS OUR PROGRAMM:
program magician;
{$APPTYPE CONSOLE}
uses
  SysUtils;
Var
    i,j,n,m,k,t:integer;
    a:array[1..10000] of integer;
begin
     readln(n,m);
     for i:=1 to n do
     readln(a[i]);
     if(m>n) then m:=m mod n;
          t:=0;
          i:=m;
               repeat
                    i:=i+1;
                    t:=t+1;
                    write(a[i]);
                    if i=n then i:=0;
               until t=10;
end.

WHY WA#4????

#include<stdio.h>
#include<math.h>
void main(){
int v=0,m,n;
scanf("%d",&n);
int* a=new int[n];
int* b=new int[n];
int* c=new int[n];
scanf("%d",&m);

for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
}

 if(m+11<=n){
        for(int j=m+1;j<=11+v;j++){
                 b[j]=a[j];}

         for(int j=m+1;j<=11+v;j++){
                 printf("%d",b[j]);  }
         }
         else {
         v=m;
         while(v>n){
        v=abs(v-n); }
          for(int i=v+1;i<=n;i++){
                 b[i]=a[i];}
          for(int k=1;k<=10-(n-v);k++){
                 c[k]=a[k];}

          for(int i=v+1;i<=n;i++){
                 printf("%d",b[i]);  }

          for(int k=1;k<=10-(n-v);k++){
                  printf("%d",c[k]);  }
                     }
                 }

Write in Russia;

import java.util.Scanner;

public class Magician {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int digitos = in.nextInt();
        int cliques = in.nextInt();
        String saida = "";
        String parte2 = "";

        for (int i = 1; i <= cliques; i++){
            saida += in.nextInt();
        }

        for (int i = cliques+1; i <= digitos; i ++){
            parte2 += in.nextInt();
        }

        parte2 += saida;

        System.out.println( parte2.substring(0,10) );
    }

}


I can't see, why its crashing

I can't understand what's wrong with this C++ code:

unsigned n, m, index = 0;
cin >> n >> m;

char *seq = new char[n];

for(int i = 0; i < n; ++i)
cin >> seq[i];

for(int i = m; i < n; ++i)
cout << seq[i];

for(int i = n-m; i < 10; ++i)
cout << seq[index++];

var i,z,n,m:word; a:array[1..1000] of byte;
begin
readln(n,m);
  for i:=1 to n do readln(a[i]);
  z:=(m mod n)+1;
  i:=0;
  repeat
    write(a[z]);
    if z=n then z:=1 else inc(z);
    inc(i);
  until i>=10;
  readln;
end.

[code deleted]

Edited by author 16.04.2007 22:52