这是显示RUNTIME错误。 [英] IT IS SHOWING RUNTIME error.

问题描述

给定N个元素的数组A（可能包含重复项）和正整数K.任务是计算在数组中恰好发生地板（N / K）次数的元素数。



输入：

第一行输入包含多个测试用例。对于每个测试用例，将有两行，第一行包含N和K，第二行包含数组元素。



输出：

对于每个测试用例，打印数组中元素的数量，这些元素恰好发生在地板上（N / K）次。



约束条件：

1 < = T< = 100

1< = N< = 103

1< = Ai< = 103

1< = K< = 103



测试用例：

1

5 2

1 1 1 1000 1000



我尝试过：

 #include< bits / stdc ++。h> 
 using namespace std; 
 int countSpecials（int []，int，int）; 
 int main（）{
 int testcase; 
 cin>>测试用例; 
 while（testcase  - ）{
 int sizeof_array，K; 
 cin>> sizeof_array>> k; 
 int arr [sizeof_array]; 
 for（int i = 0; i< sizeof_array; i ++）{
 cin>> ARR [I]; 
} 
 cout<< countSpecials（arr，sizeof_array，K）<< ENDL; 
} 
返回0; 
} 
 int countSpecials（int arr []，int sizeof_array，int K）{
 
 int f = floor（sizeof_array / K），count = 0; 
 int i，key [1000] = {0}，p; 
 for（i = 0; i< sizeof_array; i ++）
 p = arr [i]; 
 {
 if（p> = 1&& p< = 1000）
 key [p] ++; 
} 
 for（i = 1; i< sizeof_array; i ++）
 {
 if（f == key [i]）
 count ++; 
} 
返回计数; 
} 

解决方案

Quote：

我更新的问题是它显示错误的答案

如何纠正它？

简单：写出正确的代码。



编译并不意味着你的代码是正确的！ ：笑：

将开发过程想象成编写电子邮件：成功编译意味着您使用正确的语言编写电子邮件 - 例如英语而不是德语 - 而不是电子邮件包含您的邮件想发送。



所以现在你进入第二阶段的发展（实际上它是第四或第五阶段，但你将在之后的阶段进入）：测试和调试。



首先查看它的作用，以及它与你想要的有何不同。这很重要，因为它可以为您提供有关其原因的信息。例如，如果程序旨在让用户输入一个数字并将其翻倍并打印答案，那么如果输入/输出是这样的：

输入预期输出实际输出
 1 2 1 
 2 4 4 
 3 6 9 
 4 8 16 

然后很明显问题出在将它加倍的位 - 它不会将自身加到自身上，或者将它乘以2，它会将它自身相乘并返回输入的平方。

所以，你可以查看代码和很明显，它在某处：

  int   Double （ int   value ）
 {
  return   value  * 值; 
} 

一旦你知道可能出现的问题，就开始使用调试器找出原因。在方法的第一行放置一个断点，然后运行你的应用程序。当它到达断点时，调试器将停止，并将控制权移交给您。您现在可以逐行运行代码（称为单步执行）并根据需要查看（甚至更改）变量内容（哎呀，您甚至可以更改代码并在需要时再试一次）。 />
在执行代码之前，请考虑代码中的每一行应该做什么，并将其与使用Step over按钮依次执行每一行时实际执行的操作进行比较。它符合您的期望吗？如果是这样，请转到下一行。

如果没有，为什么不呢？它有什么不同？

希望这可以帮助你找到代码的哪个部分有问题，以及问题是什么。

这是一项技能，它是一个值得开发的，因为它可以帮助你在现实世界和发展中。和所有技能一样，它只能通过使用来改善！

您的 countSpecials 功能不正确。

Quote：

for（i = 0; i< sizeof_array; i ++）<如果（p> = 1&& p< = 1000）

key [p] ++;

}

这可能会执行你不希望的方式：

• 迭代适用于 p = arr [i]; statememt。
• key [p]当 p = 1000 时，++ 超出范围。

< br $> b $ b

尝试

  #include   <   iostream  > ;  
   #include   <   vector  >  
   #include   <  数组 >  
  使用  namespace  std; 
 
  constexpr   size_t  L =  1000 ; 
 
  size_t  count_specials（ const  vector< int>& v， size_t  k）
 {
  int  f = v.size（）/ k; 
 array< int，L>频率{}; 
  for （ auto  x：v）
 ++ freq [x- < span class =code-digit> 1 ]; 
 
  size_t  count =  0 ; 
 
  for （ auto  x：freq）
  if （x == f）
 ++ count; 
 
  return  count; 
} 
 
  int  main（）
 {
  size_t  T; 
 cin>>吨; 
  while （T--）
 {
  size_t  N， k; 
 cin>> N>> k; 
 vector< int> v; 
  for （ size_t  n =  0 ; n< N; ++ n）
 {
  int  x; 
 cin>> X; 
 v.push_back（x）; 
} 
 cout<< count_specials（v，K）; 
} 
} 

