OJ Board

Is there anybody so kind to give me some advice?


[cpp]
#include <iostream>
#include <cstring>
using namespace std;
int key[255];
int is(char *p)
{
int stack[300],stack1[300],now,f;
int i,at=0;
int len=strlen(p);
for(i=0;i<len;i++)
{
if(p =='N')continue;
stack[at++]=key[p ];
}
while(1 ...

here's my code:
[cpp]
#include <iostream.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
int main()
{
int a,b,i,d,j,k,m,cases=0,y;
char c,p[100];
while(cin>>j,j!=-1)
{cases++;
cin>>c>>c;
cin>>p;
k=strlen(p);
k-=j;
b=atoi(p);

i=1;
for(m=0;m<j;m++)i*=10 ...

thnx!gvcormac.
Furthermore,can anybody tell me how can I compute whether a^(p-1) == 1 (mod p) ?
You know,it is very hard for me to calculate for the prime is too large(with 100 digits).

But how can I proof this ?
Is ther any reference that I can refer to?

Please help me!
How can I find a prime with 150 digits?
Are there any algorithms?

Thank you for help!

I mean that its value should be 0 instead of 1

can anybody tell me why modf(pow(216,1/double(3)),&s)=1.0?