Submission #528449

#TimeUsernameProblemLanguageResultExecution timeMemory
528449SlavitaHiperkocka (COCI21_hiperkocka)C++14
0 / 110
1 ms316 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define ve vector<int> #define pb push_back #define mp make_pair #define fi first #define se second #define pi pair<int,int> #define all(v) v.begin(),v.end() #define si(v) (int)v.size() #define en '\n' #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update> //#define int long long using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef unsigned long long ull; const int N = 1e4 + 228; const int big = 1e9; const int md = 1e9 + 7; //ordered_set os; // os.order_of_key(4), (*os.find_by_order(5)) int n, m, q, ans, rad[N], l; ll dp[100][N]; //#undef int int main(){ //#define int long long iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0); //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); cin >> n; int x, y; cin >> x >> y; cout << 1 << en; cout << x << ' ' << y; return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...