首先，你在互联网上找到的问题上寻求帮助，明智的做法是链接到原始问题。

算上特刊 - Java |实践| GeeksforGeeks [ ^ ]



学会正确缩进代码，显示其结构，有助于阅读和理解。它还有助于发现结构错误。

  #include   < span class =code-keyword><   bits / stdc ++。h  >  
  使用 命名空间标准; 
  int  countSpecials（ int  []， int ， int ）; 
  int  main（）{
  int  testcase; 
 cin>>测试用例; 
  while （testcase  - ）{
  int  sizeof_array，K; 
 cin>> sizeof_array>> k; 
  int  arr [sizeof_array]; 
  for （ int  i =  0 ; i< sizeof_array; i ++）{
 cin>> ARR [I]; 
} 
 cout<< countSpecials（arr，sizeof_array，K）<< ENDL; 
} 
  return   0 ; 
} 
  int  countSpecials（ int  arr []， int  sizeof_array， int  K）{
 
  int  f = floor（sizeof_array / K），count =  0 ; 
  int  i，key [ 1000 ] = { 0 }，p; 
  for （i =  0 ; i< sizeof_array; i ++）
p = arr [一世]; 
 {
  if （p> =  1 && p< =  1000 ）
 key [p] ++; 
} 
  for （i =  1 ; i< sizeof_array; i ++）
 {
  if （f == key [i]）
 count ++; 
} 
 返回计数; 
} 

专业程序员的编辑器具有此功能，其他功能包括括号匹配和语法高亮。

Notepad++主页 [ ^ ]

ultraedit [ ^ ]

-----

您的代码行为不正常你期望，或者你不明白为什么！



有一个几乎通用的解决方案：一步一步地在调试器上运行你的代码，检查变量。

调试器在这里向您展示您的代码正在做什么，您的任务是与它应该做什么进行比较。

调试器中没有魔法，它不知道是什么你的代码应该做，它没有发现错误，它只是通过向你展示发生了什么来帮助你。当代码没有达到预期的效果时，你就接近了一个错误。

要查看你的代码在做什么：只需设置断点并查看代码是否正常运行，调试器允许你执行第1行第1行，并在执行时检查变量。



调试器 - 维基百科，免费的百科全书 [ ^ ]


掌握调试Visual Studio 2010 - 初学者指南 [ ^ ]

使用Visual Studio 2010进行基本调试 - YouTube [ ^ ]



1.11 - 调试程序（步进和断点）|学习C ++ [ ^ ]



调试器仅显示您的代码正在执行的操作，您的任务是与应该执行的操作进行比较。

Given an array A (may contain duplicates) of N elements and a positive integer K. The task is to count the number of elements which occurs exactly floor(N/K) times in the array.

Input:
First line of input contains number of testcases. For each testcase, there will be two lines, first of which contains N and K and second line contains array elements.

Output:
For each testcase, print the count of elements in the array which occurs exactly floor(N/K) times.

Constraints:
1 <= T <= 100
1 <= N <= 103
1 <= Ai <= 103
1 <= K <= 103

for test case:
1
5 2
1 1 1 1000 1000

What I have tried:

#include <bits/stdc++.h>
using namespace std;
int countSpecials(int[], int, int);
int main() {
	int testcase;
	cin >> testcase;
	while(testcase--){
	    int sizeof_array, K;
	    cin >> sizeof_array >> K;
	    int arr[sizeof_array];
	    for(int i = 0;i<sizeof_array;i++){
	        cin >> arr[i];
	    }
	    cout << countSpecials(arr, sizeof_array, K) << endl;
	}
	return 0;
}
int countSpecials(int arr[], int sizeof_array, int K){
    
    int f = floor(sizeof_array/K), count = 0;
     int i,key[1000]={0},p;
    for(i=0;i<sizeof_array;i++)
     p=arr[i];
    {
     if(p>=1 && p<=1000)
     key[p]++;
    }
    for(i=1;i<sizeof_array;i++)
    {
        if(f==key[i])
        count++;
    }
    return count;
}

解决方案

Quote:

my updated question is "it is showing wrong answer"
how to correct it?

Simple: Write the correct code.

