#include <iostream.h>
#define DIM 307
#define oo 2000000000L
long N,T1,T2;
long A[307];
int B[33][DIM],C[33][DIM];
long D[33][DIM];
int R[33][DIM];
int Res[33];
int ReadData()
{ long i,j;
cin>>T1>>T2;
if(T1==0 && T2==0) return 0;
cin>>N;
for(i=1;i<=N;i++)
{
cin>>A[i];
for(j=1;j<=A[i];j ...
Search found 6 matches
- Thu Oct 03, 2002 1:55 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10086 - Test the Rods
- Replies: 10
- Views: 7040
- Wed Jun 12, 2002 10:54 am
- Forum: Volume 5 (500-599)
- Topic: 502 - DEL command
- Replies: 21
- Views: 13667
502 - DEL command
How to solve it without very huge full search?
- Wed May 29, 2002 1:10 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10229 - Modular Fibonacci
- Replies: 53
- Views: 26465
10229 - Modular Fibonacci
There is my programm.
I cannot find where it fails.
// programm compute
// |1 1|^(N-1)
// |1 0|
// with modular arithmetic
#include <iostream.h>
#include <math.h>
long N,L;
long double i,j,k,h,LL;
void mathpow(long N)
{ long t;
if (N>1)
{
mathpow(N/2);
//next 2 lines is M=M*M;
t=k*j;
k=i ...
I cannot find where it fails.
// programm compute
// |1 1|^(N-1)
// |1 0|
// with modular arithmetic
#include <iostream.h>
#include <math.h>
long N,L;
long double i,j,k,h,LL;
void mathpow(long N)
{ long t;
if (N>1)
{
mathpow(N/2);
//next 2 lines is M=M*M;
t=k*j;
k=i ...
- Thu Jan 17, 2002 11:36 am
- Forum: Volume 4 (400-499)
- Topic: 460 - Overlapping Rectangles
- Replies: 25
- Views: 5820
- Wed Jan 16, 2002 1:48 pm
- Forum: Volume 4 (400-499)
- Topic: 460 - Overlapping Rectangles
- Replies: 25
- Views: 5820
- Wed Jan 16, 2002 10:23 am
- Forum: Volume 4 (400-499)
- Topic: 460 - Overlapping Rectangles
- Replies: 25
- Views: 5820