#include <iostream>

using namespace std;

int main(){

    int a = 0;
    int b = 1;
    int c = 0;
    int k = 0;

    cin >> a;

    if(a > b){

    k = 1;

    for(; b <= a; b = b + k){

          c += b;

          }

    }

    else if(a < b){

    k = -1;

    for(; b >= a; b = b + k){

          c += b;

          }

    }

    cout << c;

    }

Edited by author 19.10.2013 16:35

Edited by author 19.10.2013 16:35

AC'ed authors, how could you fix this?

#include <stdio.h>
#include <vector>

#define pb push_back
#define For(i,n) for(int i=0;i<n;i++)

using namespace std;

int main()
{
    int n,m,k;
    vector < int > w;
    vector < int > v;
    scanf("%d%d%d",&n, &m, &k);
    For(i,n)
    {
        int x;
        scanf("%d", &x);
        w.pb(x);
    }
    For(i,m)
    {
        int x;
        scanf("%d", &x);
        x--;
        v.pb(x);
    }
    int ind=0;
    int tek=0;
    int ans=0;
    long long i=0;
    vector < int > solve;
    while (true)
    {
        if (ind<v.size() && i==v[ind])
        {
            int kol=0;
            while (kol<=k && solve.size()>0)
            {
                w.pb(solve[solve.size()-1]);
                solve.pop_back();
                kol+=w[w.size()-1];
            }
            ind++;
            i++;
            continue;
        }
        solve.pb(w[0]);
        w.erase(w.begin());
        i++;
        if (w.size()==0 || solve.size()==n)break;
    }
    printf("%d", i);
}

"Each player has his own specified starting position", means that the starting positions of the players is different?

if((a[2]+a[3]+a[4])%2==a[5] && (a[1]+a[3]+a[4])%2==a[6] && (a[2]+a[1]+a[4])%2==a[7])
shu bajarilguncha ketma-ketlikni o'zgartirib borasiz 0 bo'lsa 1 va aksincha 1 bo'lsa 0
Masalan:
0 1 0 1 1 0 1  for petal 0 1 0
1 1 0 1 1 0 1  for petal 0 0 1
0 0 0 1 1 0 1  for petal 1 1 1
0 1 1 1 1 0 1  for petal 1 0 0
0 1 0 0 1 0 1  for petal 1 0 1

Can anyone please describe the test case? How can it be as low as 0.66667?

Я один раскладывал 2*n на всевозможные множители?)

"At some moment of time two players can be located in the same cell."
If this occurs, who will take the number in that cell?
If both of them can take,then they can meet at some point and simultaneously take the number.That will maximize their score.

I have WA#11, though my decision is consisted only from integer numbers. What is possible problem?

Edited by author 11.11.2013 17:03

Edited by author 11.11.2013 17:04

Edited by author 11.11.2013 17:04

My program passed all tests from forum, but It gets WA28 Here is my code:
Var
 ygol,arm,otkl,energy,us,ensrus,enemys,ensrzapas : int64;
 s : string;
Function Min(x,y : int64):int64;
Begin
 if x > y then
  Min := y
 Else
  Min := x;
End;

Procedure Oxrana;
Begin
 if enemys = 0 then
  Writeln('STOP')
 Else
 if Abs(ygol) < 5 then
  Writeln('FIRE ',Min(20,arm))
 Else
  if ygol > 0 then
   Writeln('LEFT ',Min(100,energy))
  Else
   Writeln('RIGHT ',Min(100,energy));
End;

Procedure Atack;
Begin
 if us*ensrus > enemys*ensrzapas*3 then
  if Abs(ygol) < 10 then
   Writeln('FIRE ',Min(20,arm))
  Else
   Writeln('FRONT ',Min(100,energy))
 Else
  if Abs(ygol) < 5 then
   Writeln('FIRE ',Min(20,arm))
  Else
   Writeln('BACKWARD ',Min(100,energy))
End;

Procedure Defence;
Begin
 if enemys*20 >= Arm then
  if Abs(ygol) < 5 then
   Writeln('FIRE ',Min(20,arm))
  Else
   Writeln('BACKWARD ',Min(100,energy))
 Else
  Oxrana;
