Search found 3 matches

by Md.Yasin
Sun May 20, 2007 5:49 pm
Forum: Volume 112 (11200-11299)
Topic: 11202 - The least possible effort
Replies: 8
Views: 5466

11202

Thank u for ur replay.
I got accepted before ur replay.
And its 11202 num. problem not 11200.
THANX. :D :D [/b]
by Md.Yasin
Sat May 19, 2007 7:52 pm
Forum: Volume 112 (11200-11299)
Topic: 11202 - The least possible effort
Replies: 8
Views: 5466

11202 - The least possible effort

I could not what will
happen for this sample
8 8
10 10
15 15
25 25
That's mean what output will
happen for this input
I got so much wrong answer for
this problem.
please any body help me.
by Md.Yasin
Mon Mar 12, 2007 9:35 pm
Forum: Volume 3 (300-399)
Topic: 343 - What Base Is This?
Replies: 72
Views: 28334

343-WA(Please help me)

//here i compute both +\- input


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
char str1[1000],str2[1000],*ptr,temp;
long num1,num2,i,j,flag,a,b;

while(scanf("%s %s",str1,str2)==2)
{
if(strcmp(str1,"0")==0 && strcmp(str2,"0")==0)
printf("0 (base 2) = 0 (base 2)\n ...

Go to advanced search