User profile: szyfuch
User info |
User name: | szyfuch |
History |
Joined: | |
Number of posts: | 8 |
Latest posts: |
A faster algorithm What is the algorithm common with that I have written in my first post?
A faster algorithm Thank you for answers. How to get O(log(n))?
A faster algorithm [code]#include<iostream>
using namespace std;
int main(){
int n, *tab;
long long int cur = ...
Longest Common Subsequence but what?
Longest Common Subsequence Witam.
[code]#include<cstdio>
int n,m,a=0,b,c=1,i,j,C[1001][1001],I[1001],J[1001];
char A[1001]...
|
This user does not accept Private Messages