Search found 68 matches

by Artikali
Mon Nov 20, 2006 3:08 pm
Forum: Algorithms
Topic: NEERC Subregional problems
Replies: 1
Views: 1614

problem Alphabet, have anyone interested with this problem, i think it is a np-complete.
by Artikali
Fri Nov 17, 2006 10:29 pm
Forum: Algorithms
Topic: NEERC Subregional problems
Replies: 1
Views: 1614

NEERC Subregional problems

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...
by Artikali
Fri Nov 17, 2006 5:59 am
Forum: Algorithms
Topic: Topological Sort
Replies: 1
Views: 1596

Topological Sort

I used standart Topological sort algorithm, but if node==5000 it says stack overflow, any one know how to do it without recursion.
Thanks
by Artikali
Mon Oct 30, 2006 5:11 am
Forum: C++
Topic: Function call
Replies: 1
Views: 1672

Function call

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
by Artikali
Sat Oct 28, 2006 8:56 am
Forum: Algorithms
Topic: i couldn't find any algo
Replies: 8
Views: 3342

i couldn't find any algo

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...
by Artikali
Tue Oct 24, 2006 10:14 pm
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17802

thanks accepted
using

cin>> - 8.705
getchar - 8.055
by Artikali
Tue Oct 24, 2006 9:45 pm
Forum: C++
Topic: Binary Search Tree
Replies: 0
Views: 1583

Binary Search Tree

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
by Artikali
Tue Oct 24, 2006 9:35 pm
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17802

i also used multiset, but i am getting WA

i am newer using STL
by Artikali
Tue Oct 24, 2006 5:55 pm
Forum: Volume 111 (11100-11199)
Topic: 11135 - Gopher that walks and swims
Replies: 2
Views: 1764

11135 - Gopher that walks and swims

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); ...
by Artikali
Tue Oct 24, 2006 5:50 pm
Forum: Volume 111 (11100-11199)
Topic: 11129 - An antiarithmetic permutation
Replies: 21
Views: 16169

could anyone give me brief description of waterloo's code?
what is it?
i searched by google but i couldn't find it
by Artikali
Tue Oct 24, 2006 12:34 pm
Forum: C++
Topic: deleting from multiset container
Replies: 3
Views: 2056

inserting complexity O(n) or O(lgn)?
by Artikali
Tue Oct 24, 2006 6:49 am
Forum: C++
Topic: deleting from multiset container
Replies: 3
Views: 2056

deleting from multiset container

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
by Artikali
Fri Oct 06, 2006 4:51 pm
Forum: Volume 111 (11100-11199)
Topic: 11102 - Moonshine
Replies: 27
Views: 10324

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]
by Artikali
Thu Oct 05, 2006 4:55 pm
Forum: Volume 111 (11100-11199)
Topic: 11102 - Moonshine
Replies: 27
Views: 10324

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...
by Artikali
Thu Oct 05, 2006 4:36 am
Forum: Volume 111 (11100-11199)
Topic: 11102 - Moonshine
Replies: 27
Views: 10324

11102 - Moonshine

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...

Go to advanced search