#include <stdio.h>
#include <math.h>
int main()
{
int p,q,r,s,t,u;
double negx,posx,prex,x,incx=0.1;
int getneg,getpos;
int sol=0;
double f(double x)
{
return p*exp(-x)+q*sin(x)+r*cos(x)+s*tan(x)+t*x*x+u;
}
while (scanf("%d %d %d %d %d %d\n",&p,&q,&r,&s,&t,&u) > 0)
{
sol = 0;
incx = 0 ...
Search found 5 matches
- Sun Aug 17, 2003 12:54 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10341 - Solve It
- Replies: 64
- Views: 45142
- Mon Apr 07, 2003 7:24 pm
- Forum: Volume 5 (500-599)
- Topic: 547 - DDF
- Replies: 9
- Views: 6013
547 - DDF
i don't know where I get wrong..............
any good test case ?
I have search the previous post about 547..........
I have the same output as him...........
I don't know where is the problem.......
Please help..............
any good test case ?
I have search the previous post about 547..........
I have the same output as him...........
I don't know where is the problem.......
Please help..............
- Thu Mar 20, 2003 1:13 am
- Forum: Volume 102 (10200-10299)
- Topic: 10279 - Mine Sweeper
- Replies: 102
- Views: 43167
10279 a easy problem,but why wrong answer?
[c]
#include <stdio.h>
int main()
{
int map[100][100];
char str[200];
int n;
int i,j,x,y,ans;
int t1,t2;
char ch;
scanf("%d",&t2);
for (t1=1; t1<=t2; t1++)
{
scanf("%d\n",&n);
if (t1 > 1)
printf("\n");
for (i=0; i <= 20; i++)
for (j=0; j <= 20; j++)
map [j] = 0;
for (i=1 ...
#include <stdio.h>
int main()
{
int map[100][100];
char str[200];
int n;
int i,j,x,y,ans;
int t1,t2;
char ch;
scanf("%d",&t2);
for (t1=1; t1<=t2; t1++)
{
scanf("%d\n",&n);
if (t1 > 1)
printf("\n");
for (i=0; i <= 20; i++)
for (j=0; j <= 20; j++)
map [j] = 0;
for (i=1 ...
- Sun Feb 23, 2003 7:15 pm
- Forum: Volume 1 (100-199)
- Topic: 112 - Tree Summing
- Replies: 137
- Views: 32281
112 WA
[c]
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
int targetsum,neg,num,sum,level,empty,ans,i;
int stack[1024*1024];
char ch,oldch;
for (i=0; i< 1024*1024; i++)
stack = 0;
while (scanf("%d",&targetsum) > 0)
{
level = 0;
neg = 0;
num = 0;
empty = 0;
ans = 0;
oldch = '\0 ...
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
int targetsum,neg,num,sum,level,empty,ans,i;
int stack[1024*1024];
char ch,oldch;
for (i=0; i< 1024*1024; i++)
stack = 0;
while (scanf("%d",&targetsum) > 0)
{
level = 0;
neg = 0;
num = 0;
empty = 0;
ans = 0;
oldch = '\0 ...
- Sun Feb 23, 2003 7:14 pm
- Forum: Volume 1 (100-199)
- Topic: 112 - Tree Summing
- Replies: 137
- Views: 32281
112 WA
[c]
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
int targetsum,neg,num,sum,level,empty,ans,i;
int stack[1024*1024];
char ch,oldch;
for (i=0; i< 1024*1024; i++)
stack = 0;
while (scanf("%d",&targetsum) > 0)
{
level = 0;
neg = 0;
num = 0;
empty = 0;
ans = 0;
oldch = '\0 ...
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
int targetsum,neg,num,sum,level,empty,ans,i;
int stack[1024*1024];
char ch,oldch;
for (i=0; i< 1024*1024; i++)
stack = 0;
while (scanf("%d",&targetsum) > 0)
{
level = 0;
neg = 0;
num = 0;
empty = 0;
ans = 0;
oldch = '\0 ...