Compiling does not mean your code is right! :laugh:
Think of the development process as writing an email: compiling successfully means that you wrote the email in the right language - English, rather than German for example - not that the email contained the message you wanted to send.

So now you enter the second stage of development (in reality it's the fourth or fifth, but you'll come to the earlier stages later): Testing and Debugging.

Start by looking at what it does do, and how that differs from what you wanted. This is important, because it give you information as to why it's doing it. For example, if a program is intended to let the user enter a number and it doubles it and prints the answer, then if the input / output was like this:

Input   Expected output    Actual output
  1            2                 1
  2            4                 4
  3            6                 9
  4            8                16

Then it's fairly obvious that the problem is with the bit which doubles it - it's not adding itself to itself, or multiplying it by 2, it's multiplying it by itself and returning the square of the input.
So with that, you can look at the code and it's obvious that it's somewhere here:

int Double(int value)
   {
   return value * value;
   }

Once you have an idea what might be going wrong, start using the debugger to find out why. Put a breakpoint on the first line of the method, and run your app. When it reaches the breakpoint, the debugger will stop, and hand control over to you. You can now run your code line-by-line (called "single stepping") and look at (or even change) variable contents as necessary (heck, you can even change the code and try again if you need to).
Think about what each line in the code should do before you execute it, and compare that to what it actually did when you use the "Step over" button to execute each line in turn. Did it do what you expect? If so, move on to the next line.
If not, why not? How does it differ?
Hopefully, that should help you locate which part of that code has a problem, and what the problem is.
This is a skill, and it's one which is well worth developing as it helps you in the real world as well as in development. And like all skills, it only improves by use!

Your countSpecials function is incorrect.

Quote:

for(i=0;i<sizeof_array;i++)
p=arr[i];
{
if(p>=1 && p<=1000)
key[p]++;
}

This probably executes the way you don't expect:

• Iteration is applied on to p=arr[i]; statememt.
• key[p]++ is out-of-bounds when p = 1000.

Try

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

constexpr size_t L = 1000;

size_t count_specials(const vector<int> & v, size_t k)
{
  int f = v.size()/k;
  array<int, L> freq{};
  for (auto x : v)
    ++freq[x-1];

  size_t count = 0;

  for (auto x : freq)
    if ( x == f)
      ++count;

  return count;
}

int main()
{
  size_t T;
  cin >> T;
  while (T--)
  {
    size_t N, K;
    cin >> N >> K;
    vector <int > v;
    for ( size_t n=0; n<N; ++n)
    {
      int x;
      cin >> x;
      v.push_back(x);
    }
    cout << count_specials(v, K);
  }
}

First of all, wen you ask help on a problem you found on internet, it is wise to give a link to original problem.
Count the Specials - Java | Practice | GeeksforGeeks[^]

Learn to indent properly your code, it show its structure and it helps reading and understanding. It also helps spotting structures mistakes.

#include <bits/stdc++.h>
using namespace std;
int countSpecials(int[], int, int);
int main() {
    int testcase;
    cin >> testcase;
    while(testcase--){
        int sizeof_array, K;
        cin >> sizeof_array >> K;
        int arr[sizeof_array];
        for(int i = 0;i<sizeof_array;i++){
            cin >> arr[i];
        }
        cout << countSpecials(arr, sizeof_array, K) << endl;
    }
    return 0;
}
int countSpecials(int arr[], int sizeof_array, int K){

    int f = floor(sizeof_array/K), count = 0;
    int i,key[1000]={0},p;
    for(i=0;i<sizeof_array;i++)
        p=arr[i];
    {
        if(p>=1 && p<=1000)
            key[p]++;
    }
    for(i=1;i<sizeof_array;i++)
    {
        if(f==key[i])
            count++;
    }
    return count;
}

Professional programmer's editors have this feature and others ones such as parenthesis matching and syntax highlighting.
Notepad++ Home[^]
ultraedit[^]
-----
Your code do not behave the way you expect, or you don't understand why !

There is an almost universal solution: Run your code on debugger step by step, inspect variables.
The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't know what your code is supposed to do, it don't find bugs, it just help you to by showing you what is going on. When the code don't do what is expected, you are close to a bug.
To see what your code is doing: Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute.

Debugger - Wikipedia, the free encyclopedia[^]

Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[^]
Basic Debugging with Visual Studio 2010 - YouTube[^]

1.11 — Debugging your program (stepping and breakpoints) | Learn C++[^]

The debugger is here to only show you what your code is doing and your task is to compare with what it should do.

这篇关于这是显示RUNTIME错误。的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！