QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #779601 | #9794. ICPC Shenyang in NEU, the Tenth Consecutive Year | Lord-scheme | AC ✓ | 7ms | 1624kb | C11 | 507b | 2024-11-24 20:14:31 | 2024-11-24 20:14:31 |
Judging History
answer
#include <stdio.h>
int main() {
int T;
scanf("%d", &T);
while (T--) {
int cur = 1923;
while (1) {
printf("? %d\n", cur);
fflush(stdout);
int ans;
scanf("%d", &ans);
if (ans != 0) {
break;
}
cur += 1;
if (cur == 2023) {
break;
}
}
printf("! %d\n", cur);
fflush(stdout);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 1608kb
input:
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
output:
? 1923 ? 1924 ? 1925 ? 1926 ? 1927 ? 1928 ? 1929 ? 1930 ? 1931 ? 1932 ? 1933 ? 1934 ? 1935 ? 1936 ? 1937 ? 1938 ? 1939 ? 1940 ? 1941 ? 1942 ? 1943 ? 1944 ? 1945 ? 1946 ? 1947 ? 1948 ? 1949 ? 1950 ? 1951 ? 1952 ? 1953 ? 1954 ? 1955 ? 1956 ? 1957 ? 1958 ? 1959 ? 1960 ? 1961 ? 1962 ? 1963 ? 1964 ? 1965...
result:
ok correct! (1 test case)
Test #2:
score: 0
Accepted
time: 7ms
memory: 1624kb
input:
100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
? 1923 ? 1924 ? 1925 ? 1926 ? 1927 ? 1928 ? 1929 ? 1930 ? 1931 ? 1932 ? 1933 ? 1934 ? 1935 ? 1936 ? 1937 ? 1938 ? 1939 ? 1940 ? 1941 ? 1942 ? 1943 ? 1944 ! 1944 ? 1923 ? 1924 ? 1925 ? 1926 ? 1927 ? 1928 ? 1929 ? 1930 ? 1931 ? 1932 ? 1933 ? 1934 ? 1935 ? 1936 ? 1937 ? 1938 ? 1939 ? 1940 ? 1941 ? 1942...
result:
ok correct! (100 test cases)
Extra Test:
score: 0
Extra Test Passed