2
jsesi
jesfi

2
tvtx
vtix

2
qfqejjfhrhono
fqwejjfhrhono

2
mciqibekphze
mcqibmekphze

2
affjoromdta
affjromjdta

all answers should contain both strings

I've created file with tests, it seems all checks passes locally, but not in Judge
here is my code:
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

typedef struct list_node{
    long int number;
    struct list_node * previous;
} list_node_t;

list_node_t * create_root(long int number);
list_node_t * create_list(long int number, list_node_t * previous);

int main() {
    long int a;
    list_node_t * current = NULL;
    while (scanf("%ld", &a) != EOF) {
        if (current == NULL) {
            current = create_root(a);
        } else {
            current = create_list(a, current);
        }
    }

    while (current != NULL) {
        printf("%.4Lf\n\r", sqrtl(current->number));
        current = current->previous;
    }

    return 0;
}

list_node_t * create_root(long int number)
{
    list_node_t *lt = malloc(sizeof(list_node_t));

    lt->number = number;
    lt->previous = NULL;

    return lt;
}

list_node_t * create_list(long int number, list_node_t * previous)
{
    list_node_t *lt = create_root(number);

    lt->previous = previous;

    return lt;
}

#include <iostream>
#include <vector>
#include <string>
using namespace std;

int box(char a)
{
    switch (a)
    {
    case 'A': case 'P': case 'O': case 'R':
        return 1;
    case 'B': case 'M': case 'S':
        return 2;
    default:
        return 3;
    }
}


int main()
{
    int n;
    cin >> n;
    string a;
    vector<char>f(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a;
        f[i] = a[0];
    }
    int steps = 0;
    int pos = 1;
    for (int i = 0; i < n; i++)
    {
        steps += abs(pos - box(f[i]));
        pos = box(f[i]);
    }
    cout << steps << endl;


    return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <unordered_map>
#include <map>
#include <string>
using namespace std;
int main()
{
    vector<vector<int>> v(4, vector<int>(4));
    vector<int> col(4);
    for(int i= 0 ; i < 4; i++)
    {
        for(int j = 0; j < 4; j++)
        {
            cin >> v[i][j];
            if(v[i][j] == 1)
            {
                if(((i == 0 || i == 1) && ((j == 0) || (j == 1))))
                {
                    col[0]++;
                }
                else if((i == 0 || i == 1) && ((j == 2) || (j == 3)))
                {
                    col[1]++;
                }
                else if((i == 2 || i == 3) && (j == 0 || j == 1))
                {
                    col[2]++;
                }
                else
                {
                    col[3]++;
                }
            }
        }
    }
    cout << min(min(col[1] + col[2] + col[3] + col[3], col[2] + col[0] + col[2] + col[3]), min(col[1] + col[2] + col[0] + col[0], col[0] + col[3] + col[1] + col[1]));

}

Here is the right description:

1) A, ..., Z, TRUE, FALSE - are correct boolean expressions;

2) if x and y are correct boolean expressions, then the correct boolean expressions are also:
  (x);  NOT x;  x AND y;  x OR y  (maybe, with some extra spaces).

Edited by author 19.09.2007 23:19

An example from other discussions:

input:
4 3 12
1 2 5
1 3 4
3 4 4

output:
YES

displays the correct answer.
Tell me more examples, please.

In the algorithm, I check loops, two-way roads, cycles, and then look for a way longer than necessary.

UPD: WA#18

Edited by author 20.03.2019 19:17

Java coders:
Use BufferedReader and PrintWriter for IO!

http://acm.timus.ru/status.aspx?space=1&num=1915&author=106686&count=100

;)

Edited by author 23.12.2015 02:45

Edited by author 23.12.2015 02:46

Can anyone give me some clue please?

n = int(input())
d = {}
for i in range(n):
    s = input()
    if s not in d:
        d[s] = 0
    d[s] += 1
ans = sorted(d.items(), key=lambda kv: kv[1])[-1][0]
print(ans)

a

use prim or kruskal can solve it.

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define F first
#define S second
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define pq priority_queue
#define pb push_back
#define watch(x) cout << (#x) << " is " << (x) << endl
#define ALL(a) (a.begin()),(a.end())
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORI(a,b) for(int i = a; i<b; i++)
#define fastio ios::sync_with_stdio(0); cin.tie(NULL);
const int INF = 0x3f3f3f3f;


