Hi,
For windows platform and Unix/Linux platform too, there is common mechanism
of redirection.
ex:- I have Demo.exe
c:> Demo < input.in > output.out
Here Demo will take the input from fine input.in and will redirect it output
to the output.out
The same way we exercise in Unix/Linux too:
$ Demo < input.in > output.out
Suppose we have written scanf("%d",&no) in our program and in the
input.inwe mention the number "12" so it will read 12 in "no" directly
and when we
write printf('%d",no) it will write it to
the output.out in stead of stdout.
Hope The will be helpful for you.
On Mon, Apr 11, 2011 at 10:57 AM, Ram Shanker Saha <ramss...@gmail.com>wrote:
> Hi, In which plateform?
> Regards
> Ram
>
>
> On Sat, Apr 9, 2011 at 3:00 PM, vineel yalamarth <
> vineelyalamar...@gmail.com> wrote:
>
>> hI,
>> I ''m lookinh for some one o pair up with me for coding..Is any one
>> ready for this.
>> Please let me know.
>> Regards,
>> Vineel Yalamarthy
>>
>> On 4/9/11, vineel yalamarth <vineelyalamar...@gmail.com> wrote:
>> > On 4/9/11, BrunoOliveira <olivbru...@gmail.com> wrote:
>> >> Hello fellow programming friends,
>> >>
>> >> I am participating in GCJ for my first time "in an official way". I`m
>> >> from Portugal.
>> >>
>> >> I was able to come up with some of the algorithms necessary to solve
>> >> some problems, such as "Minimum Scalar Product" in Round 1A 2008.
>> >>
>> >> However, I never got to submit a solution because I can`t handle my I/
>> >> O operations with files as I can´t "generalize" my core algorithm to
>> >> all the test cases... Can you give me a few pointers?
>> >>
>> >> My code for the above problem was:
>> >>
>> >> #include <iostream>
>> >> #include <vector>
>> >> #include <algorithm>
>> >> using namespace std;
>> >>
>> >> void min_scalar_product(vector<int> &v1, vector<int> &v2)
>> >> {
>> >> sort(v1.begin(), v1.end());
>> >> sort(v2.begin(), v2.end());
>> >>
>> >> int min = 0;
>> >>
>> >> for(int i = 0; i < v1.size(); i++)
>> >> {
>> >> min += v1[i]*v2[v1.size()-(i+1)];
>> >> }
>> >> cout << min;
>> >> }
>> >>
>> >> int main()
>> >> {
>> >> int nums1[] = {1,3,-5};
>> >> vector<int> v1;
>> >> v1.assign(nums1, nums1+sizeof(nums1));
>> >>
>> >> int nums2[] = {2,4,-10};
>> >> vector<int> v2;
>> >> v2.assign
>> >> return 0;
>> >> }
>> >>
>> >> Can you please help me and also, give me some ideas regarding my
>> >> coding style?
>> >>
>> >> Thank you in advance,
>> >> Bruno (username Pardal)
>> >>
>> >> --
>> >> You received this message because you are subscribed to the Google
>> Groups
>> >> "google-codejam" group.
>> >> To post to this group, send email to google-code@googlegroups.com.
>> >> To unsubscribe from this group, send email to
>> >> google-code+unsubscr...@googlegroups.com.
>> >> For more options, visit this group at
>> >> http://groups.google.com/group/google-code?hl=en.
>> >>
>> >>
>> >
>> >
>> > --
>> > Regards,
>> > vineel.
>> >
>>
>>
>> --
>> Regards,
>> vineel.
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "google-codejam" group.
>> To post to this group, send email to google-code@googlegroups.com.
>> To unsubscribe from this group, send email to
>> google-code+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/google-code?hl=en.
>>
>>
>
>
> --
> Thanks & Regards
> Ram Shanker Saha
> IT Division,Dutch-Bangla Bank Limited
>
> --
> You received this message because you are subscribed to the Google Groups
> "google-codejam" group.
> To post to this group, send email to google-code@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to google-code@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
