Submission #31307

#TimeUsernameProblemLanguageResultExecution timeMemory
31307imaxbluePipes (BOI13_pipes)C++14
0 / 100
93 ms3972 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define mp make_pair #define pb push_back #define x first #define y second #define pii pair<int, int> #define p3i pair<pii, int> #define pll pair<ll, ll> #define p3l pair<pll, ll> #define lseg L, (L+R)/2, N*2+1 #define rseg (L+R)/2+1, R, N*2+2 #define ub upper_bound #define lb lower_bound #define pq priority_queue #define MN 1000000007 #define fox(zqfmgb, x) for (int zqfmgb=0; zqfmgb<x; ++zqfmgb) #define fox1(zqfmgb, x) for (int zqfmgb=1; zqfmgb<=x; ++zqfmgb) #define foxr(zqfmgb, x) for (int zqfmgb=x-1; zqfmgb>=0; --zqfmgb) #define fox1r(zqfmgb, x) for (int zqfmgb=x; zqfmgb>0; --zqfmgb) #define ms multiset #define flood(x) memset(x, 0x3f3f3f3f, sizeof x) #define drain(x) memset(x, 0, sizeof x) int n, m, f[500005]; int main(){ cin >> n >> m; for (int l=0; l<m; ++l){ f[l]*=2; cout << f[l] << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...