$db_result = mysql_query("SELECT field_one FROM table_amr WHERE field_two = 1");
$db_result_array = mysql_fetch_row($db_result);
print_r($db_result_array);

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

int main()
{
    char s[100][100];
    char N[100];
    int i, j, k;
    printf("Vvedite predlozenie ");
    gets(s); // ввод предложения
    while (N[i]!='\0')
    {
        if (N[i]=' ')
        {s[i][j]=N[i]
        i++; 
        k=0;
        }
        mass N[j, k]=N[i]
            }








    printf("Otvet: %s", s);// вывод символьной строки
}

using System;
using System.Collections.Generic;

using NUnit.Framework;

using BLToolkit.Mapping;
using BLToolkit.Data;
using BLToolkit.DataAccess;
using BLToolkit.Reflection.Extension;
using Kzo.DAL;

namespace HowTo.Data
{
    [TestFixture]
    
    public class ComplexMapping
    {
        const string TestQuery = @"
            -- Parent Data
            SELECT       1 as ParentID FROM dual
            UNION SELECT 2 as ParentID FROM dual

            -- Child Data
            SELECT       4 ChildID, 1 as ParentID FROM dual
            UNION SELECT 5 ChildID, 2 as ParentID FROM dual
            UNION SELECT 6 ChildID, 2 as ParentID FROM dual
            UNION SELECT 7 ChildID, 1 as ParentID FROM dual

            
                
        -- Grandchild Data
            SELECT       1 GrandchildID, 4 as ChildID FROM dual
            UNION SELECT 2 GrandchildID, 4 as ChildID FROM dual
            UNION SELECT 3 GrandchildID, 5 as ChildID FROM dual
            UNION SELECT 4 GrandchildID, 5 as ChildID FROM dual
            UNION SELECT 5 GrandchildID, 6 as ChildID FROM dual
            UNION SELECT 6 GrandchildID, 6 as ChildID FROM dual
            UNION SELECT 7 GrandchildID, 7 as ChildID FROM dual
            UNION SELECT 8 GrandchildID, 7 as ChildID FROM dual
";

        public class Parent
        {
            [MapField("ParentID")]
            public int ID;

            //[Relation(typeof(Child))]
            public List<Child> Children = new List<Child>();
        }

        [MapField("ParentID", "Parent.ID")]
        public class Child
        {
            [MapField("ChildID")]
            public int ID;

            //[Relation]
            public Parent Parent = new Parent();

            //[Relation(typeof(Grandchild))]
            public List<Grandchild> Grandchildren = new List<Grandchild>();
        }

        [MapField("ChildID", "Child.ID")]
        public class Grandchild
        {
            [MapField("GrandchildID")]
            public int ID;

            //[Relation]
            public Child Child = new Child();
        }

        [Test]
        public void Test()
        {
            List<Parent>   parents = new List<Parent>();
            MapResultSet[] sets    = new MapResultSet[3];

            sets[0] = new MapResultSet(typeof(Parent), parents);
            sets[1] = new MapResultSet(typeof(Child));
            sets[2] = new MapResultSet(typeof(Grandchild));

            sets[0].AddRelation(sets[1], "ParentID", "ParentID", "Children");
            sets[1].AddRelation(sets[0], "ParentID", "ParentID", "Parent");

            sets[1].AddRelation(sets[2], "ChildID", "ChildID", "Grandchildren");
            sets[2].AddRelation(sets[1], "ChildID", "ChildID", "Child");

            using (DbManager db = new DbKZOManager())
            {
                db
                    .SetCommand      (TestQuery)
                    .ExecuteResultSet(sets);
            }
        }
    }
}

#include <stdio.h>
#include "string.h"


void sortf(char *mas, int k)
{
    int i,j,idmin;
    char min;
    for(i=k-2;i>=0;i--)
    {
        min=mas[i]; 
        idmin=i;  
        for(j=i;j>=0;j--)
        {
            if(mas[j]<min) 
            {
                min=mas[j]; 
                idmin=j;   
            }
        }    
        mas[idmin]=mas[i]; 
        mas[i]=min;
    };
};


int srav(char *mas, char *mas2)
{
    int i,g=0;
    for(i=6;i>=0;i--) 
    {
        if (mas[i]>mas2[i])      {g= 1; break;}
        else if (mas[i]<mas2[i]) {g=-1; break;}
    }
    return(g); //возращает: 0 - если строки равны   1 - если первая больше второй   -1 - если первая меньше второй    
}




void fedos()
{
int x=12,y=8,z,h,idmin,i,flag,j; //x- кол-во слов, y- кол-во букв( вкл. \0)
int id[12];
char str[8];
char f[12][10]={"бобслей",
                 "белорус",
                 "радение",
                 "зачаток",
                 "лесоруб",
                 "дарение",
                 "досолка",
                 "солодка",
                 "нереида",
                 "драение",
                 "бейсбол",
                 "заточка"};

char f2[12][10]={"бобслей",
                 "белорус",
                 "радение",
                 "зачаток",
                 "лесоруб",
                 "дарение",
                 "досолка",
                 "солодка",
                 "нереида",
                 "драение",
                 "бейсбол",
                 "заточка"};
                 
for(i=0;i<x;i++)
     {
     sortf(f2[i],y);
     printf("\n%s \t %s", f[i],f2[i]);
     };
printf("\n");
for(i=0;i<x;i++)
     id[i]=i;
for(i=0;i<x-1;i++)
     {
     strcpy(str, f2[id[i]]);
     idmin=i;
     for(j=0;j<x;j++)
         {
         flag=srav(str, f2[id[j]]);
         if(flag==1)//т.е строка в массиве больше минимума
             {
             strcpy(str, f2[id[j]]);
             idmin=j;
             };
         };
     z=id[i];
     id[i]=id[idmin];
     id[idmin]=z;
     };
for(h=0;h<12;h++)  printf("\n%2i %s",id[h], f2[id[h]]);
printf("\n");
for(i=1;i<x;i++) 
     {
     flag=srav(f2[id[i-1]],f2[id[i]]);
     if(flag!=0) printf("\n");
     printf("%s\t", f2[id[i]]);
     }; 
};

main()
{
fedos();
};