#include <iostream>
#include <math.h>
using namespace std;
int main()
{
    char N[51];
    cin >> N;
    int i;
    for (i = 0; N[i] != '\0'; i++);
    char Y[4];
    int counter = 0, a = 0;
    if (i % 3 == 0)
    {
        for (int j = 0; j < i; j += 3)
        {
            Y[0] = N[j];
            Y[1] = N[j + 1];
            Y[2] = N[j + 2];
            Y[3] = 0;
            if (counter % 2 == 0)
            {
                int temp = atoi(Y);
                a += temp;
            }
            if (counter % 2 == 1)
            {
                int temp = atoi(Y);
                a -= temp;
            }
            counter++;
        }
    }
    if (i % 3 != 0)
    {
        int start = i % 3;
        for (int maloe = 0; maloe < start; maloe++)
        {
            Y[maloe] = N[maloe];
        }
        Y[start] = '\0';
        int temporary = atoi(Y);
        a -= temporary;
        int counter = 0;
        for (int j = start; j < i; j += 3)
        {
            Y[0] = N[j];
            Y[1] = N[j + 1];
            Y[2] = N[j + 2];
            Y[3] = 0;
            if (counter % 2 == 0)
            {
                int temp = atoi(Y);
                a += temp;
            }
            if (counter % 2 == 1)
            {
                int temp = atoi(Y);
                a -= temp;
            }
            counter++;
        }
    }

    cout << abs(a%7);
    system("pause");
    return 0;
}

1
1 366
-565864 609690 15155
516588 775970 765044
814205 -251004 532061

magion will stop in the middle of second args...please check it

#include <iostream>
using namespace std;
int main(){
  int n, i = 0;
  cin >> n;
  while (n != 1){
    if (n <= 1){
        i+= n;
        n++;
    }
    else if (n >= 1){
        i+= n;
        n--;
    }
  }
    cout << i+1;
    return 0;
}

#include <stdio.h>
int main() {
  int n, i = 0;
  scanf("%d", &n);
  while (n != 1){
    if (n <= 1){
        i+= n;
        n++;
    }
    else if (n >= 1){
        i+= n;
        n--;
    }
  }
  printf("%d", i+1);
  return 0;
}

Can someone please tell how the test looks like?

Don't forget about saving MIN PRICE of device

Edited by author 31.03.2017 17:39

When i write my program like:
#include<cstdio>
long long int i,k;
int main(){

scanf("%lld",&k);
i=k / 3;
while(k % i!=0){
i=k /(k / i +1);
}

i got AC,but when i change it to:

#include<cstdio>

int main(){
long long int i,k;
scanf("%lld",&k);
i=k / 3;
while(k % i!=0){
i=k /(k / i +1);
}
printf("%lld",(k / i-1));
}

printf("%lld",(k / i-1));
}
i got WA5...does anyoe know how is that possible?

Check your program for very big K. It helped me.

Edited by author 31.03.2017 14:38

I got AC on this simply by guessing that combining the stripies from the largest down to the smallest would result in the smallest colony size. Can someone explain what mathematical or logical reasoning would be used to arrive at this conclusion, or prove that this conclusion would be true?

Don't forget that not only P should be divider of 2N but P+2A-1 should be divider of 2N too. It was my mistake when I got WA 7

#include <iostream>
using namespace std;

int main()
{
    long N;
    cin >> N;
    long **array = new long*[N];
    for (long i = 0; i < N; i++)
    {
        array[i] = new long[2];
        long temp, temp2;
        cin >> temp >> temp2;
        array[i][0] = temp;
        array[i][1] = temp2;
    }
    cout << endl << endl;

    long l, r, i, k, buf;
    k = l = 0;
    r = N - 2;
    while (l <= r)
    {
        for (i = l; i <= r; i++)
            if (array[i][1] < array[i + 1][1])
            {
                swap(array[i], array[i + 1]);
                k = i;
            }
        r = k - 1;
        for (i = r; i >= l; i--)
            if (array[i][1] < array[i + 1][1])
            {
                swap(array[i], array[i + 1]);
                k = i;
            }
        l = k + 1;
    }
        for (long i = 0; i < N; i++)
        {
            cout << array[i][0] << " " << array[i][1] << endl;
        }
        return 0;
    }

What is wrong with it?( I use bubbleshaker sort.

my program with
while(n < 3)
 printf("there are some stupid tests!\n");
gets Output limit exceeded 3.
Please, check your tests!

I don't understand. I use quicksort and then find solution very fast. MLE #21 say me that
memory limit! I use c#.

Edited by author 26.03.2017 21:16

Edited by author 26.03.2017 21:16

Edited by author 26.03.2017 21:17

Edited by author 26.03.2017 21:37

I think, i do all rigth, but i've WA1=((
I don't understand output type, that's mean what me should to print. Sorry for my English...

var a,b:array[1..15000]of longint; asd,asd1,n,i,j:longint;
begin
read(n);
for i:=1 to n do read(a[i],b[i]);

for i:=1 to n-1 do
  for j:=i+1 to n do
    if b[i]<b[j] then begin
                      asd:=b[i];
                      b[i]:=b[j];
                      b[j]:=asd;
                      asd1:=a[i];
                      a[i]:=a[j];
                      a[j]:=asd1;
                      end;

for i:=1 to n do begin write(a[i],' ',b[i]);writeln;end;
end.

//problem solved (issue of different compilers of my local PC and judge one)

Edited by author 26.03.2017 16:41

//tower.in
1000 60 10
1
2
3
4
5
20170312
666666666
888888888
999999999
427749136024120470
427749136024120471
427749136024120472
-1

//tower.out
427749136024120472
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 1
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 3
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 4 3
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 3 4 5 6 7 6 7 6 7 8 9 8 7 6 5 6 7 8 9 10 9 8 9 10 11
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 1 2 3 2 3 4 3 4 3 4 5 6 7 8 9 8 9 10 11 12 11 10 9 10 9 10 9 10 9 8 9
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 3 2 3 4 5 6 5 4 5 6 5 4 3 4 5 6 7 8 9 10 9 8 9 8 7 6 7 6 5 4 5
10 9 8 7 6 5 4 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 3 4 3 4 5 4 5 6 7 8 9 10 9 8 7 8 9 8 9 10 9 8 9 10 11 12 11 12 13 14 13
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 7 6 5 4 3 2 1 2 3 2 1
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 7 6 5 4 3 2 3 2 1 2 1
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 8 7 6 5 4 3 2 1 2 1 2 1

I finished it in 0.015s.