Çäåñü ìîæíî íàéòè ó÷åáíûå ìàòåðèàëû, êîòîðûå ïîìîãóò âàì â íàïèñàíèè êóðñîâûõ ðàáîò, äèïëîìîâ, êîíòðîëüíûõ ðàáîò è ðåôåðàòîâ. Òàê æå âû ìàæåòå ñàìîñòîÿòåëüíî ïîâûñèòü óíèêàëüíîñòü ñâîåé ðàáîòû äëÿ ïðîõîæäåíèÿ ïðîâåðêè íà ïëàãèàò âñåãî çà íåñêîëüêî ìèíóò.

ËÈ×ÍÛÉ ÊÀÁÈÍÅÒ 

Çäðàâñòâóéòå ãîñòü!

 

Ëîãèí:

Ïàðîëü:

 

Çàïîìíèòü

 

 

Çàáûëè ïàðîëü? Ðåãèñòðàöèÿ

 

Ïîâûøåíèå îðèãèíàëüíîñòè

Ïðåäëàãàåì íàøèì ïîñåòèòåëÿì âîñïîëüçîâàòüñÿ áåñïëàòíûì ïðîãðàììíûì îáåñïå÷åíèåì «StudentHelp», êîòîðîå ïîçâîëèò âàì âñåãî çà íåñêîëüêî ìèíóò, âûïîëíèòü ïîâûøåíèå îðèãèíàëüíîñòè ëþáîãî ôàéëà â ôîðìàòå MS Word. Ïîñëå òàêîãî ïîâûøåíèÿ îðèãèíàëüíîñòè, âàøà ðàáîòà ëåãêî ïðîéäåòå ïðîâåðêó â ñèñòåìàõ àíòèïëàãèàò âóç, antiplagiat.ru, ÐÓÊÎÍÒÅÊÑÒ, etxt.ru. Ïðîãðàììà «StudentHelp» ðàáîòàåò ïî óíèêàëüíîé òåõíîëîãèè òàê, ÷òî íà âíåøíèé âèä, ôàéë ñ ïîâûøåííîé îðèãèíàëüíîñòüþ íå îòëè÷àåòñÿ îò èñõîäíîãî.

Ðåçóëüòàò ïîèñêà


Íàèìåíîâàíèå:


ëàáîðàòîðíàÿ ðàáîòà Ââîä-Âûâîä ôàéëîâ Â Ñ++

Èíôîðìàöèÿ:

Òèï ðàáîòû: ëàáîðàòîðíàÿ ðàáîòà. Äîáàâëåí: 13.05.2012. Ãîä: 2011. Ñòðàíèö: 7. Óíèêàëüíîñòü ïî antiplagiat.ru: < 30%

Îïèñàíèå (ïëàí):


Ìèíèñòðåðñòâî îáðàçîâàíèÿ è íàóêè Óêðàèíû 
 
 
 

Êàôåäðà  
 
 

ÎÒ×ÅÒ
ïî ëàáîðàòîðíîé ðàáîòå ¹4
ïî äèñöèïëèíå: «Îáúåêòíî-îðèåíòèðîâàííîå ïðîãðàììèðîâàíèå»
òåìà: ÂÂÎÄ-ÂÛÂÎÄ ÔÀÉËÎÂ Â Ñ++ 
 
 
 
 
 

Âûïîëíèë:                                                                                                     Ïðîâåðèë: 
 
 
 
 
 

Õàðüêîâ 2011
     1 Öåëü ëàáîðàòîðíîé ðàáîòû:
Èçó÷åíèå ðåàëèçàöèè â ÿçûêå Ñ++ âîçìîæíîñòåé ââîäà-âûâîäà ôàéëîâ. 

     2 Çàäàíèå ëàáîðàòîðíîé ðàáîòû:
Äàí ôàéë ñ òåêñòîì. Îïðåäåëèòü, ñêîëüêî ñëîâ ñîñòîèò èç îäèíàêîâûõ áóêâ. 

     4 Òåêñò ïðîãðàììû:
#include "stdafx.h"
#include "iostream"
#include "fstream"
#include "conio.h"
using namespace std; 

char B[10000];
int k,i,p,d; 

