Submission #1813313
Source Code Expand
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
struct edge {
int to,cost;
edge(int t,ll c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};
//-----------------------------------------------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
ll sum=0;
REP(i,n) sum+=(i+1)*10000;
printf("%lld\n",sum/n);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - AtCoder社の給料 |
User |
moko_freedom |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
858 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_01.txt, 00_sample_02.txt, test_100.txt, test_14.txt, test_29.txt, test_4.txt, test_42.txt, test_48.txt, test_54.txt, test_59.txt, test_71.txt, test_72.txt, test_84.txt, test_96.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
1 ms |
256 KB |
00_sample_02.txt |
AC |
1 ms |
256 KB |
test_100.txt |
AC |
1 ms |
256 KB |
test_14.txt |
AC |
1 ms |
256 KB |
test_29.txt |
AC |
1 ms |
256 KB |
test_4.txt |
AC |
1 ms |
256 KB |
test_42.txt |
AC |
1 ms |
256 KB |
test_48.txt |
AC |
1 ms |
256 KB |
test_54.txt |
AC |
1 ms |
256 KB |
test_59.txt |
AC |
1 ms |
256 KB |
test_71.txt |
AC |
1 ms |
256 KB |
test_72.txt |
AC |
1 ms |
256 KB |
test_84.txt |
AC |
1 ms |
256 KB |
test_96.txt |
AC |
1 ms |
256 KB |