Submission #2555797
Source Code Expand
#include <numeric> #include<iostream> #include<set> #include<queue> #include<vector> #include<map> #include<stack> #include <cstdio> #include<algorithm> #include <sstream> #include<string> #include<string.h> #include <cmath> #include <iomanip> #include <string> #include<list> using namespace std; #define int long long #define inf 1000000007 #define rep(i,j,n) for(int i=j;i<n;i++) typedef pair<int,int> P; double pi = 3.141592653589793; struct edge{int to,cost;}; //使うやつはここから下に置こうな signed main() { int a,k;cin>>a>>k; int t=2; rep(i,0,12)t*=10; if(k==0){ cout<<t-a<<endl; return 0; } else { int cnt=0; while(a<t){ cnt++; a=a+1+k*a; } cout<<cnt<<endl; return 0; } }
Submission Info
Submission Time | |
---|---|
Task | A - 2兆円 |
User | birdway |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 849 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |