小树学信奥

T1 #include <cstdio> #define LL long long LL pow10(LL m) { return m == 0 ? 1 : 10 * pow10(m - 1); } int main() { LL aa, b; scanf("%lld%lld", &aa, &b); LL len = 0; LL tmp = aa; while(tmp) { len++;

题目 http://oj.csen.org.cn/contest/10?view=problems T1 #include <bits/stdc++.h> using namespace std; int main() { int n, L, A, B, temp, V; cin >> n >> L >> A >> B; for(int i = 0; i < n; i++) { int t

T1 #include <iostream> using namespace std; int main() { int t; cin >> t; while(t--) { int n, m; cin >> n >> m; int a[m + 1]; for(int i = 1; i <= m; i++) { cin

T1 #include <iostream> using namespace std; const int N = 100005; bool a[N]; int main() { int n, m; cin >> n >> m; for(int i = 1; i <= n; i++) { a[i] = 1; } int t; for(int i = 1; i <= m; i++)