#include<stdio.h>
#include<math.h>

int main()
{
    int N;

    scanf("%d",&N);

    int i,ck = 0;
    for(i = 2; i <= abs(N); i++)
        ck += i;

    if(N < 0)
        printf("-%d\n",ck);
    else
        printf("%d\n",ck);

    return 0;
}

Hello,
Should we multiply by k or n%k if (n - i*k) equals k or n%k ?
Which sample is correct?
Sample 1
8!! = 8 *(8-2)*(8-4)*(8-6)*2

Sample 2
8!! = 8 *(8-2)*(8-4)*(8-6)

any idea what could be my mistake? i'm using
i=n; i< 2n; i++
h2=((mod + h2 - dn * a[i-n] % mod) * d % mod + a[i]) % mod;

where d=256, dn=d^(n-1) mod=10^9+9

2
10
15
16

->
Unrecoverable error. (not "Error in record #1. Correct number is: 1.")

if a route is defined by the stops: 1, 2, 4. Can they go from 4 to 2 then to 1 or is it one-way route?

#include <iostream>
using namespace std;
int main(){
    unsigned int a, b;
    cin >> a >> b;
    cout << a+b;
    return 0;
}

#include <stdio.h>
int main(){
  int a, b;
  scanf("%d %d", &a, &b);
  printf("%d", a + b);
  return 0;
}

import java.util.Scanner;

public class Zadachi {

    public static void main(String[] args) {

    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    int x = 2;
        if(n<=k){ System.out.print(x);
        }else{

            if (n*2 % k == 0){
                System.out.print(n*2/k);
            }else{
                System.out.print(n*2/k+1);
            }
        }

}
}

#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