Submission #1115475
Source Code Expand
#include<cstdio> #include<cstring> using namespace std; typedef long long ll; int main() { ll n,m; while(~scanf("%lld%lld",&n,&m)) { ll ans=0; if(2*n<=m) { ans=n; m-=2*n; ans+=m/4; } else { ans=m/2; } printf("%lld\n",ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | coderLFR |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 293 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 128 KB |
00_example_02.txt | AC | 1 ms | 128 KB |
01.txt | AC | 1 ms | 128 KB |
02.txt | AC | 1 ms | 128 KB |
03.txt | AC | 1 ms | 128 KB |
04.txt | AC | 1 ms | 128 KB |
05.txt | AC | 1 ms | 128 KB |
06.txt | AC | 1 ms | 128 KB |
07.txt | AC | 1 ms | 128 KB |