Update test

This commit is contained in:
Jeehoon Kang
2020-03-17 22:30:16 +09:00
parent fddd07a769
commit 1b7d25314d
32 changed files with 171 additions and 130 deletions

View File

@@ -1,3 +1,3 @@
int main() {
return _Alignof(const int);
return _Alignof(const int) == 4;
}

View File

@@ -4,3 +4,7 @@ int bar(int x, int y, int z){
if (x == y) { return y; }
else { return z; }
}
int main() {
return 1;
}

View File

@@ -2,5 +2,5 @@ int main()
{
int y = 2;
int x = (y += 2, 2, y + 3);
return x;
return x == 7;
}

View File

@@ -2,5 +2,5 @@ int main()
{
int y = 1;
int x = 0;
return (x == y) ? 2 : 5;
return ((x == y) ? 2 : 5) == 5;
}

View File

@@ -5,3 +5,7 @@ int (fibonacci)(int n) {
return fibonacci(n - 2) + fibonacci(n - 1);
}
int main() {
return fibonacci(9) == 34;
}

View File

@@ -16,5 +16,5 @@ int fibonacci(int n) {
}
int main() {
return fibonacci(9);
return fibonacci(9) == 34;
}

View File

@@ -18,5 +18,5 @@ int fibonacci(int n) {
}
int main() {
return fibonacci(9);
return fibonacci(9) == 34;
}

View File

@@ -18,5 +18,5 @@ int fibonacci(int n) {
}
int main() {
return fibonacci(9);
return fibonacci(9) == 34;
}

View File

@@ -7,5 +7,5 @@ int fibonacci(int n) {
}
int main() {
return fibonacci(9);
return fibonacci(9) == 34;
}

View File

@@ -4,5 +4,5 @@ int foo(int x, int y, int z){
}
int main() {
return foo(0, 1, -1);
return foo(0, 1, -1) == -1;
}

View File

@@ -5,5 +5,5 @@ int main() {
int k = 0;
}
return 0;
return 1;
}

View File

@@ -5,7 +5,7 @@ int foo(int, int k);
int main() {
int i = g;
return foo(i, i);
return foo(i, i) == 30;
}
int foo(int i, int j) {

View File

@@ -11,5 +11,5 @@ int (* (* foo3())())(int, int, int){
}
int main() {
return foo3()()(2, 2, 2);
return foo3()()(2, 2, 2) == 6;
}

View File

@@ -0,0 +1,19 @@
int foo() {
int sum = 0;
for(int i = 0; ;) {
if(i == 5) break;
if(i == 3) {
i++;
continue;
}
sum += i;
i++;
}
return sum;
}
int main() {
return foo() == 7;
}

View File

@@ -4,5 +4,5 @@ int foo(int x, int y, int z){
}
int main() {
return foo(0, 1, -1);
return foo(0, 1, -1) == 1;
}

View File

@@ -11,5 +11,5 @@ int main(){
*&*foo(*p2) += 1;
*foo(p3) += 1;
return a;
return a == 3;
}

View File

@@ -3,5 +3,5 @@ void foo() {
int main() {
foo();
return 0;
return 1;
}

View File

@@ -1,4 +1,5 @@
int main()
{
int x = 1;
return 1;
}

View File

@@ -5,5 +5,5 @@ int main()
for (i = 0; i < 11; ++i) {
sum += i;
}
return sum;
return sum == 55;
}

View File

@@ -5,3 +5,7 @@ int (fibonacci)(int n) {
return fibonacci(n - 2) + fibonacci(n - 1);
}
int main() {
return 1;
}

View File

@@ -1,3 +1,3 @@
int main() {
return sizeof(const int);
return sizeof(const int) == 4;
}

View File

@@ -16,5 +16,5 @@ int main() {
}
}
return b;
return b == 2;
}

View File

@@ -3,3 +3,7 @@ int fibonacci(int n) {
return n;
}
}
int main() {
return 1;
}

View File

@@ -0,0 +1,21 @@
int foo() {
int sum = 0;
int i = 0;
while(i < 10) {
if(i == 3) {
i++;
continue;
}
sum += i;
i++;
if(i == 5) break;
}
return sum;
}
int main() {
return foo() == 7;
}