Помогите ,пожалуйста , что не так?
#include <iostream>
#include <string>
using namespace std;
int main() {
    int n, s = 0;
    cin >> n;
    string a[1000];
    for (int i = 0; i < n; i++) {
        getline(cin, a[0]);
        for (int j = n + 1; j < n; j++) {
            if (a[i] == a[j]) {
                break;
                s++;
            }
        }
    }
    cout << s;
    return 0;
}


Edited by author 02.12.2019 20:46

I passed all test cases mentioned in the discussion.

There are 4 tests in my algorithm:
- is there a loop (from M and N) ?
- is the graph connected ?
- is there a cycle?
- for each component of the graph:
  find the longest path and compare the length with S

any hint?

Edited by author 06.09.2017 11:02

Edited by author 06.09.2017 11:02

10
RGRGRBGBGB

Possible answer:
7
4 6
3 6
2 6
1 6
1 7
1 8
1 9

will somebody helps me?

I just rewritten my AC solution in python (it was originally written in Java) and I got Runtime Error on test #7. Any hint on why this happen ? Any test ? It gives me the same results as my Java solution ..

solution found
1
1

Edited by author 16.12.2019 16:48

Edited by author 16.12.2019 16:51

#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>

using namespace std;

int main() {
    cout << setprecision(4);
    vector<double> v;
    double n;
    while (cin >> n)
        v.push_back(n);
    for (int i = v.size() - 1; i >= 0; i--)
        cout << sqrt(v[i]) << endl;
}

a, b =map(int, input().split())
print(a + b)

a = int(input())
c= a//7
d=c*7
print(a-d)

Если мы можем оставлять часть груза в городах(любое кол-во груза), то ответ будет 24(может и меньше). Ошибка в условии или некорректно сформулировано условие?

Please read "if a student has got satisfactory marks, the scholarship is not given" this statement again and again which means if in any of the subject a student gets 3.0 he will not get any scholarship.

--------------------------------------------------
Пожалуйста, прочитайте «если студент получил удовлетворительные оценки, стипендия не предоставляется», это утверждение снова и снова означает, что если по какому-либо предмету студент получает 3,0 балла, он не получит стипендию.

import java.util.Arrays;
import java.util.Scanner;

public class ppppp {
    public static void main(String[] args) {

            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int k = in.nextInt();
            int g = in.nextInt();

            if (0 <= n && n  <= k && k <= g && g <= 100){
            int[] mas = {n, k, g};
            boolean isSorted = false;
            int buf;
            while (!isSorted) {
                {
                    isSorted = true;
                    for (int i = 0; i < mas.length - 1; i++) {
                        if (mas[i] > mas[i + 1]) {
                            isSorted = false;

                            buf = mas[i];
                            mas[i] = mas[i + 1];
                            mas[i + 1] = buf;
                        }
                    }
                }

            }


            int da = mas[0] - mas[1] * mas[2];
            System.out.println(da);
        }
    }
}

lol

Edited by author 15.12.2019 12:57

Edited by author 15.12.2019 12:57

Edited by author 15.12.2019 12:57

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

int main()
{
    unsigned long long int n;
    while(cin >> n)
    {
        cout << fixed << setprecision(9) << sqrt(n) << "\n";
    }
return 0;
}

Add test.
My solution O(n^2) on python AC

Check all 2x2 squares
A[i][j]   A[i][j+1]
A[i+1][j] A[i+1][j+1]

Make sure you always can cover this square at least one of the methods
x x
y y

or

x y
x y

Edited by author 10.12.2019 14:13

Edited by author 10.12.2019 14:15

Check that you are dealing with an undirected graph!

You need to minimize number of visited islands firstly.

Test:
3 3
1 3
1 3 99
1 2 0
2 3 0

Answer:
2 0.99
1 3

Let we visit towns by distance ascending: 1, 2, 3
So total fine is : (6+5) + (5*2+3*2) + 3 = 11 + 16 + 3 = 30
Where am I wrong?