OJ Board

J get WA by brutr force, first j sort all points by x
next check all n^2 , witch some optimalization by x
end get WA plese give mi some sample input/output
or find bug im my prog
meybe problem is in rounding ??

[c]

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

struct point
{
long double ...

Jdont like Sieve of Eratosthenes :P

somthing like that take les memory (only prime numbers)

for(i=6;i<=2000000;i+=6)
{
for(j=0;;j++){ if((i-1)%fst[j]==0)break; if((fst[j]*fst[j])>(i-1))
{fst[liczp]=i-1; countprime++; break;}}
for(j=0;;j++){ if((i+1)%fst[j]==0)break; if((fst[j]*fst[j])>(i+1))
{fst ...

J get AC 0:00.158
after one modification j was geting TLE
J using dymic programing + recurence
all data stored in int tst[11][11][11][11][11][11]; table
and all secret is DO NOT CLEAR TABLE it take too much time
beter is declarate second table tst[11][11][11][11][11][11];
end for valible data who ...

in stl you must resize tables,vectors etc. some times j think
but j don't know execly becose j don't use stl

but if you use normal table[12] end your prog will call table[19] it will be segmentation

in what problem this algo can be used ??

10054 - euler problem , but j get WA

in c++ sometimes j use long double
but most time you must wrore your implementation big num

for example table
0 1 2 3 4 5
4 5 6 7 5 3

can reprezent number 456753

U can also check all number if it is self number
J get AC by deleting numbers who are not self number's

same problems can be slove by itteration by cheacking all ways witchaut backtraicing for example knapsack problem can be sloved by backtraicing
end also you can benerate all numbers in binary
n=3
000
001
010
100
011
....

means you take thing where is 1
all numbers can be grenrate witchaut ...

my prog find all 92 positions at start prog end use it far all cases
J get AC
J use iterratin methot for nqp for 8 is fast

You can use modification of DFS

DFS( V)
{

for all E DFS(E.V)

add_to list(V);

}

it will give you list of V in euler cycle
end renember check all E only one time

my prog pass all tests but get wa

j use this algoritm but j get wa
pleas give me some simple input output
program pased all input who was on forum

#include <stdio.h>


unsigned int pierwsze[100000];
unsigned int fstost[100000];


unsigned int liczp=2;
unsigned int oset;

unsigned int iled;
unsigned int ilep;



unsigned int ...

the fastest way j know is using dynamic programing end formula:

nCr(n,r) = nCr(n-1,r-1) + nCr(n-1,r);

but j cant go AC :| but this way j hot AC in 369 - it's very symilar but easest



sory 4 me englisz

hello
why j get wa ??


#include<stdio.h>

char stat [512];

void pw(void)
{
int i,j;

for(i=1;i!=1024;i++)
{
j=500;
while(j--)
{
if(stat[j]==i)printf("%d %d\n",j,stat[j]);
}

}

}

main()
{
int i;
char ch;

while(1)
{
ch=getchar();
if(ch=='\n'|| ch=='\r'){pw(); for(i=0;i!=512 ...