제출 #1318774

#제출 시각아이디문제언어결과실행 시간메모리
1318774heyder_7Odašiljači (COCI20_odasiljaci)C++20
0 / 70
1 ms332 KiB
#include <bits/stdc++.h> #define int long long using namespace std; #define F first #define S second #define pb push_back #define ins insert #define pf push_front #define lb lower_bound #define ub upper_bound #define yes cout << "YES" << endl #define no cout << "NO" << endl #define srt(p) sort(p.begin() , p.end()) #define rvr(p) reverse(p.begin() , p.end()) #define all(p) (p.begin() , p.end()) const int INF = 1e18; bool is_prime(int n) { if(n == 1 or n == 0) return false; if(n == 2) return true; if(n % 2 == 0) return false; for(int i = 3; i <= sqrt(n); i+=2) { if(n % i == 0) return false; } return true; } struct Edge { int u , v , w; }; void solve(){ int x , y; cin >> x >> y; y = min(x , y); cout << y << endl; for(int i = 0; i < y; i++) { cout << "A C C" << endl; } cout << "C" << endl; } signed main() { // freopen("input.txt","r",stdin); // freopen("output.txt","w",stdout); ios_base::sync_with_stdio(false); cin.tie(nullptr); int t = 1; //cin >> t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...