update gcc typo
This commit is contained in:
parent
f56c2977e7
commit
198d437e1a
|
@ -26,7 +26,7 @@ int main() {
|
||||||
}
|
}
|
||||||
|
|
||||||
/* 请在这里填写答案 */
|
/* 请在这里填写答案 */
|
||||||
#pragma gcc optimize("ofast,inline")
|
#pragma GCC optimize("Ofast,inline")
|
||||||
void findMin(int M[][MAX], int x[], int n, int m) {
|
void findMin(int M[][MAX], int x[], int n, int m) {
|
||||||
int min;
|
int min;
|
||||||
for (int i = 0; i < m; i++) {
|
for (int i = 0; i < m; i++) {
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#pragma gcc optimize("O2")
|
#pragma GCC optimize("O2")
|
||||||
#define MAX 100
|
#define MAX 100
|
||||||
|
|
||||||
void transpose(int matrix[][MAX], int result[][MAX], int n, int m);
|
void transpose(int matrix[][MAX], int result[][MAX], int n, int m);
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#pragma gcc optimize("Ofast,inline")
|
#pragma GCC optimize("Ofast,inline")
|
||||||
|
|
||||||
void process(float input[][3], float output[][5], int n);
|
void process(float input[][3], float output[][5], int n);
|
||||||
|
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#pragma gcc optimize("O2")
|
#pragma GCC optimize("O2")
|
||||||
#define MAX 10
|
#define MAX 10
|
||||||
|
|
||||||
int matrixAdd(int matrix[][MAX], int m, int n, int x, int y);
|
int matrixAdd(int matrix[][MAX], int m, int n, int x, int y);
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#pragma gcc optimize("Ofast, inline")
|
#pragma GCC optimize("Ofast, inline")
|
||||||
|
|
||||||
int main(void) {
|
int main(void) {
|
||||||
int n, m;
|
int n, m;
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#pragma gcc optimize("Ofast, inline")
|
#pragma GCC optimize("Ofast, inline")
|
||||||
|
|
||||||
int getSum(int *arr, int len);
|
int getSum(int *arr, int len);
|
||||||
// Use bubble sort
|
// Use bubble sort
|
||||||
|
|
Loading…
Reference in a new issue