This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <fstream>//qsort by marsharp | |
#include <iostream> | |
#include <algorithm> | |
using namespace std; | |
int a[100005]; | |
void qsort(int l,int r) | |
{ | |
int i,j,tmp=a[(r+l)/2]; | |
if(r==l)return; | |
i=l; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
//#include <fstream> | |
//#include <algorithm> | |
using namespace std; | |
int a[8][8]; | |
int q; | |
void ferz(int i,int j)//закраска битых полей | |
{ | |
int z; | |
for(z=0;z<8;z++) |