End;

Procedure Patrul;
Var
 t : longint;
Begin
 t := otkl;
 if otkl < 0 then
  Otkl := Otkl+360;
 if enemys > 0 then
  Defence
 Else
  if (Otkl>=160) and (otkl <= 200) then
   Writeln('BACKWARD ',Min(100,energy))
  Else
   if ((otkl >= 0) and (otkl <= 20) or (otkl >= 340) and (otkl <= 360)) then
    Writeln('FRONT ',Min(100,energy))
   Else
    if t > 0 then
     Writeln('LEFT ',Min(100,energy))
    Else
     Writeln('RIGHT ',Min(100,energy));
End;

BEGIN
 Readln(Energy,Arm);
 Readln(s);
 Read(enemys,ensrzapas,ygol);
 if Pos('A',s) <> 0 then
  Begin
   Read(us,ensrus);
   Atack;
  End;
 if Pos('D',s) <> 0 then
  Defence;
 if Pos('G',s) <> 0 then
  Oxrana;
 if Pos('P',s) <> 0 then
  Begin
   Read(otkl);
   Patrul;
  End;
END.

program spiral;
var
 n,m,r:real;
begin
 readln(n,m);
 if m>=n then
  begin
   if n=1.0 then
    r:=0.0
   else
    if n=2.0 then
     r:=2.0
   else
    if frac(n/2)<>0 then
     r:=4.0*trunc(n/2)
   else
    r:=2.0*(n-1);
  end
 else
  begin
   if m=1.0 then
    r:=1.0
   else
    if m=2.0 then
     r:=3.0
   else
    if frac(m/2)<>0 then
     r:=4.0*trunc(m/2)+1.0
   else
    r:=2.0*m-1.0;
 end;
 writeln(r:0:0);
end.

При компиляции примера выдает ответы такие как указаны в примере. Но при добавлении на сайт выдает ошибку. Не могу понять почему. Подскажите пожалуйста в чем проблема?

import java.io.*;
import java.math.BigDecimal;

public class SqrtDif {

    public static void main(String[] args) throws IOException {
        new SqrtDif().run();
    }

    PrintWriter out;

    void run() throws IOException {
        out = new PrintWriter(new OutputStreamWriter(System.out));
        byte bKbd[] = new byte[256];
        int iCnt = 0;
        String szStr;
        try {
            iCnt = System.in.read(bKbd);
        }
        catch (IOException ex) {
            System.out.println(ex.toString());
        }
        szStr =  new String(bKbd, 0, iCnt);
        String[] Str = szStr.trim().split("\\D+");
        double dStr;
        int i = Str.length-1;
        while (i>=0) {
            dStr = Double.parseDouble(Str[i]);
            BigDecimal bigDecimal = new BigDecimal(Math.sqrt(dStr));
            bigDecimal = bigDecimal.setScale(4, BigDecimal.ROUND_HALF_UP);
            out.print(bigDecimal.toPlainString()+"\r");
            i--;
        }
        out.flush();
    }
}

I got WA#22. What is possible problem here?

4
3 1 4 2
answer : 3

12
1 3 5 6 4 1 3 5 7 10 8 2
answer : 11

8
8 2 5 8 1 3 4 5
answer : 4

9
5 3 2 5 4 7 9 2 1
answer : 9

10
2 2 4 4 5 8 7 9 9 1
answer : 1

Edited by author 10.11.2013 18:43

3
1 1 1
output is 0 and I ignored this condition.

The value of N is <= 50, so we are talking about a 100 digit number atmost.....how then the upper limit of S is 1000.....shouldn't it be 900.....or are we supposed to return 0 when (2*N*9) < S.

Am I missing something ?????

Edited by author 10.11.2013 01:07

Nevermind.....I solved it.....

Few useful insights :-

(i) if S > (2*9*N) output 0;
(ii) if S = 0 output 1; (otherwise you would get WA for test 5).

Edited by author 10.11.2013 02:27

Is n no more than 100?
The time complexity of my program is O(n*n), why does it take so much time to run my program?(0.531s)
Do we need O(n*log(n)) to solve this problem?