#include<iostream>
#include<math.h>
#include<algorithm>
void quickSort(double x[],double y[],int left, int right) {
      int i = left, j = right;
      double tmp;
      double pivot = x[(left + right) / 2];
      while (i <= j) {
            while (x[i] < pivot)
                  i++;
            while (x[j] > pivot)
                  j--;
            if (i <= j) {
                  tmp = x[i]; x[i] = x[j]; x[j] = tmp;
                  tmp = y[i]; y[i] = y[j]; y[j] = tmp;
                  i++;
                  j--;
            }
      };
      if (left < j)    quickSort(x,y,left, j);
      if (i < right)   quickSort(x,y,i, right);
}
double dis(double x1,double y1,double x2,double y2)
{
  return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
using namespace std;
int main()
{
   double a[305][305],x[305],y[305],max,s1;
   int i,j,n,k;
   cin>>n;
   for(i=1;i<=n;i++)cin>>x[i]>>y[i];
   quickSort(x,y,1,n);
   int left=1,right=1;
   for(i=2;i<=n;i++)
   {
      if(x[i]==x[i-1])right++;
      else
      {
          sort(y+left,y+right+1);
          right++;
          left=right;
      }
   }
   sort(y+left,y+right+1);
   for(i=1;i<n;i++)
   for(j=i+1;j<=n;j++)
   a[i][j]=dis(x[i],y[i],x[j],y[j]);
   for(i=1;i<n-1;i++)
   for(j=i+1;j<n;j++)
   {
     max=a[i][j];
     bool f=0;
     for(k=j+1;k<=n;k++)
     if ((x[k]-x[i])*(y[i]-y[j])==(y[k]-y[i])*(x[i]-x[j]))
     {
       if (max<a[i][k]) max=a[i][k];else a[i][k]=0;
       if (max<a[j][k]) max=a[j][k];else a[j][k]=0;
     }
     if (max>a[i][j]) a[i][j]=0;
   }
   s1=0;
   for(i=1;i<n;i++)
   for(j=i+1;j<=n;j++)s1+=a[i][j];
   s1=s1+0.4999999999;
   cout<<(long long)s1;
   system("pause");
   return 0;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class Solving {

    public StreamTokenizer in  = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    public PrintWriter out  = new PrintWriter(new OutputStreamWriter(System.out));

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

    public int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    public void run() throws IOException {
        int num = this.nextInt();
        int[] arr = new int[num];
        int a = 0;
        int b = 0;
        for (int iter1 = 0; iter1 < num; iter1++) {
            arr[iter1] = this.nextInt() + this.nextInt();
        }
        StringBuilder str = new StringBuilder();
        for (int iter2 = (arr.length - 1); iter2 > 0; iter2--) {
            a = arr[iter2]/10 + arr[iter2 - 1]%10;
            str.insert(0, (a%10 + b));
            b = a/10;
        }
        if (b != 0) {
            str.insert(0, b);
        }
        str.append(arr[arr.length - 1]%10);
        this.out(str.toString());
    }

    public void out(String str) {
        out.println(str);
        out.flush();
    }
}

I don't know how make this faster. Help me please.

Edited by author 16.02.2014 03:25

1) множитель не может быть отрицательным
2) умножать надо не по количеству восклицательных знаков а пока i*k < n
3) если ( n - i*k ) равно n % k или ( n - i*k ) равно k значит мы посчитали факториал ( то есть надо больше ничего с числом не делать )
4) n и k от 1 до 20
5) составители задачи тупые мудаки

This is the fragment of my program:
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
    int p;
    scanf("%d", &p);
    p--;
    if (p >= n)
        throw;

If I remove throw, I'll have WA 3.

So children can say absolutely incorrect information?

Here:

