Submission #1550745
Source Code Expand
#include "iostream" #include "climits" #include "list" #include "queue" #include "stack" #include "set" #include "functional" #include "algorithm" #include "string" #include "map" #include "iomanip" #include "random" using namespace std; const long long int MOD = 1000000007; const long double EPS = 0.00000001; long long int N, M, K, L, R, H, W; class Add_Segment_Tree { vector<long long int>v; vector<int>l; vector<int>r; long long int ret; int num; long long int Update(int place) { if (place >= v.size() / 2) { return v[place]; } v[place] = Update(place * 2) + Update(place * 2 + 1); return v[place]; } void Sum(int a, int b, int place) { if (l[place] >= a&&r[place] <= b) { ret += v[place]; return; } if (l[place] > b || r[place] < a) return; Sum(a, b, place * 2); Sum(a, b, place * 2 + 1); return; } public: void Left(int place) { if (place >= v.size() / 2) { l[place] = place - v.size() / 2; return; } Left(place * 2); Left(place * 2 + 1); l[place] = l[place * 2]; return; } void Right(int place) { if (place >= v.size() / 2) { r[place] = place - v.size() / 2; return; } Right(place * 2); Right(place * 2 + 1); r[place] = r[place * 2 + 1]; return; } Add_Segment_Tree(int N) { num = 1; while (num < N * 2)num *= 2; l.resize(num); r.resize(num); v.resize(num, 0); Left(1); Right(1); } void Add(int place, long long int num, bool update) { place += v.size() / 2; v[place] += num; if (!update)return; place /= 2; while (place) { v[place] = v[place * 2] + v[place * 2 + 1]; place /= 2; } } void TopDown() { Update(1); } long long int Sum(int a, int b) { ret = 0; Sum(a, b, 1); return ret; } }; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> N >> M >> K; for (int i = 1; i <= 127; i++) { if (i % 3 == N&&i % 5 == M&&i % 7 == K) { cout << i << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 孫子算経 |
User | olphe |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2032 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1, 00_sample2, 00_sample3, 10_input00, 10_input01, 10_input02, 10_input03, 10_input04, 10_input05, 10_input06, 10_input07, 10_input08, 10_input09, 10_input10, 10_input11, 10_input12, 10_input13, 10_input14, 10_input15, 10_input16, 10_input17, 10_input18, 10_input19, 10_input20, 10_input21, 10_input22, 10_input23, 10_input24, 10_input25, 10_input26, 10_input27, 10_input28, 10_input29, 10_input30, 10_input31, 10_input32, 10_input33, 10_input34, 10_input35, 10_input36, 10_input37, 10_input38, 10_input39, 10_input40, 10_input41, 10_input42, 10_input43, 10_input44, 10_input45, 10_input46, 10_input47, 10_input48, 10_input49, 10_input50, 10_input51, 10_input52, 10_input53, 10_input54, 10_input55, 10_input56, 10_input57, 10_input58, 10_input59 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1 | AC | 1 ms | 256 KB |
00_sample2 | AC | 1 ms | 256 KB |
00_sample3 | AC | 1 ms | 256 KB |
10_input00 | AC | 1 ms | 256 KB |
10_input01 | AC | 1 ms | 256 KB |
10_input02 | AC | 1 ms | 256 KB |
10_input03 | AC | 1 ms | 256 KB |
10_input04 | AC | 1 ms | 256 KB |
10_input05 | AC | 1 ms | 256 KB |
10_input06 | AC | 1 ms | 256 KB |
10_input07 | AC | 1 ms | 256 KB |
10_input08 | AC | 1 ms | 256 KB |
10_input09 | AC | 1 ms | 256 KB |
10_input10 | AC | 1 ms | 256 KB |
10_input11 | AC | 1 ms | 256 KB |
10_input12 | AC | 1 ms | 256 KB |
10_input13 | AC | 1 ms | 256 KB |
10_input14 | AC | 1 ms | 256 KB |
10_input15 | AC | 1 ms | 256 KB |
10_input16 | AC | 1 ms | 256 KB |
10_input17 | AC | 1 ms | 256 KB |
10_input18 | AC | 1 ms | 256 KB |
10_input19 | AC | 1 ms | 256 KB |
10_input20 | AC | 1 ms | 256 KB |
10_input21 | AC | 1 ms | 256 KB |
10_input22 | AC | 1 ms | 256 KB |
10_input23 | AC | 1 ms | 256 KB |
10_input24 | AC | 1 ms | 256 KB |
10_input25 | AC | 1 ms | 256 KB |
10_input26 | AC | 1 ms | 256 KB |
10_input27 | AC | 1 ms | 256 KB |
10_input28 | AC | 1 ms | 256 KB |
10_input29 | AC | 1 ms | 256 KB |
10_input30 | AC | 1 ms | 256 KB |
10_input31 | AC | 1 ms | 256 KB |
10_input32 | AC | 1 ms | 256 KB |
10_input33 | AC | 1 ms | 256 KB |
10_input34 | AC | 1 ms | 256 KB |
10_input35 | AC | 1 ms | 256 KB |
10_input36 | AC | 1 ms | 256 KB |
10_input37 | AC | 1 ms | 256 KB |
10_input38 | AC | 1 ms | 256 KB |
10_input39 | AC | 1 ms | 256 KB |
10_input40 | AC | 1 ms | 256 KB |
10_input41 | AC | 1 ms | 256 KB |
10_input42 | AC | 1 ms | 256 KB |
10_input43 | AC | 1 ms | 256 KB |
10_input44 | AC | 1 ms | 256 KB |
10_input45 | AC | 1 ms | 256 KB |
10_input46 | AC | 1 ms | 256 KB |
10_input47 | AC | 1 ms | 256 KB |
10_input48 | AC | 1 ms | 256 KB |
10_input49 | AC | 1 ms | 256 KB |
10_input50 | AC | 1 ms | 256 KB |
10_input51 | AC | 1 ms | 256 KB |
10_input52 | AC | 1 ms | 256 KB |
10_input53 | AC | 1 ms | 256 KB |
10_input54 | AC | 1 ms | 256 KB |
10_input55 | AC | 1 ms | 256 KB |
10_input56 | AC | 1 ms | 256 KB |
10_input57 | AC | 1 ms | 256 KB |
10_input58 | AC | 1 ms | 256 KB |
10_input59 | AC | 1 ms | 256 KB |