Подскажите, пожалуйста, что не так с кодом? Wrong answer, тест 3.

Edited by author 09.10.2022 19:48

Edited by author 09.10.2022 19:48

Amount of pieces to move, edges to make euler path(only pieces with (in[i] + out[i]) > 0) and amount of components

Try this test (if you look neighbour cells in order from -1 left -1 up (11 oclock) clockwise)
4 4
#A#.
#A!.
##.#
.*$.

dfs or bfs is the correct idea?
oh, i'm done with it (:
Edited by author 15.10.2012 15:14

Edited by author 15.10.2012 15:22

Если я правильно понимаю, надо посчитать количество яиц, необходимых для поиска E бинаркой, а если оно окажется больше количества яиц в гнезде, то вывести количество этажей?

#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;

int main (){
    double Input=0 ;
    double number[] ;
    int counter=0;

    while ( cin >> Input && Input != EOF){
        number[counter] = Input;
        cout << number[counter];
        counter++ ;
    }

    for (int i=counter ; i>0; i--){
        cout << setprecision(4) << sqrt (number[counter]) << endl;
    }
}

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

signed main(){
  int n;
  cin>>n;
  int sum=0;
  for(int i=0;i<n;i++){
    int x;
    cin>>x;
    sum+=x;
  }
  double cnt1=(double)sum/(double)n;
  if(cnt1==3){
    cout<<"None";
  }else if(cnt1==5){
    cout<<"Named";
  }else if(cnt1>=4.5 && cnt1!=5){
    cout<<"High";
  }else if(cnt1!=3 && cnt1!=5 && cnt1<4.5){
    cout<<"Common";
  }
}
getting a wrong answer on test 8

i use clear binmask as in 1122, but in 1122 u can chek for answer your board by every change of bit, BUT in THIS problem, u need check board when you finish your changes with bits.
Example u have bits 1101 and next is 1110,
u firstly change 1111 and then 1110 (two iterations because we need to do this iterations on board)
so if u do check on every that iteration its wa19

this is can be possible

On test
bwwb
bbwb
bwwb
bwww

My program gives 3, but right ans is 4
this test from 1060

//Input:
12 10
0 0 0 0 0 0 0 0 0 0
0 0 0 1 1 1 1 0 0 0
0 0 2 3 1 1 1 0 0 0
0 0 2 4 2 0 0 0 0 0
0 0 0 2 3 1 0 0 0 0
0 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

//Correct output:
WWWWW
WRWWW
WWRWW
WWWWW
WWWWW
WWWWW

WRRW
WRWW
WWWW
WWWW
WWWW

RWW
WWW
WWW
WWW

RW
WW
WW

W
W

It's written that the numbers don't exceed 15000, but it's most likely that the test 2 contains number 15001, cuz i was receiving WA until i changed border to 163847 (is 15001st prime number)

Could anybody help me? I have WA at 3th test .I tried many test and answers were correct .I also tried this test and answer was correct:
5
-5 0
0 1
1 2
2 3
4 5
3 4
10 49000
0 0

The only formulas you need is a distance between two points to find the answer and a distance between point and a line to check if answer exists

3 6
1 2
2 3
3 1
4 5
5 6
6 4

For every pair of points, build circles on them and find their collision points(<= 2). Then for every collision point find number of points on distance < r to it. Maximum is the answer

#include <stdio.h>
int main()
{
int t1,t2,n;
int c=0;
scanf("%d %d", &t1, &t2);
for (int i=0; i<=9; i++)
{
    scanf("%d", &n);
    c+=(n*20);
}

t2-=c;
if (t2<t1)
{
   printf("Dirty debug :(");
}
else
{
    printf("No chance.");
}


}

Any help?

If you have WA 13, try this test:
1
a
1
b....ba , where b repeated ~130000 times

If you've got rte 27: m can be more than 10000