int _tmain(int argc, _TCHAR* argv[])
{
      setlocale(LC_CTYPE, "");
      ifstream f("d:\\1234.txt");
      if(!f) cout<<"Íåâîçìîæíî îòêðûòü ôàéë";
      f.get(B,10000,'EOF'); 

      while(B[i]!=false)
      {
            cout<<B[i];
            i++;
      }
      cout<<endl<<endl;
      i=0;
      while(B[i]!=false&&B[i-1]!=true)
      {
            if(B[i]!='.'&&B[i]!=','&&B[i]!=' '&&B[i]!='!'&&B[i]!='?'&&B[i]!='('&&
         B[i]!=')'&&B[i]!=':'&&B[i]!='-'&&B[i]!=';'&&B[i]!='"'&&B[i]!='['&&
         B[i]!=']'&&B[i]!='{'&&B[i]!='}'&&B[i]!='«'&&B[i]!='»'&&B[i]!='1'&&
            B[i]!='2'&&B[i]!='3'&&B[i]!='4'&&B[i]!='5'&&B[i]!='6'&&B[i]!='7'&&
            B[i]!='8'&&B[i]!='9'&&B[i]!='0'&&B[i]!='--')
            {
                  k++;   
            }
            else
            {
                  switch(k)
                  {
                        case 1:
                              p++;
                              k=0;
                              continue; 

                        case 2:
                              if(B[i-1]==B[i-2])
                                    p++;
                              k=0;
                              continue; 

                        case 3:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3])
                                    p++;
                              k=0;
                              continue; 

                        case 4:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4])
                                    p++;
                              k=0;
                              continue; 

                        case 5:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                  B[i-4]==B[i-5])
                                    p++;
                              k=0;
                              continue; 

                        case 6:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
               B[i-4]==B[i-5]&&B[i-5]==B[i-6])
                                    p++;
                              k=0;
                              continue; 

                        case 7:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
               B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7])
                                    p++;
                              k=0;
                              continue; 

                        case 8:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8])
                                    p++;
                              k=0;
                              continue; 

                        case 9:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9])
                                    p++;
                              k=0;
                              continue; 

                        case 10:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10])
                                    p++;
                              k=0;
                              continue; 

                        case 11:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11])
                                    p++;
                              k=0;
                              continue; 

                        case 12:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12])
                                    p++;
                              k=0;
                              continue; 

                        case 13:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13])
                                    p++;
                              k=0;
                              continue; 

                        case 14:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14])
                                    p++;
                              k=0;
                              continue; 

                        case 15:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15])
                                    p++;
                              k=0;
                              continue; 

                        case 16:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16])
                                    p++;
                              k=0;
                              continue; 

                        case 17:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17])
                                    p++;
                              k=0;
                              continue; 

                        case 18:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18])
                                    p++;
                              k=0;
                              continue; 

                        case 19:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19])
                                    p++;
                              k=0;
                              continue; 

                        case 20:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&
               B[i-19]==B[i-20])
                                    p++;
                              k=0;
                              continue; 

                        case 21:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&
                                     B[i-19]==B[i-20]&&B[i-20]==B[i-21])
                                    p++;
                              k=0;
                              continue; 

                        case 22:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&
                                     B[i-19]==B[i-20]&&B[i-20]==B[i-21]&&B[i-21]==B[i-22])
                                    p++;
                              k=0;
                              continue; 

                        case 23:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&
                                     B[i-19]==B[i-20]&&B[i-20]==B[i-21]&&B[i-21]==B[i-22]&&
                                     B[i-22]==B[i-23])
                                    p++;
                              k=0;
                              continue; 

                        case 24:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&
                                     B[i-19]==B[i-20]&&B[i-20]==B[i-21]&&B[i-21]==B[i-22]&&
                                     B[i-22]==B[i-23]&&B[i-23]==B[i-24])
                                    p++;
                              k=0;
                              continue; 

                        case 25:
                              if(B[i-1]==B[i-2]&&B[i-2]==B[i-3]&&B[i-3]==B[i-4]&&
                                     B[i-4]==B[i-5]&&B[i-5]==B[i-6]&&B[i-6]==B[i-7]&&
                                 B[i-7]==B[i-8]&&B[i-8]==B[i-9]&&B[i-9]==B[i-10]&&
                                     B[i-10]==B[i-11]&&B[i-11]==B[i-12]&&B[i-12]==B[i-13]&&
                                 B[i-13]==B[i-14]&&B[i-14]==B[i-15]&&B[i-15]==B[i-16]&&
                                     B[i-16]==B[i-17]&&B[i-17]==B[i-18]&&B[i-18]==B[i-19]&&                          
                                     B[i-19]==B[i-20]&&B[i-20]==B[i-21]&&B[i-21]==B[i-22]&&
                                     B[i-22]==B[i-23]&&B[i-23]==B[i-24]&&B[i-24]==B[i-25])
                                    p++;
                              k=0;
                              continue; 

                  }
            }
            i++;
      }
      cout<<"Êîëè÷åñòâî ñëîâ, ñîñòîÿùèõ èç îäíîé è òîé æå áóêâû: "<<p;
      getch();
      return 0;
} 

     4.4 Ðåàëèçàöèÿ ïðîãðàììû ïðåäñòàâëåíà íà ðèñóíêå 1:
        
 
 
 

     Ðèñóíîê 1 - ðåàëèçàöèÿ ïðîãðàììû
      5 Âûâîäû:
 ðåçóëüòàòå âûïîëíåíèÿ ëàáîðàòîðíîé ðàáîòû ÿ íàó÷èëñÿ èñïîëüçîâàòü êëàññû ââîäà-âûâîäà èç ôàéëà. 
 
 


è ò.ä.................


Ïåðåéòè ê ïîëíîìó òåêñòó ðàáîòû


Ñêà÷àòü ðàáîòó ñ îíëàéí ïîâûøåíèåì îðèãèíàëüíîñòè äî 90% ïî antiplagiat.ru, etxt.ru


Ñìîòðåòü ïîëíûé òåêñò ðàáîòû áåñïëàòíî


Ñìîòðåòü ïîõîæèå ðàáîòû


* Ïðèìå÷àíèå. Óíèêàëüíîñòü ðàáîòû óêàçàíà íà äàòó ïóáëèêàöèè, òåêóùåå çíà÷åíèå ìîæåò îòëè÷àòüñÿ îò óêàçàííîãî.