洛谷的CF584A Olesya and Rodion没有办法提交了，这是为什么？
这是事发截图：
洛谷的CF584A Olesya and Rodion为什么提交不了
- 写回答
- 好问题 0 提建议
- 关注问题
分享- 邀请回答
-
2条回答 默认 最新
- 2022-09-02 19:18压力这一块的博客 洛谷CF584A Olesya and Rodion题解
- 2019-02-18 10:36风动护花的博客 题目地址... Olesya and Rodion time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Olesya loves numbers co...
- 2016-04-07 17:23笑着走完自己的路的博客 题目链接：Codeforces 584A Olesya and Rodion A. Olesya and Rodion time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Olesya loves numbers ...
- 2018-05-24 16:34七九河开的博客 Olesya and Rodiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOlesya loves numbers consisting of n digits, and Rodion only likes numbers that ar...
- 2021-01-17 00:24陵游gentian的博客 Codeforces 584A A.Olesya and Rodion 思路分析： 一个小思维题，当 t < 10 时，输出 n 个 t 即可 要单独考虑的是 t =10 注意一下输出 -1 的特殊情况（ n == 1 && t == 10 ) AC代码： #include <...
- 2016-04-07 13:31没有能与不能只有想与不想的博客 CodeForces - 584A Olesya and Rodion Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Olesya loves numbers ...
- 2017-05-31 15:18lose__way的博客 Olesya and Rodion time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Olesya loves numbers consisting of n digits, and
- 2021-09-15 16:46幽殇默的博客 https://codeforces.com/problemset/problem/584/A 高精度写法 #include<bits/stdc++.h> using namespace std; vector<int>ve; vector<int> mul(vector<int> A,int b) { int t=0; vector&...
- 2015-10-07 15:14qq1319479809的博客 解题报告：Разбор Codeforces Round #324 (Div. 2) A. Olesya and Rodion time limit per test 1 second memory limit per test 256 megabytes input standard input
- 2018-09-27 17:41凯凯凯哥的博客 Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them. Your task is: given the n a...
- 2016-08-21 20:28AC_Lee的博客 Olesya and Rodion Time Limit: 1 second Memory Limit: 256 megabytes Description Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are ...
- 2015-10-07 11:48StoolMonster的博客 #include #include using namespace std; int n,t; int main() { scanf("%d%d",&n,&t); if(t) { printf("%d",t); for(int i=1;i;i++) printf("0"); printf
- 2015-10-07 04:02yuhong_liu的博客 给n，t 要求写出 n位数，能被t整除 (1 ≤ n ≤ 100, 2 ≤ t ≤ 10) t的范围感人..... t是几，就输出n位几就好了。 特判。n==1&t==10时，要输出-1 #include #include ...#incl
- 2020-08-01 11:42HeZephyr的博客 原题链接：http://codeforces.com/problemset/problem/584/A 题意：给定两个数n和t，让你构造一个数满足n个位数和能整除t 解题思路：n个范围十分大，所以我们不可能是用平常的方法来找到我们想要的数的，而是直接...
- 2015-10-07 11:29ITAK的博客 Olesya and Rodion time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Olesya loves numbers consisting of n di
- 2016-04-06 22:27playboy307的博客 Olesya and Rodion Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description Olesya loves numbers consisting of n digits, and Rodion only lik
- 2019-02-02 20:37black-hole6的博客 Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them. Your task is: given the n and t print an ...
- 没有解决我的问题, 去提问
问题事件
创建了问题
8月22日