What happens if tweaking the multipliers results in a submission failing with the new limits which passed with the old limits? Or will time limits only be increased?

What happens if tweaking the multipliers results in a submission failing with the new limits which passed with the old limits? Or will time limits only be increased?

We will not tighten the multipliers for the duration of the contest (though we may add multipliers for other programming languages), or loosen other ones up.
Cheers!

GREAT!!!

That’s a welcome move for us Java programmers (and I’m sure for others too who use languages not starting with C)

We will not tighten the multipliers for the duration of the contest (though we may add multipliers for other programming languages), or loosen other ones up.
Cheers!

GREAT!!!

That’s a welcome move for us Java programmers (and I’m sure for others too who use languages not starting with C)

I don’t get why these languages get these artificial advantages.

I don’t get why these languages get these artificial advantages.

You dont get it, because you do not understand the limitations of virtual machines and interpreted languages as opposed to compiled languages.
Maybe wikipedia would help you.

You dont get it, because you do not understand the limitations of virtual machines and interpreted languages as opposed to compiled languages.
Maybe wikipedia would help you.

The reason being that many of these languages are slower in one way or the other as compared to C/C++, so we feel that they should be compensated accordingly. Be rest assured that no one will get an artifical advantage because of using a particular language, and only good algorithms(in any language) will be able to pass successfully in the given limits. I hope that answers your concerns.

The reason being that many of these languages are slower in one way or the other as compared to C/C++, so we feel that they should be compensated accordingly. Be rest assured that no one will get an artifical advantage because of using a particular language, and only good algorithms(in any language) will be able to pass successfully in the given limits. I hope that answers your concerns.

Hey Chef, what about “C”aml?

or “C”#?
:-p

Hey Chef, what about “C”aml?

or “C”#?
:-p

@Anonymous Coward

Most probably you haven’t used these languages. Else you wouldn’t have called it an “advantage” in the first place. Try running a code with same logic in C and Java and notice the difference in times.

@Anonymous Coward

Most probably you haven’t used these languages. Else you wouldn’t have called it an “advantage” in the first place. Try running a code with same logic in C and Java and notice the difference in times.

@Anonymous Coward- It appears you are new to programming, cause the question you asked is answered in 8th or 9th grade(at least in ISC I guess). Its great you’re coming on to a site like Codechef for a better exposure! I’d suggest you go and check the best times for one of the trivial problems like Life, Universe, Everything and note the difference in timings.

Apart from the VM etc. I guess Java’s unicode character set which gives a further burden to the programs….

@Anonymous Coward- It appears you are new to programming, cause the question you asked is answered in 8th or 9th grade(at least in ISC I guess). Its great you’re coming on to a site like Codechef for a better exposure! I’d suggest you go and check the best times for one of the trivial problems like Life, Universe, Everything and note the difference in timings.

Apart from the VM etc. I guess Java’s unicode character set which gives a further burden to the programs….

Hi, What is the multiplier for C#? The same logic also applies for keeping a higher multiplier for C# as well, since C# code is complied Just In Time.

Thanks,
Abhijeet.

Hi, What is the multiplier for C#? The same logic also applies for keeping a higher multiplier for C# as well, since C# code is complied Just In Time.

Thanks,
Abhijeet.

#include <iostream>#include <cstdio>int main(void) {unsigned int count=0,i=0;long unsigned int k,n;unsigned int temp;fscanf(stdin,”%uld”,&n);fscanf(stdin,”%uld”,&k);if(k<=10000000){ while(i<n && std::cin>>temp && temp<=1000000000){ if(temp%k==0)count++; i++; } }std::cout<<count; return 0;}WHY TIME LIMIT IS EXCEEDING…………what's wrong with this

#include <iostream>
#include <cstdio>
int main(void) {
unsigned int count=0,i=0;
long unsigned int k,n;
unsigned int temp;
fscanf(stdin,”%uld”,&n);
fscanf(stdin,”%uld”,&k);
if(k<=10000000){
while(i<n && std::cin>>temp && temp<=1000000000){
if(temp%k==0)count++;
i++;
}
}
std::cout<<count;
return 0;
}

WHY TIME LIMIT IS EXCEEDING…………what's wrong with this

#include
#include
int main(void) {
unsigned int count=0,i=0;
long unsigned int k,n;
unsigned int temp;
fscanf(stdin,”%uld”,&n);
fscanf(stdin,”%uld”,&k);
if(k< =10000000){
while(i>temp && temp<=1000000000){
if(temp%k==0)count++;
i++;
}
}
std::cout< return 0;
}

WHY TIME LIMIT IS EXCEEDING…………what’s wrong with this

You dont get it, because you do not understand the limitations of virtual machines and interpreted languages as opposed to compiled languages

You dont get it, because you do not understand the limitations of virtual machines and interpreted languages as opposed to compiled languages

You dont get it, because you do not understand the limitations of virtual machines and interpreted languages as opposed to compiled languages

I am having issues getting Haskell to run in the allotted time.  Have you seen requests for a multiplier on Haskell? I am using the same algorithm as efficient solutions in other languages.

I would love to learn more about technical and programming related things. 
Great post, and i loved it. 

It is odd that Java and Scala have different time limits, given that both run on same JVM and scala can, at most, be as fast as Java can(in most cases).