Submission #1982041
Source Code Expand
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> int descending_compare(const void *a, const void *b){ if (*(int*)a > *(int*)b){ return -1; }else if (*(int*)a == *(int*)b){ return 0; }else{ return 1; } } int ascending_compare(const void *a, const void *b){ if (*(int*)a < *(int*)b){ return -1; }else if (*(int*)a == *(int*)b){ return 0; }else{ return 1; } } int lower_bound(int *a, int n, int key){ int left, mid, right; left = 0, right = n; mid = (left + right)/2; while ((left+1 != mid || mid+1 != right) && mid != left){ if (key > a[mid]){ left = mid; }else{ right = mid+1; } mid = (left + right)/2; } if (a[left] >= key)return left; if (a[mid] >= key)return mid; if (a[right] >= key)return right; return n; } //greatest common divisor unsigned long gcd(unsigned long x, unsigned long y){ if (y == 0){ return x; }else if (x > y){ return gcd(y, x % y); }else{ return gcd(x, y % x); } } long long factorial(int x){ long long rtn = 1; int i; for (i = x; i > 1; i--){ rtn = (rtn*i); } return rtn; } int main(void){ int a, b; scanf("%d %d", &a, &b); printf("%d\n", (a+b)%24); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Remaining Time |
User | Morifo |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 1455 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:69:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &a, &b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
subtask_1_1.txt | AC | 1 ms | 128 KB |
subtask_1_2.txt | AC | 1 ms | 128 KB |
subtask_1_3.txt | AC | 1 ms | 128 KB |
subtask_1_4.txt | AC | 1 ms | 128 KB |
subtask_1_5.txt | AC | 1 ms | 128 KB |
subtask_1_6.txt | AC | 1 ms | 128 KB |
subtask_1_7.txt | AC | 1 ms | 128 KB |