struct ar{
    ll x,y;
};


ar v[100100];
int p[100100] = {0};
ll id[100100];
ll sz[100100];
ll num;

ll find(ll x){
    if(id[x] == x) return x;
    return id[x] = find(id[x]);
}

void join(ll x, ll y){
    ll p = find(x);
    ll q = find(y);
    if(p==q) return;
    num--;
    if(sz[p] > sz[q]) {
        ll t = q; p = q; q = t;
    }
    id[p] = q;
    sz[p] += sz[q];
}




    int main(){
        fastio
        ll n,m,i,q;
        cin >> n >> m;
        num = n;

        ll arf[100100];
        ll ans[100100];



        FOR(i,m){
            cin >> v[i+1].x >> v[i+1].y;
        }
        FOR(i,m+1){
            id[i+1] = i+1;
            sz[i+1] = 1;
        }
        cin >> q;
        FOR(i,q){
            ll x;
            cin >> x;
            p[x] = 1;
            arf[q-i] = x;
        }

        FOR(i,m+1){
            if(i==0) continue;
            if(!p[i]){
                join(v[i].x, v[i].y);
            }
        }

        ans[q] = num;
        for(int i = 1; i<=q; i++){
            join(v[arf[i]].x, v[arf[i]].y);

            ans[q-i] = num;

        }

        for(int i = 1; i<=q; i++){
            cout << ans[i] << " ";
        }



        cout << "\n";


        return 0;
    }











Edited by author 17.03.2019 04:30

#include <iostream>;
#include <vector>;
#include <string>;
#include <sstream>;
#include <iomanip>
using namespace std;
int main()
{
    int temp;
    vector <double> answers;

    string s;
    getline(cin, s);

    istringstream iss(s);
    while (iss >> temp)
    {
        double a = sqrt(temp);
        answers.push_back(a);
    }

    for (int i = answers.size(); i > 0; i--)
    {
        cout << fixed << setprecision(4) << answers[i-1];
        cout << endl;
    }

    system("pause");

    return 0;
}

sorry, I'm just an idiot...

Edited by author 27.03.2019 22:39

I couldn't understand my mistake! On my tests it works correct.



program project1;
var
  n, i : longint;
  r, res, x, y, x1, y1, x0, y0 : extended;
begin
{$IFNDEF ONLINE_JUDGE}
   assign(input, 'input.txt');
   assign(output, 'output.txt');
   reset(input);
   rewrite(output);
{$ENDIF}
  readln(n, r);
  readln(x, y);
  x0:=x;
  y0:=y;
  res:=2*pi*r;
  for i:=1 to n-1 do begin
    readln(x1, y1);
    res:=res+sqrt(sqr(x1-x)+sqr(y1-y));
    y:=y1;
    x:=x1;
  end;
  res:=trunc(res*100)/100;
  write((res+sqrt(sqr(x1-x0)+sqr(y1-y0))):1:2);
{$IFNDEF ONLINE_JUDGE}
   close(input);
   close(output);
{$ENDIF}
end.

Please help me.I always have WA#4.
Give me any tests.
THAnk!!!><

Who knows what is the test 7?
I failed at this test.

[code deleted]

Edited by moderator 29.01.2022 18:45

Ternary search

for n:=1 to 50 do :
1
2
2.15470053837925
2.41421356237309
2.70130161670408
3
3.30476487096249
3.61312592975275
3.92380440016309
4.23606797749979
4.54946553288422
4.86370330515627
5.17858146886038
5.49395920743493
5.80973434474413
6.12583089548301
6.44219115175181
6.75877048314363
7.07553382097426
7.39245322149966
7.7095061398084
8.02667418333227
8.34394219610391
8.66129757554039
8.97872975555948
9.29622981055875
9.61379014847791
9.93140427038051
10.2490665803026
10.5667722335056
10.8845170143696
11.2022972373783
11.520109666252
11.8379514474594
12.155820055209
12.4737132456699
12.7916290186635
13.109565585441
13.4275213414455
13.7454948431824
14.0634847884921
14.3814899996548
14.6995094088628
15.0175420456841
15.3355870262037
15.6536435435869
15.9717108598527
16.2897882986785
16.6078752390897
16.9259711099087