India

man gets getline

Not really, it's mostly used in schools, and very few ones. Ubuntu is way to go now.

no sir, have'nt studied them yet and don't know how to use them

Have you rounded your cost correctly? As in, instead of using itotal, have you tried cieling or ground?

He makes an int divisio tho

int/int returns int

We don't know if he's on linux

You can transform one of the numbers in float to solve that

no sir currently working on windows 10 i want to use linux but still i have not come to the conclusion as to how much memory i have to allot to it while dual booting my laptop also i don't know the risks involved in dual booting

100GB is more than enough.

sir which one

You can put tipp/100.0 or (float)tipp/100

sir what does this float in brackets next to a variable mean?

no sir currently working on windows 10 i want to use linux but still i have not come to the conclusion as to how much memory i have to allot to it while dual booting my laptop also i don't know the risks involved in dual booting

you can try WSL

that is type conversion

no sir currently working on windows 10 i want to use linux but still i have not come to the conclusion as to how much memory i have to allot to it while dual booting my laptop also i don't know the risks involved in dual booting

Risks are little. But if you need only console without gui, consider wsl

Mam is it effecient or i should go for dual boot

Does using % operator in a loop cause TLE?

Does using % operator in a loop cause TLE?

I am getting TLE in a certain problem . I searched for the reasons . Someone mentioned using the "%" operator often can cause TLE

Time limit exceeded

I AM GETTING TLE(Time limit exceeded) IN THE ONLINE JUDGE ,BUT THE CODE WORKS FINE  . WHAT IMPROVEMENTS CAN BE DONE TO MAKE THE CODE MORE EFFICIENT ? problem- https://www.codechef.com/SEPT19B/problems/FIBEASY my solution- #include <bits/stdc++.h> using namespace std; int main()  {   int t;   cin>>t;   while(t--) {      int n,i;     cin>>n;     int a[n];     a[0]=0;     a[1]=1;  for(i=2;i<n;i++)  {       a[i]=a[i-1]+a[i-2];      a[i]=a[i]%10;      }  int j=0;  int b=n/2;  while(b--)  {      j=0;      for(i=0;i<n;i++)  {     if(i%2!=0)   {         a[j]=a[i];       j++;   }    }  n=j;  }  cout<<a[0]; } return 0; }

I AM GETTING TLE(Time limit exceeded) IN THE ONLINE JUDGE ,BUT THE CODE WORKS FINE  . WHAT IMPROVEMENTS CAN BE DONE TO MAKE THE CODE MORE EFFICIENT ? problem- https://www.codechef.com/SEPT19B/problems/FIBEASY my solution- #include <bits/stdc++.h> using namespace std; int main()  {   int t;   cin>>t;   while(t--) {      int n,i;     cin>>n;     int a[n];     a[0]=0;     a[1]=1;  for(i=2;i<n;i++)  {       a[i]=a[i-1]+a[i-2];      a[i]=a[i]%10;      }  int j=0;  int b=n/2;  while(b--)  {      j=0;      for(i=0;i<n;i++)  {     if(i%2!=0)   {         a[j]=a[i];       j++;   }    }  n=j;  }  cout<<a[0]; } return 0; }

I AM GETTING TLE(Time limit exceeded) IN THE ONLINE JUDGE ,BUT THE CODE WORKS FINE  . WHAT IMPROVEMENTS CAN BE DONE TO MAKE THE CODE MORE EFFICIENT ? problem- https://www.codechef.com/SEPT19B/problems/FIBEASY my solution- #include <bits/stdc++.h> using namespace std; int main()  {   int t;   cin>>t;   while(t--) {      int n,i;     cin>>n;     int a[n];     a[0]=0;     a[1]=1;  for(i=2;i<n;i++)  {       a[i]=a[i-1]+a[i-2];      a[i]=a[i]%10;      }  int j=0;  int b=n/2;  while(b--)  {      j=0;      for(i=0;i<n;i++)  {     if(i%2!=0)   {         a[j]=a[i];       j++;   }    }  n=j;  }  cout<<a[0]; } return 0; }

You have O(n²) That's why you have TLE

I don't know how to optimize a code and analysis of algorithms

What improvement can be done in my code

I can only solve 1st problem in long challenges . This time it would be 0

How can one improve himself I am a beginner

How can one improve himself I am a beginner

How can one improve himself I am a beginner

Hi guys, if i Need to create a std::function<void()> with void(...) with infinite types i get an error like: void f(int m){ } void r(std::function<void(...)> n){ } int main(){ r(f); } That's the code how its possibile to solve this?

Hi guys, if i Need to create a std::function<void()> with void(...) with infinite types i get an error like: void f(int m){ } void r(std::function<void(...)> n){ } int main(){ r(f); } That's the code how its possibile to solve this?

Don't use c-style ... in c++ please It's veryyy unsafe

What can i use?

Hi guys, if i Need to create a std::function<void()> with void(...) with infinite types i get an error like: void f(int m){ } void r(std::function<void(...)> n){ } int main(){ r(f); } That's the code how its possibile to solve this?

Google for variadic templates But it is can be a hard topic So, tell what are trying to solve?

template<typename ...T> void r(std::function<void(T&&...)> n){}

template<typename ...T> void r(std::function<void(T&&...)> n){}