void printAll(char *str, int index, int n)
{
if(index == n)
{
printf("%s\n", str);
}else
{
if(str[index]=='?')
{
str[index] = '0';
printAll(str, index+1, n);
str[index] = '1';
printAll(str, index+1, n);
}
else
{
printAll(str, index+1, n);
}
}
}
void Project::setModified(bool flag, bool files)
{
if (!projectRoot.isEmpty()) {
if (_isModified != flag) {
emit modificationChanged(flag);
_isModified = flag;
if (files) {
_filesModified = _isModified;
}
if (!_isModified) {
currentDataFileIndex(currentDataFileIndex(),true);
haveExtraArgs(haveExtraArgs(),true);
extraArgs(extraArgs(),true);
mzn2fznVerbose(mzn2fznVerbose(),true);
mzn2fznOptimize(mzn2fznOptimize(),true);
currentSolver(currentSolver(),true);
n_solutions(n_solutions(),true);
printAll(printAll(),true);
defaultBehaviour(defaultBehaviour(),true);
printStats(printStats(),true);
haveSolverFlags(haveSolverFlags(),true);
solverFlags(solverFlags(),true);
n_threads(n_threads(),true);
haveSeed(haveSeed(),true);
seed(seed(),true);
timeLimit(timeLimit(),true);
solverVerbose(solverVerbose(),true);
}
}
}
}
int main() {
JosephRing* ring = NULL;
int i = 0;
int k, m;
printf("Please in put k and m:\n");
scanf("%d %d", &k, &m);
ring = createRing();
for (i = 0; i < 10; i++)
insert(ring, i);
#ifdef _DEBUG_
printAll(ring);
#endif
printf("the last number is %d\n", getNumber(ring, k, m));
free(ring);
ring = createRing();
for (i = 0; i < 10; i++)
insert(ring, i * 2 + 1);
#ifdef _DEBUG_
printAll(ring);
#endif // _DEBUG_
printf("the last number is %d\n", newGetNumber(ring, k));
free(ring);
system("pause");
return 0;
}
void iniciarJuego(){
/*int nbombas = -1;
while( nbombas < 0 || nbombas > 70 ){
printf("Numero de bombas: ");
nbombas = getnum();
printf("%d\n", nbombas);
}*/
int x,y;
estado = ESTADO_EN_JUEGO;
njugadas = 0;
iniciaArr();
//PID es un identificador de procesos, cada vez
// que un nuevo proceso se ejectua se le asigna un PID
// diferente - Se necesita libreria - unistd.h
//srand( getpid() );
//srand ( time(NULL) );
//agregaBombas( nbombas );
int nbombas = agregaBombas();
establecerNumeros();
int starttime = getTime();
while( estado == ESTADO_EN_JUEGO){ //estado en juego
aboutMe();
timecount(starttime);
print();
printf(WHITE "Fila: ");
x = getnum();
printf(WHITE "%d\nColumna: ", x);
y = getnum();
printf(WHITE "%d\n", y);
jugadaEnGrupo(x,y);
char str[] = {0x1b, 0x5b, 0x48, 0x1b, 0x5b, 0x4a, '\0'};
printf("%s", str);
njugadas = contarJugadas();
if( njugadas == ( FILAS*COLUMNAS - nbombas) && estado != ESTADO_PERDEDOR){
estado = ESTADO_GANADOR;
}
}
if( estado == ESTADO_PERDEDOR){
print();
printf(RED "perdiste\n");
printf(WHITE "Solucion: \n");
printAll();
}else{
printf(GREEN "Ganaste !\n");
printAll();
}
}
void printAll(struct tree *root,int path[],int pathLen)
{
if(root==NULL) return;
path[pathLen]=root->data;
pathLen++;
if(root->left == NULL && root->right==NULL)
printArray(path,pathLen);
else
{
printAll(root->left,path,pathLen);
printAll(root->right,path,pathLen);
}
}
int main(int argc, char *argv[]) {
Hashtable* ht = newStrHashTable();
char buff[100];
int i;
char str[10] = "thisis0";
char object[90] = "this is a shared object";
size_t sizeobject = sizeof(char) * 90;
for (i = 0; i < 18; i++) {
str[6] = '0'+(i%10);
strhh_insert(ht, str, (void**)&object, &sizeobject);
}
printf("All\n");
printAll(ht);
for (i = 0; i < 18; i++) {
str[6] = '0'+(i%10);
strhh_remove(ht, str, (void**)&object, &sizeobject);
}
printf("none\n");
printAll(ht);
strhh_insert(ht, "Test", (void**)&object, &sizeobject);
strhh_insert(ht, "TesT", (void**)&object, &sizeobject);
strhh_insert(ht, "TeSt", (void**)&object, &sizeobject);
strhh_insert(ht, "TEst", (void**)&object, &sizeobject);
strhh_insert(ht, "test", (void**)&object, &sizeobject);
assert(strhh_contains(ht, "Test", (void**)&object, &sizeobject));
assert(strhh_contains(ht, "Test", (void**)&object, &sizeobject));
assert(strhh_contains(ht, "TEst", (void**)&object, &sizeobject));
assert(strhh_contains(ht, "TesT", (void**)&object, &sizeobject));
assert(strhh_contains(ht, "TeSt", (void**)&object, &sizeobject));
assert(!strhh_contains(ht, "TEST", (void**)&object, &sizeobject));
assert(!strhh_contains(ht, "T778ST", (void**)&object, &sizeobject));
printf("Test\n");
printAll(ht);
for (i = 0; i < 10000; i++) {
gen_random(buff, 90);
strhh_insert(ht, buff, (void**)&object, &sizeobject);
}
strhh_remove(ht, "|||blubla##", (void**)&object, &sizeobject);
freehashtable(ht);
freepool();
return 0;
}
void outputZapAll(pDeclList declList) {
printAll(declList, g_dirList, g_commentList, g_logList);
zapSLList(declList, zapDeclInfo); // declList = createSLList();
zapSLList(g_dirList, zapCTree); g_dirList = createSLList();
zapSLList(g_commentList, zapToken); g_commentList = createSLList();
zapSLList(g_logList, zapToken); g_logList = createSLList();
}
void ICACHE_FLASH_ATTR switchAction(int action) {
switch (action) {
case 1:
nextEntry();
if (lightCount >= 1)
lightOn(); // Keep on if already on
break;
case 2:
lightOn();
break;
case 3:
lightOff();
break;
case 4:
printAll();
break;
case 5:
checkSmartConfig(SC_TOGGLE);
break;
case 6: {
int i;
for (i = 0; i < FILTER_COUNT; i++) {
os_printf("f[%d]->%s\n", i, sysCfg.filters[i]);
}
}
break;
}
}
//print the last n lines
void printCount(int n)
{
if(n>=capacity) //if outof bounds print whole history
printAll();
else if(n<=0)
{
printf("error: invalid arguement\n");
}
else
{
int index=(startIndex+curSize-n)%capacity;
while(index<0)
index+=capacity;
int i=0;
int counter=curSize-n+1;
//printf("****check %d\n",counter);
while(i<n)
{
printf("%3d %s\n",counter,hist[index]);
i++;
index=(index+1)%capacity;
counter++;
}
}
}
void MainWindow::setupSessionViewer()
{
SVSelectedSessionWidget->setEnabled(false); enableSVTools();
passMarkDetailsTab->setEnabled(false);
scoringSystemTab->setEnabled(false);
QObject::connect(SVLSListWidget, SIGNAL(itemDoubleClicked(QListWidgetItem *)), this, SLOT(setCurrentSession(QListWidgetItem *)));
QObject::connect(SVLASListWidget, SIGNAL(itemDoubleClicked(QListWidgetItem *)), this, SLOT(setCurrentSession(QListWidgetItem *)));
QObject::connect(SVLCListWidget, SIGNAL(currentTextChanged(QString)), this, SLOT(setCurrentStudent()));
QObject::connect(SVLCListWidget, SIGNAL(itemClicked(QListWidgetItem *)), this, SLOT(showSelectedStudentTab()));
QObject::connect(actionDelete_log, SIGNAL(triggered()), this, SLOT(deleteLog()));
QObject::connect(actionArchive_session, SIGNAL(triggered()), this, SLOT(archiveSession()));
QObject::connect(actionRestore_session, SIGNAL(triggered()), this, SLOT(restoreSession()));
QObject::connect(actionCopy_to_archive, SIGNAL(triggered()), this, SLOT(copyToArchive()));
QObject::connect(actionCopy_from_archive, SIGNAL(triggered()), this, SLOT(copyFromArchive()));
QObject::connect(actionPrint_all, SIGNAL(triggered()), this, SLOT(printAll()));
QObject::connect(actionPrint_session_summary, SIGNAL(triggered()), this, SLOT(printSessionSummary()));
QObject::connect(SVLSSearchLineEdit, SIGNAL(textChanged(const QString &)), this, SLOT(searchSVLS(const QString &)));
QObject::connect(SVSearchDetailsLineEdit, SIGNAL(textChanged(QLineEdit *, const QString &)), SVPassMarkTableWidget, SLOT(filterItems(QLineEdit *, const QString &)));
SVLSListWidget->setSortingEnabled(true);
SVLASListWidget->setSortingEnabled(true);
SVPassMarkTableWidget->horizontalHeader()->setResizeMode(0, QHeaderView::Stretch);
SVPassMarkTableWidget->horizontalHeader()->setResizeMode(1, QHeaderView::ResizeToContents);
SVPassMarkTableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);
SVScoringSystemTableWidget->horizontalHeader()->setResizeMode(QHeaderView::ResizeToContents);
SVScoringSystemTableWidget->verticalHeader()->setResizeMode(QHeaderView::ResizeToContents);
SVScoringSystemTableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);
for (int i = 0; i < SVScoringSystemTableWidget->rowCount(); ++i) {
SVScoringSystemTableWidget->setItem(i, 1, new QTableWidgetItem);
}
hideArchive();
}
main() {
// query the user for the size of the matrix
initializeSize(&N, "row");
initializeSize(&M, "column");
// query the user for the
changeMaxDegree(&maxDegree, &maxEntry);
// declare all of our matrices/vectors
float A[N][M][maxDegree+1]; // main matrix to diagonalize
float Acopy[N][M][maxDegree+1]; // copy of main matrix to check computation at the end
float P[N][N][maxDegree+1]; // P matrix for row operations
float Pinv[N][N][maxDegree+1]; // the inverse of P
float Q[M][M][maxDegree+1]; // Q matrix for column operations
float Qinv[M][M][maxDegree+1]; // the inverse of Q
float PAtest[N][M][maxDegree+1]; // temporary matrix used to compute diagTest (below)
float diagTest[M][N][maxDegree+1]; // computes (P*Acopy)*Q, to see if diagonalization is correct
float PPinvTest[N][N][maxDegree+1]; // P*Pinv; should be identity
float QQinvTest[M][M][maxDegree+1]; // Q*Qinv; should be identity
//initializes all matrices/vectors
init(A, Acopy, P, Pinv, Q, Qinv, PAtest, diagTest, PPinvTest, QQinvTest);
// prints the matrix A before we diagonalize it
printf("\nA: ");
print2ArrayM(A, N);
// transforms A --> diagonal by operating on P and Q
leastEntryAlgo(A, P, Pinv, Q, Qinv);
// prints the results of leastEntryAlgo
printAll(A, Acopy, P, Pinv, Q, Qinv, PAtest, diagTest, PPinvTest, QQinvTest);
}
static int __init start(void)
{
printCurrent();
printAll();
printAllGrouped();
return 0;
}
int main(int argc, char** argv) {
FILE* in;
noteList notes;
key pieceKey;
timeSig pieceTime;
int i;
if(argc == 1){
printf("\nNot enough arguments!\nUsage ./AnalyzeMidi title.midi\n");
printf("(Second argument must be path from local directory)\n\n");
exit(1);
}
// Read Midi File
initializeFile(argv, &in);
readMidi(in, &pieceKey, &pieceTime, ¬es);
// Sort notes by start time (quicksort: requires first and last index)
quickSortNotes(¬es, 0, notes.length-1);
// For testing: print out all notes to .txt file
printAll(notes, pieceKey, pieceTime, argv[1]);
free(notes.notes);
return 0;
}
void printAll(unsigned i, unsigned j, unsigned k)
{ /* Извежда ВСИЧКИ възможни множества от предмети, за които */
/* се постига максимална стойност на целевата функция */
if (0 == j) {
printf("\nВземете следните предмети: ");
for (i = 0; i < k; i++)
printf("%u ",set[i]);
}
else {
if (F[i][j] == F[i-1][j])
printAll(i-1,j,k);
if (j >= m[i] && F[i][j] == F[i-1][j-m[i]] + c[i]) {
set[k] = i;
printAll(i-1,j-m[i],k+1);
}
}
}
void nextInteration() {
printAll();
int i;
for (i = 1; i <= NODES; ++i)
{
nextInterationNode(i);
}
}
int main(int argc, char* argv[])
{
setlocale(0, "rus");
Node* list = 0;
cout << "1. Показать список" << endl;
cout << "2. Показать список в обратном порядке" << endl;
cout << "3. Добавить элемент в начало списка" << endl;
cout << "4. Добавить 5 случайных записей" << endl;
cout << "5. Найти все записи по номеру зачетки" << endl;
cout << "6. Сортировать по группе" << endl;
cout << "7. Добавить элемент перед узлом, номер книжки которого меньше номера нового" << endl;
cout << "8. Удалить все сведения о студентах заданной группы" << endl;
cout << "0. Выход" << endl << endl;
while (true)
{
cout << "Нажмите нужную клавишу";
char c = _getch();
cout << "\r\t\t\t\t\t\t\r";
switch (c)
{
case '1':
printAll(list);
break;
case '2':
printAllReverse(list);
break;
case '3':
insert(list, Node::read());
printAll(list);
break;
case '4':
addRandom(list);
printAll(list);
break;
case '5':
printAll(find(list, read("номер зачетки")));
break;
case '6':
sort(list);
printAll(list);
break;
case '7':
insertSpacel(list, Node::read());
printAll(list);
break;
case '8':
removeByGroup(list, read("номер группы"));
printAll(list);
break;
case '0':
return 0;
}
}
return 0;
}
void printAll(struct linked * head){
if ( head != NULL ){
printf("%d ",head->data);
printAll(head->next);
}
else{
printf("\n");
}
}
int main(int argc, char** argv) {
int list[SIZE], last, choice = 7, element, position;
flush(list, &last);
while(choice){
printf("Choose an option:\n"
"0. Exit\n"
"1. Insert element\n"
"2. Remove element\n"
"3. Print element\n"
"4. Print all elements\n"
"5. Find element\n"
"6. Flush elements\n"
);
scanf("%d", &choice);
switch(choice){
case 0: break;
case 1:
printf("Input element to be added to the list:");
scanf("%d",&element);
printf("Input position where the element needs to be added:");
scanf("%d",&position);
insert(list,element, position, &last);
break;
case 2:
printf("Input position of element that needs to be removed:");
scanf("%d",&position);
rm(list,position,&last);
break;
case 3:
printf("Input position of element that needs to be printed:");
scanf("%d",&position);
print(list,position,last);
break;
case 4:
printAll(list,last);
break;
case 5:
printf("Input element that needs to be found:");
scanf("%d",&element);
position = find(list, element, last);
if(position == -1) printf("Element is not found!\n");
else{
print(list, position, last);
}
break;
case 6:
flush(list,&last);
break;
default:
choice = 7;
break;
}
}
return (EXIT_SUCCESS);
}
VOID CheckPriority()
{
UINT32 length = sizeof(pri_val)/sizeof(pri_val[0]);
if (pri_count != length)
{
fprintf(stderr,"Bad count expected %d, got %d\n", length, pri_count);
printAll(length);
exit(1);
}
if (memcmp(pri_val, pri, sizeof(pri_val)) != 0)
{
fprintf(stderr,"Bad pri\n");
printAll(length);
exit(1);
}
pri_count = 0;
}
int main(void) {
printf("%s%u","\nБрой предмети: ",N);
printf("%s%u","\nМаксимална допустима обща маса: ",M);
calculate();
printf("\nТаблица F[i][j]: ");
printTable();
printf("\n%s%u","Максимална постигната стойност: ",F[N][M]);
printf("\nСледват всевъзможните множества от решения:");
printAll(N,M,0);
return 0;
}
// dump all known runtime config options to the file with their default values.
// to trigger this, make a config file of zero size.
void SkRTConfRegistry::possiblyDumpFile() const {
const char *path = configFileLocation();
SkFILE *fp = sk_fopen(path, kRead_SkFILE_Flag);
if (!fp) {
return;
}
size_t configFileSize = sk_fgetsize(fp);
if (configFileSize == 0) {
printAll(path);
}
sk_fclose(fp);
}
//exeute history command
void execHistory(char str[])
{
char *token;
token=strtok(str," ");
token=strtok(NULL," ");
if(token==NULL)
{
printAll();
}
else
printCount(atoi(token));
}
int main()
{
nodeT *root=createStaticBinTree();
nodeL *head=createListFromTree(root);
printf("The list from the tree:\n");
printAll(head);
printf("The tree from the list:\n");
root=createTreeFromList();
//inorder(root);
prettyPrint(root,0);
return 0;
}
int main( int argc, char *argv[])
{
(void) argc;
(void) argv;
Table_T fpTable = Table_new( initTableSize, NULL, NULL );
readAll( fpTable );
printAll( fpTable);
Table_free(&fpTable);
return 0;
}
int main(){
struct linked * head = NULL ;
int i = 90;
head = insertFront(head,i*3);
insertBack(head,90);
insertBack(head,91);
insertBack(head,92);
insertBack(head,93);
head = addSorted(head,23);
printAll(head);
printIter(head);
return 0 ;
}
int main()
{
NODE head;
head = (NODE)malloc(sizeof(Node));
head->next = NULL;
add(head);
sort(head);
printAll(head);
return 0;
}
//call with printAll(allVecs, 0, "");
void printAll(const vector<vector<TString> > &allVecs, size_t vecIndex, TString strSoFar)
{
if (vecIndex >= allVecs.size())
{
cout << strSoFar << endl;
return;
}
for (size_t i=0; i<allVecs[vecIndex].size(); i++)
printAll(allVecs, vecIndex+1, strSoFar+allVecs[vecIndex][i]);
}
void Project::setModified(bool flag, bool files)
{
if (!projectRoot.isEmpty()) {
if (_isModified != flag) {
emit modificationChanged(flag);
_isModified = flag;
if (files) {
_filesModified = _isModified;
}
if (!_isModified) {
currentDataFileIndex(currentDataFileIndex(),true);
currentDataFile2Index(currentDataFile2Index(),true);
haveZincArgs(haveZincArgs(),true);
zincArgs(zincArgs(),true);
n_solutions(n_solutions(),true);
printAll(printAll(),true);
printStats(printStats(),true);
haveSolverFlags(haveSolverFlags(),true);
solverFlags(solverFlags(),true);
solverVerbose(solverVerbose(),true);
}
}
}
}
int main() {
int i, j;
scanf("%d %d", &n, &m);
while(n != 0 && m != 0){
makeList();
dfs();
printAll();
scanf("%d %d", &n, &m);
}
return 0;
}
int main() {
scanf("%d %d %d %d", &n, &m, &s, &p);
while(n != 0){
teste++;
makeList();
bfs();
printAll();
scanf("%d %d %d %d", &n, &m, &s, &p);
}
return 0;
}
