OJ Board

Artikali

problem Alphabet, have anyone interested with this problem, i think it is a np-complete.

Artikali

Problems: http://neerc.ifmo.ru/subregions/northern/problems.pdf and official test cases: http://neerc.ifmo.ru/subregions/northern/tests.rar in this file also has check.exe which is check your answer after the constest i soved all problem, which i couldn't solved during the contest, except one. First...

Artikali

I used standart Topological sort algorithm, but if node==5000 it says stack overflow, any one know how to do it without recursion.
Thanks

Artikali

How can i built function which have multidimension array.
here is my code

Code: Select all

#include <iostream>
#include <cstdio>
using namespace std;
#define N 100
int put(int ** a){
	a[0][0]=1;
	return 0;
}
int main(){
	int c[N][N];
	put(c);
	cout<<c[0][0]<<endl;
	return 0;
}

it gave me compile error.
thanks

Artikali

below a problem which i took it from timus judge? I couldn' t find any way to solve it, please help me. 1495// One-two, one-two 2 Time Limit: 2.0 second Memory Limit: 64 MB A year ago the famous gangster Vito Maretti woke up in the morning and realized that he was bored of robbing banks of round sum...

Artikali

thanks accepted
using

cin>> - 8.705
getchar - 8.055

Artikali

I want to construct a BST and Red Black tree, but it is too hard in real time constest
i can do it with point or using array, but both of them will waste my time in contest.
please give me an idea to do it.

thanks

Artikali

i also used multiset, but i am getting WA

i am newer using STL

Code: Select all

Artikali

I am tired of getting WA. here is my code. #include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cassert> using namespace std; const double _2=sqrt(2.0); double dist(double x,double y){ return sqrt(x*x+y*y); } int rd1(double a){ int r; if ((a-floor(a))<0.5) r=floor(a); ...

Artikali

could anyone give me brief description of waterloo's code?
what is it?
i searched by google but i couldn't find it

Artikali

inserting complexity O(n) or O(lgn)?

Artikali

How can i delete from multiset container
is there any function. i only need delete first and last elements
inserting element in multiset container
is O(n) or o(lgn)?
thanks

Artikali

if R>t then it would be right.else { t=R-t; V=Volume cone -Volume Slice;}
let's prove it.
if (R>t)
[img=http://img322.imageshack.us/img322/7932 ... sr4.th.jpg]
[/url]

Artikali

integral is nasty, but it has a simple solution to find the volume of a cone sliced by a plane parallel to its axis. First you to find of area of the base of a cone(segment of the base circle) and multiply to height(not height of con) and devide it 3 R - radius of a cone h - height of a cone t,p - s...

Artikali

Please help me, i tested it with several test case, but it was WA here is my code #include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cassert> using namespace std; const double err=0.001; const double pi=acos(-1.0); double S(double r,double t){ double a=2*acos((r-t)/r...

OJ Board

Search found 68 matches

NEERC Subregional problems

Topological Sort

Function call

i couldn't find any algo

Binary Search Tree

11135 - Gopher that walks and swims

deleting from multiset container

11102 - Moonshine