# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838029 | dugersuren | scanf 함수 2 (BSC_0_4) | C++14 | 0 ms | 300 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>
#define ll long long
using namespace std;
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll x;//sm=0,n,a[1001],mx;
cin>>x;
// for(int i=0;i<3;i++)cin>>a[i],sm+=a[i];
// mx=sm;
// for(int i=3;i<n;i++){
// cin>>a[i];
// sm+=a[i];
// if(a[i]+a[i-1]+a[i-2]>mx)mx=a[i]+a[i-1]+a[i-2];
// }
printf("%03lld",x);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |