OJ Board

Please don't abbreviate English words, it's just rude!

sorry for it.

actually i used scanf/printf .
thnx for reply.

Hi,
i accepted this pro 0.036s using find a num carmichael or not;
but when i precalculate these and output at O(1) time then i got 0.028 s.

if u chk the statistics of it then u find 0.000 .008 0.012 and .....

but how this is possible ??

Please some one explain it.
Its a Mystery to me...

thnx

i am not understanding what is problem with me.
im finding all output correct using my algo.

but why i am finding Wa. ??
#include <stdio.h>
bool data[1000100]={0};
long long dt[1000100]={0},i,j,n,m,count,max=0,num,num2;
long long test;
int main()
{
for (i=2; i<=1000; )
{
for (j=2*i; j<=1000000 ...

hi,
in the Problem description it said that : -
The file contains a positive integer n and a sequence of n strings of parentheses () and [], one string a line.




but i got wa when i assumed that each of next n lines have string of parenthese [*() || []*].
but got acc when assumed that there can ...