7S 9S KS 7C 9C QC 7D 8D 9D 7H
QS 10S AC KC 8C KD 10D AH 9H 8H
AS JS 8S JC 10C AD QD JD JH 10H
3
;(

7S 10S 7C 8C 9C JC 7D 9D 7H 8H
QS JS 8S KC QC 8C AD 8D QH 10H
AS KS 9S 10C QD JD 10D KH JH 9H
3
;(

7S 10S 7C 8C 9C JC 7D 9D 7H 8H
QS JS 8S QC 8C AD 8D QH 10H KH
AS KS 9S KC 10C QD JD 10D JH 9H
3
;)

7S 7C 7D 10D JD QD KD 7H 9H JH
10S 9S KC 9C 8C AD 9D 8D AH 8H
AS KS QS 8S AC JC 10C KH QH 10H
3
;(

7S 7C 7D 10D JD QD KD 7H 9H JH
10S 9S KC 9C 8C 9D 8D AH 8H KH
AS KS QS 8S AC JC 10C AD QH 10H
3
;(

7S 7C 7D 10D JD QD KD 7H 9H JH
8S 9S 10C 9C 8C AD 9D 8D 8H 10H
AS KS QS 10S AC KC JC AH KH QH
3
;)

7S 7C 7D 9D JD KD 7H 10H JH QH
AS AC KC QC JC 9C AD QD 10D KH
KS 10S 9S 8S 10C 8C 8D AH 9H 8H
2
;(

9S 10S JS 9C 10C JC 9D 10D JD JH
8S 7S 8C 7C 8D 7D 7H 8H 9H 10H
AS KS QS AC KC QC AD KD QD QH
2
;)

AC 7D KD QH 8H 8C 8S 9C QC 10C
KH 7H JH 7C 9H JS QD 8D 7S JD
10H KC AS AH QS JC 10D KS AD 10S
1
;)

7C AH QC KC KD 9C 9H 8C 10C JH
QS JC 9D 10H KH JD JS AC 8S AS
10D 7H KS 10S AD 7D 8H QH 8D QD
1
;(

8C 10S 9D 7S KD QC 9C KS JC 8S
8H JD 7D QH 10H 10D 8D 10C AH JS
KC QD 9S JH QS AS KH 9H 7H AC
3
;(

Edited by author 14.02.2014 01:31

Edited by author 14.02.2014 01:31

I have been working on it for a week....

Ребята будьте внимательный когда читаете условия. Я потратил пол часа пока понял что нужно составить не менее 6 а не не менее n слов...

Hello gentlemen!

Who can explain why I get WA8? Are there any test data available to anyone?

wrong answer, but I do't know why! help, please

#include<iostream>
using std::cout;
using std::cin;
using std:: endl;
int main(){
    int res = 0;
    int n1, n2, n3;
    cin >> n1;
    unsigned *arr1 = new unsigned[n1];


    unsigned temp[100];
    for(int i = 0; i < n1; ++i){
        cin >> arr1[i];
    }
    cin >> n2;
    unsigned *arr2 = new unsigned[n2];
    for(int i = 0; i < n2; ++i){
        cin >> arr2[i];
    }
    cin >> n3;
    unsigned *arr3 = new unsigned[n3];
    for(int i = 0; i < n3; ++i){
        cin >> arr3[i];
    }
    int sum = 0;
    for(int i = 0; i < n1; i++){
        for(int j = 0; j < n2; ++j){
            if(arr2[j] == arr1[i])
            temp[i]= arr2[j];
            sum++;
        }
    }
    int sum1 = 0;
    for(int i = 0; i < sum; i++){
        for(int j = 0; j < n3; ++j){
            if(arr3[j] == temp[i])
            sum1++;
        }
    }
cout << sum1 << endl;
    delete[]arr1;
    delete[]arr2;
    delete[]arr3;
system("PAUSE");
return 0;
}

I make matrices from the sequence of Catalan numbers 1,2,5,14,42,132,429,1430,4862,...
Such matrices satisfy all criterion:
1)All numbers are positive integers
2) Determinants of all matrices are equal to 1
But I get WA2

/*
 * File:   main.cpp
 * Author: Maxim Cherchuk <maxim.cherchuk@gmail.com>
 *
 * Created on 12 Февраль 2014 г., 23:36
 */


#include <iostream>
#include <algorithm>

using namespace std;

/*
 *
 */

const int MAXN = 50000, MAX = 10000;
int a[MAXN], b[MAXN];
int n, k, m;

int main(int argc, char** argv) {
    ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    cin >> k;
    for(int i = 0; i < k; ++i) {
        cin >> b[i];
    }
    sort(a, a+n);
    sort(b, b+k);
    for(int i = 0; i < n; ++i) {
        const int cur = a[i];
        int l = 0;
        int r = k;
        while(r-l > 1) { // binary search
            m = (l+r)>>1;
            if(cur+b[m] > MAX)
                r = m;
            else
                l = m;
        }
        if(cur + b[l] == MAX) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

What is test #1??

#include<iostream>
using namespace std;
int GCD( int a, int b )
{
    a = abs( a );
    b = abs( b );

    while ( b )
    {
        int tmp = a % b;
        a = b;
        b = tmp;
    }
    return ( a );
}
int main()
{ int s=0,n,i;
   cin>>n;
   for(i=1;i<=n/2;i++)
         if(GCD(n,i)%n==1)
         s++;
         cout<<s;
    system("pause");
    return 0;
}

If you have WA#7 check that your program works correct with strings with symbols "{" and "//"

#include <iostream>

using namespace std;


int main()
{
    int k,a[1001],i(0),s(0),maxs(0),j(0);

    cin >> k;
    while(i<k)
    {
        cin >> a[i];
        i++;
    }

    for (i=0; i<k; i++){
        if (a[i]==a[i+1] && a[i]==a[i+2])
        {
            s = a[i]*3;
            j = i+2;
        }
        if (s > maxs)
        {
            maxs = s;
            s = 0;
        }
    }
    cout<<maxs<<"\n"<<j<<endl;
}

Edited by author 10.02.2014 22:44

why???
#include <iostream>
//#include <stdlib.h>
//#include <stdio.h>
#include <string.h>
using namespace std;
int i,o,tp,nm;
struct Tpart
{
    int val [24];
    int k;
    Tpart *lst;

};
char com[100];
Tpart stk[1024];
int Pop(Tpart *p)
{
    if(p->k>0) return p->val[--(p->k)];
    else
    {
        Tpart *e=p;
    p=p->lst;
    delete e;
    return p->val[--(p->k)];
    }};
void Push(Tpart *p, int val)
{
    if((p->k)<24) (p->val)[(p->k)++]=val;
        else
    {
        Tpart *uk= new Tpart;
        uk->lst=p;
        p=uk;
        p->k=0;
        (p->val)[(p->k)++]=val;
        }
    return;
}
int main() {

    int n; cin>>n;
    for(int j=0;j<n;j++)
    {
        cin>>com;
        if (strcmp(com,"PUSH")==0)
        {
            cin>>nm>>tp;
            Push(&stk[nm-1],tp);
            }
        if (strcmp(com,"POP")==0)
                {
                    cin>>nm;
                    cout<<Pop(&stk[nm-1])<<endl;}
        }
    return 0;
}

Just give me some hint pls: intueor19@gmail.com
I really don't understand what is wrong... It passes all tests on that forum but still has WA15

#include <iostream>
#include <vector>

using namespace std;

vector < int > pm (30, 0);
vector < vector < char > > d (31, vector < char > (1000000, 0));
int n;

void printAnswer (int, int);

int main () {
    cin >> n;

    pm[0] = 1 % n;
    for (int i = 1; i < 30; ++i)
        pm[i] = (pm[i - 1] * (10 % n)) % n;

    d[0][0] = 1;
    char found = 0;

    for (int i = 1; i <= 30; ++i) {
        int m1 = pm[i - 1];
        int m2 = ((2 % n) * pm[i - 1]) % n;

        if (d[i - 1][(n - m1) % n] != 0) {
            printAnswer (1, i);
            found = 1;
            break;
        }

        if (d[i - 1][(n - m2) % n] != 0) {
            printAnswer (2, i);
            found = 1;
            break;
        }

        for (int j = 0; j < n; ++j) {
            if (d[i - 1][j] == 0)
                continue;

            d[i][(j + m2) % n] = 2;
            d[i][(j + m1) % n] = 1;
        }
    }

    if (!found)
        cout << "Impossible";

    return 0;
}


void printAnswer (int digit, int lvl) {
    int k = 0;
    int x, j;

    while (lvl != 0) {
        cout << (int)digit;
        j = ((digit % n) * pm[lvl - 1]) % n;
        x = (k >= j) ? (k - j) : (n - j + k);
        digit = d[lvl - 1][x];
        k = x;
        --lvl;
    }

    return;
}

I got AC with other code but I still don't understand what's wrong with this one. Help me PLS!!!

Edited by author 09.02.2014 19:37