can you find "iostream" in any of those paths?
Yes. It's located in /usr/include/c++/ directory, which is among the ones invoked by infer
Atamba
Atamba
When I run:
sudo find /* | grep -i iostream
I get this output:
/opt/infer-linux64-v1.1.0/lib/infer/facebook-clang-plugins/clang/install/include/c++/v1/iostream
find: ‘/run/user/1000/doc’: Permission denied
/usr/include/c++/10/iostream
/usr/include/glib-2.0/gio/gsimpleiostream.h
/usr/include/glib-2.0/gio/giostream.h
/usr/include/glib-2.0/gio/gfileiostream.h
/usr/include/taglib/tiostream.h
I've trimmed the output.
Steven
where is /usr/include/c++/10/
Atamba
where is /usr/include/c++/10/
There's a line in https://t.me/programminginc/475357 that has it.
Atamba
I know, but seems this path doesn't exist in
https://t.me/programminginc/475352
Sure. It's not listed there. Do we have a fix for this? Could it be a clang thing?
Steven
would you try add -include instruction to the compile commands
Steven
it seems to analyze your command, then migrate to its own clang
Atamba
Also, a side check. When I've filtered the output using:
find /* | grep -i '/iostream' 1> list.txt 2>/dev/null
I just realized that the header file is actually contained in the infer files.
└──╼ $more list.txt
/opt/infer-linux64-v1.1.0/lib/infer/facebook-clang-plugins/clang/install/include/c++/v1/iostream
/usr/include/c++/10/iostream
/usr/lib/python3/dist-packages/tornado/test/iostream_test.py
/usr/lib/python3/dist-packages/tornado/iostream.py
Atamba
But, it's still invisible to the g++,gcc compilers.
Deepak Chaurasia
Hay whats the output of 10%10 1 or 0
SC0UNDREL
Deepak Chaurasia
#include <stdio.h>
int main() {
int n, r, sum = 0;
scanf("%d", &n);
while(n > 0 )
{
r = n % 10;
sum = sum + r;
n = n / 10;
}
printf("%d", sum);
return 0;
}
Deepak Chaurasia
Whats the output if enter 100
artemetra 🇺🇦
run and see
Deepak Chaurasia
It should 0 as per the program
Deepak Chaurasia
0+0
Deepak Chaurasia
Is zero
Deepak Chaurasia
Deepak Chaurasia
Sorry my bad
Deepak Chaurasia
0
Deepak Chaurasia
Sorry for misstype too much i am confusing
Void
char a[50];
int i,j;
for(i=0; ;i++)
{
scanf("%c",&a[i]);
if(i=='\n')
{break;
}
}
Void
Guys is there anything wrong with my code
Void
It can only read up to the tenth character
Pavel
char a[50];
int i,j;
for(i=0; ;i++)
{
scanf("%c",&a[i]);
if(i=='\n')
{break;
}
}
you compare i with '\n' which has ascii code of 10. You probably wanted to compare a[i] with '\n'
https://www.asciitable.com
Void
Atamba
char a[50];
int i,j;
for(i=0; ;i++)
{
scanf("%c",&a[i]);
if(i=='\n')
{break;
}
}
rewritten.
char a[50];
scanf("%s",a);
Quite does the same.
Void
rewritten.
char a[50];
scanf("%s",a);
Quite does the same.
But the question I'm working on requires counting the number of characters and numbers
Void
So i have to use %c
Atamba
Void
Sure, just thought getchar() function would do fine too.
Yeah,i will try to do it again with getchar().
Atamba
I just like new ideas here.
Daulet
Can somebody explain me what that macros does?
#pragma once
#include <utility>
#include <tuple>
#include <type_traits>
namespace Platform::Interfaces
{
#define THIS_REFERENCE_WRAPPER_METHODS(MethodName, TWrapped) \
constexpr auto&& MethodName() & { return static_cast<TWrapped&>(*this); } \
constexpr auto&& MethodName() && { return static_cast<TWrapped&&>(*this); } \
constexpr auto&& MethodName() const & { return static_cast<const TWrapped&>(*this); } \
constexpr auto&& MethodName() const && { return static_cast<const TWrapped&&>(*this); }
#define VARIABLE_WRAPPER_METHODS(MethodName, VariableName) \
constexpr auto&& MethodName() & { return VariableName; } \
constexpr auto&& MethodName() && { return VariableName; } \
constexpr auto&& MethodName() const & { return VariableName; } \
constexpr auto&& MethodName() const && { return VariableName; }
#define EXTENDED_BASE_TYPE(TExtended, TExtendedBase, TExtendable, TFirstExtender, TExtenders) \
TFirstExtender< \
std::conditional_t< \
sizeof...(TExtenders) >= 2, \
TExtended<TExtendable, TExtenders...>, \
std::tuple_element_t< \
0, \
std::tuple<TExtenders<TExtendedBase<TExtendable>>...> \
> \
> \
>
#define DECORATED_BASE_TYPE(TDecoratedBase, TFacade, TDecorated, TFirstDecorator, TDecorators)\
TFirstDecorator< \
TFacade, \
std::conditional_t< \
sizeof...(TDecorators) >= 2, \
TDecoratedBase<TFacade, TDecorated, TDecorators...>, \
std::tuple_element_t< \
0, \
std::tuple<TDecorators<TFacade, TDecorated>...> \
> \
> \
>
#define USE_ALL_BASE_CONSTRUCTORS(TSelf, TBase) \
template <typename ...TParams> \
TSelf(TParams&&... params) : TBase(std::forward<TParams>(params)...) {}
}
Ludovic 'Archivist'
@QNeko Can you?
Not without a headache rn, I would have to preprocess the thing in my head since I am not home
Daulet
Not without a headache rn, I would have to preprocess the thing in my head since I am not home
Ok thanks for your answer. I wish you check this in more comfortable conditions
💕Toomi💕
Do you know how we use sifill??with #include <iomanip>
💕Toomi💕
???
S
Hyy
S
I m stuck in a problem someone help me
GAURAV
Ekal
Hello im a beginner in c language. Im currently making a final year project can u help me with this coding...
Mark
Hey everybody
Naufal
hello everyone, nice to meet you, here I am as a beginner and want to learn programming, and am looking for a complete c programming cheat sheet, if you have one, I beg you to ask, thank you
Naufal
does anyone have a cheat sheet c programming here ?
Yui
klimi
#paste please before posting such wall of text read the rules
Kriss
https://stackoverflow.com/questions/74002669/what-can-i-do-to-reduce-the-runtime-of-my-code
Kriss
https://stackoverflow.com/questions/74002669/what-can-i-do-to-reduce-the-runtime-of-my-code
How can i reduce the runtime of my code?
Anonymous
https://stackoverflow.com/questions/74002669/what-can-i-do-to-reduce-the-runtime-of-my-code
Show me the exact problem statement.
Anonymous
Hello people I'm having a hard time learning asio. I need resources for help
Pavel
How can i reduce the runtime of my code?
The first comment is good in my opinion, you need to learn how to use profiler to see where are the slow parts in your code.
First, it will give you faster feedback of what is slow and what is not, which is important for learning.
Second, professionals use profilers/debuggers/sanitizers, they don't just stare at their code trying to understand what is wrong, they use tools to measure and visualize when they can.
Anonymous
https://codeforces.com/contest/1703/problem/D
You are using the wrong data structures.
I would approach this problem this way:
First I would store all the input strings in an unordered_set along with the vector.
Then I will iterate through each string in the vector and for each string, I will iterate through its length and divide it up into two substrings. I will check if the two substrings are present in the unordered_set and mark its as 1 if that is the case. If I finish iterating without success, then I mark it as 0.
For ex I will split the string abcd as a &bcd, ab&cd and abc&d and then check the unordered_set. This is much faster than your solution
Kriss
The first comment is good in my opinion, you need to learn how to use profiler to see where are the slow parts in your code.
First, it will give you faster feedback of what is slow and what is not, which is important for learning.
Second, professionals use profilers/debuggers/sanitizers, they don't just stare at their code trying to understand what is wrong, they use tools to measure and visualize when they can.
okay , i will have to learn how to use profiler than , thanks
Kriss
You are using the wrong data structures.
I would approach this problem this way:
First I would store all the input strings in an unordered_set along with the vector.
Then I will iterate through each string in the vector and for each string, I will iterate through its length and divide it up into two substrings. I will check if the two substrings are present in the unordered_set and mark its as 1 if that is the case. If I finish iterating without success, then I mark it as 0.
For ex I will split the string abcd as a &bcd, ab&cd and abc&d and then check the unordered_set. This is much faster than your solution
that is a good way to solve , but i have to first learn unordered_set, thanks, i will try this approach for sure after learning unordered_set
Anonymous
that is a good way to solve , but i have to first learn unordered_set, thanks, i will try this approach for sure after learning unordered_set
You shouldn't be doing Competitive Programming (I don't like it though) without being familiar with data structures and algorithms.
Pavel
okay , i will have to learn how to use profiler than , thanks
If you see that some part is slow according the profiler but can't figure out why, come here and maybe we can help. But it would be good in any case if you can narrow down the problem yourself before that.
Kriss
You shouldn't be doing Competitive Programming (I don't like it though) without being familiar with data structures and algorithms.
i am leaning STL , so i was just solving some problems using the concepts i learn
Kriss
If you see that some part is slow according the profiler but can't figure out why, come here and maybe we can help. But it would be good in any case if you can narrow down the problem yourself before that.
it also boosts my confidence , when i solve a problem or bug by myself
Kriss
You shouldn't be doing Competitive Programming (I don't like it though) without being familiar with data structures and algorithms.
i would keep that in mind and stick to the learning process, thanks again
Daulet
Maybe friend functions can do it