Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- #include "nem_oo.h"
- namespace sajat{
- int atoi(const char *p, int base)
- {
- int atvaltott,n,i;
- for(i=strlen(p)-1,n=1,atvaltott=0;i>=0;i--,n*=base)
- {
- if((p[i]<'0') || (p[i]>'0'+base-1))
- throw "Hibás karakter";
- atvaltott+=(p[i]-'0')*n;
- }
- return atvaltott;
- }
- char *strcat(const char *p1, const char *p2)
- {
- int i, j;
- for (i = 0; p1[i] != '\0'; ++i)
- ;
- for (j = 0; p2[j] != '\0'; ++j)
- ++i;
- char *uj = new char[i + 1];
- for (i = 0, j = 0; p1[i] != '\0'; ++i, ++j)
- uj[j] = p1[i];
- for (i = 0; p2[i] != '\0'; ++i, ++j)
- uj[j] = p2[i];
- uj[j] = '\0';
- return uj;
- }
- void swap(int &r1, int &r2)
- {
- int x=r1;
- r1=r2;
- r2=x;
- }
- char* unique(char *first, char *last)
- {
- char *vege=last;
- for(unsigned int i=strlen(first)-1;i>=0;i--)
- {
- int j=i-1;
- if(first[i]==first[j])
- {
- for(unsigned int k=j;k<strlen(first);k++) first[k]=first[k+1];
- vege--;
- }
- }
- vege++;
- return vege;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement