Search found 77 matches

by Niaz
Wed May 02, 2007 3:14 pm
Forum: Volume 110 (11000-11099)
Topic: 11011 - Numerical Methods! A Satire
Replies: 11
Views: 7724

OFF THE RECORD

I can't stop writing comment on the Abul Dean of Eastern University.

Two of my friends (Gold Medalist from East West University, having a CGPA of 3.99/4.00, now doing their Masters in Germany) were called by the Eastern University (EU) for an interview for the post of Lecturer in ...
by Niaz
Wed Jul 26, 2006 7:15 pm
Forum: Other words
Topic: EWUIPC 2006
Replies: 0
Views: 1770

EWUIPC 2006

ONLY FOR BANGLADESHI TEAMS
--------------------------------------

Dear Coaches and Contestants,
It
by Niaz
Thu Apr 20, 2006 11:28 am
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 23974

Thanks to mf and arsalan_mousavian.

I am such a duffer! I used so many times FW but never did this mistake and how come I did it here ? Interestingly it gave the correct output for the sample inputs and that made me more crazy. I checked lot many things in my code (even thought about multiple paths ...
by Niaz
Mon Apr 17, 2006 4:46 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 23974

Though I feel this one an easy problem, but getting WA :cry:
Here is my code... anyone can find my bug ? Thanx in advance.

Code: Select all

Accepted :) 
by Niaz
Tue Dec 20, 2005 5:43 pm
Forum: Volume 109 (10900-10999)
Topic: 10942 - Can of Beans
Replies: 9
Views: 5683

Please help me. This is such an easy problem and I am stucked there ! It is irritating. Plz give me some more input and output.
by Niaz
Fri Dec 09, 2005 3:08 pm
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 35032

Plz do have a look at my code. I cant figure out the bug !

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int N,index;
char bank[55][100],temp[100];
int compare (int a, int b)
{
int i,j,len1,len2,len;
len1=strlen(bank[a]);
len2=strlen(bank[b]);
if(len1>len2)
len ...
by Niaz
Fri Dec 09, 2005 3:02 pm
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 35032

I am getting WA again and again ! I cant figure out where is actually my mistake. Would you plz give me some tricky input and output, so that I can find my fault ?
by Niaz
Thu Dec 08, 2005 2:57 pm
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 35032

Plz help...

What will be the output for this input
3
0 0 0

Thanks in advance.
by Niaz
Tue Dec 06, 2005 7:03 pm
Forum: Volume 3 (300-399)
Topic: 392 - Polynomial Showdown
Replies: 93
Views: 31620

This part of my code will be....

else if(coeff[i]<0)
{
if(k==0)
printf("-");
else
printf(" - ");
coeff[i]=coeff[i]*(-1);
if(coeff[i]!=1)
printf("%dx",coeff[i]);
printf("x");
k=1;
}


This

else if(coeff[i]<0)
{
if(k==0)
printf("-");
else
printf(" - ");
coeff[i ...
by Niaz
Tue Dec 06, 2005 6:51 pm
Forum: Volume 108 (10800-10899)
Topic: 10871 - Primed Subsequence
Replies: 20
Views: 14768

the number will be at best 9999*10000 .
so how do you check prime if the number will be greater then 300000000?

Do you mean "300000000" or "30000000" ?

I got to know from a previous post on this problem that the number will not be too large. That's why I took such a small upper limit. Would you ...
by Niaz
Sat Nov 26, 2005 9:30 am
Forum: Volume 3 (300-399)
Topic: 392 - Polynomial Showdown
Replies: 93
Views: 31620

got AC.
by Niaz
Sat Nov 26, 2005 9:29 am
Forum: Volume 3 (300-399)
Topic: 392 - Polynomial Showdown
Replies: 93
Views: 31620

Can anyone help me ? Getting WA for the last 3 years !!!

#include<stdio.h>
int main()
{
int coeff[10];
int i,k;
while(scanf("%d",&i)==1)
{
coeff[8]=i;
for(i=0;i<8;i++)
scanf("%d",&coeff[7-i]);

k=0;
for(i=8;i>1;i--)
{
if(coeff[i]>0)
{
if(k==1)
printf(" + ");
if(coeff[i]!=1)
printf ...
by Niaz
Sat Nov 26, 2005 9:26 am
Forum: Volume 3 (300-399)
Topic: 392 - Polynomial Showdown
Replies: 93
Views: 31620

Here is my code. Plz have a look.

Code: Select all

Got Accepted. Thanks to Roby.
by Niaz
Fri Nov 25, 2005 1:56 pm
Forum: Volume 108 (10800-10899)
Topic: 10871 - Primed Subsequence
Replies: 20
Views: 14768

Posting my code that gives correct ans for the bijon's given input.


#include<stdio.h>
#include<math.h>
#define max 10011
#define pmax 20000010
char prime[pmax];
int bank[max+100];
int isPrime(long);
void siv()
{
long i,j,k;
prime[0]='x';
prime[1]='x';
for(i=3;i<=(int)sqrt(pmax);i=i+2)
{
if ...
by Niaz
Thu Nov 24, 2005 6:44 pm
Forum: Volume 109 (10900-10999)
Topic: 10964 - Strange Planet
Replies: 13
Views: 7859

I can't figure out the formula. Even I don't know, is there any stright forward formula exist or not. Plz give me some hints. Thanks in advance.

Go to advanced search