| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 570386 | urd05 | Remittance (JOI19_remittance) | C++17 | 0 ms | 212 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
 
int n;
long long c[1000001];
long long arr[1000001]; //비트 저장
long long value[1000001];
long long money[1000001];
bool vis[1000001];
 
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        int a,b;
        scanf("%d %d",&a,&b);
        money[i]=a;
        c[i]=b-a;
    }
    long long val=0;
    for(int i=0;i<n;i++) {
        val+=(c[i+1]<<i);
    }
    if (val%((1<<n)-1)!=0) {
        printf("%lld",val);
    }
    long long x=-val/((1<<n)-1);
    value[n]=x;
    if (x<0) {
        printf("No");
        return 0;
    }
    for(int i=n-1;i>0;i--) {
        x=2*x+c[i+1];
        value[i]=x;
        if (x<0) {
            printf("No");
            return 0;
        }
    }
    printf("Yes");
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
