Niestety, nie byliśmy w stanie w pełni poprawnie wyświetlić tego pliku, ponieważ nie jest zakodowany w UTF-8.
Możesz pobrać ten plik i spróbować otworzyć go samodzielnie.
#include <stdio.h> #include <time.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <map> #include <string> #include <vector> #include <iostream> #include <sstream> #include <queue> #include <algorithm> #include <assert.h> using namespace std; #define ll long long #define PB push_back #define FOR(a,start,end) for(int a=int(start); a<int(end); a++) #define INF INT_MAX #define SORT(a) sort(a.begin(),a.end()) #define CL(a,x) memset(a,x,sizeof(a)) #define REP(a,x) for(int a=0;a<x;a++) #define REP1(a,x) for(int a=1;a<=x;a++) #define MP make_pair typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<string> vs; typedef vector<pii> vii; typedef vector<vector<int> > vvi; typedef vector<vector<string> > vvs; typedef vector<pair<string, string> > vss; typedef pair<string, string> pss; typedef pair<int, pii> ppii; typedef vector<ppii> vppii; typedef vector<vector<pii> > vvii; typedef vector<vvi> vvvi; ll z; int n, k, a, b, c, i, j, q, d, s; vi vk, va, vb, vk1, vk2; string w, w0; vs vw; char zn; /* #define LOCAL #ifdef LOCAL #include <time.h> #else #include <sys/time.h> #endif double getTime() { #ifdef LOCAL return ((double)clock() / CLOCKS_PER_SEC); //CPU time on Windows #else timeval t; gettimeofday(&t, NULL); return t.tv_sec + t.tv_usec * 1e-6; //wall clock time on Linux #endif } */ string dod1(string w) { int i = w.size() - 1; while (w[i] == '9') { w[i++] = '0'; } w[i] += 1; return w; } double cz1, cz2; int main() { // freopen( "c:\\wojtek\\uva\\pa\\debug\\ban10.in", "rt", stdin); //pi=2*acos(0.0); //while(1){ //cz1 = getTime(); cin >> n; z = 0; //vk.clear(); vw.clear(); for (int i = 0; i < n; i++) { cin >> w; vw.push_back(w); } k = vw[0].size(); //d�ugo�c liczby w = vw[0]; for (int i = 1; i < n; i++) { c = vw[i].size(); if (c > k) { w = vw[i]; k = c; continue; } if (c < k) { q = vw[i].compare(w.substr(0, c)); if (q < 0) { z += k - c + 1; w0.assign(k - c + 1, '0'); w = vw[i] + w0; //w = vw[i].append(k - c + 1, '0'); k++; } else if (q == 0) { w0.assign(k - c, '9'); if (w.substr(c, k - c).compare(w0) == 0) { w0.assign(k - c + 1, '0'); w = vw[i] + w0; //w = vw[i].append(k - c + 1, '0'); z += k - c + 1; k++; } else { w = vw[i] + dod1(w.substr(c, k - c)); z += k - c; } } else { w0.assign(k - c, '0'); w = vw[i] + w0; z += k - c; } } else if (c == k) { q = vw[i].compare(w); if (q <= 0) { w = vw[i] + '0'; z++; k++; } /* else if (q == 0) { w = vw[i] + '0'; z++; k++; } */ else { w = vw[i]; } } } cout << z << endl; //cz2 = getTime(); //cerr << cz2 - cz1 << endl; //} return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 | #include <stdio.h> #include <time.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <map> #include <string> #include <vector> #include <iostream> #include <sstream> #include <queue> #include <algorithm> #include <assert.h> using namespace std; #define ll long long #define PB push_back #define FOR(a,start,end) for(int a=int(start); a<int(end); a++) #define INF INT_MAX #define SORT(a) sort(a.begin(),a.end()) #define CL(a,x) memset(a,x,sizeof(a)) #define REP(a,x) for(int a=0;a<x;a++) #define REP1(a,x) for(int a=1;a<=x;a++) #define MP make_pair typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<string> vs; typedef vector<pii> vii; typedef vector<vector<int> > vvi; typedef vector<vector<string> > vvs; typedef vector<pair<string, string> > vss; typedef pair<string, string> pss; typedef pair<int, pii> ppii; typedef vector<ppii> vppii; typedef vector<vector<pii> > vvii; typedef vector<vvi> vvvi; ll z; int n, k, a, b, c, i, j, q, d, s; vi vk, va, vb, vk1, vk2; string w, w0; vs vw; char zn; /* #define LOCAL #ifdef LOCAL #include <time.h> #else #include <sys/time.h> #endif double getTime() { #ifdef LOCAL return ((double)clock() / CLOCKS_PER_SEC); //CPU time on Windows #else timeval t; gettimeofday(&t, NULL); return t.tv_sec + t.tv_usec * 1e-6; //wall clock time on Linux #endif } */ string dod1(string w) { int i = w.size() - 1; while (w[i] == '9') { w[i++] = '0'; } w[i] += 1; return w; } double cz1, cz2; int main() { // freopen( "c:\\wojtek\\uva\\pa\\debug\\ban10.in", "rt", stdin); //pi=2*acos(0.0); //while(1){ //cz1 = getTime(); cin >> n; z = 0; //vk.clear(); vw.clear(); for (int i = 0; i < n; i++) { cin >> w; vw.push_back(w); } k = vw[0].size(); //d�ugo�c liczby w = vw[0]; for (int i = 1; i < n; i++) { c = vw[i].size(); if (c > k) { w = vw[i]; k = c; continue; } if (c < k) { q = vw[i].compare(w.substr(0, c)); if (q < 0) { z += k - c + 1; w0.assign(k - c + 1, '0'); w = vw[i] + w0; //w = vw[i].append(k - c + 1, '0'); k++; } else if (q == 0) { w0.assign(k - c, '9'); if (w.substr(c, k - c).compare(w0) == 0) { w0.assign(k - c + 1, '0'); w = vw[i] + w0; //w = vw[i].append(k - c + 1, '0'); z += k - c + 1; k++; } else { w = vw[i] + dod1(w.substr(c, k - c)); z += k - c; } } else { w0.assign(k - c, '0'); w = vw[i] + w0; z += k - c; } } else if (c == k) { q = vw[i].compare(w); if (q <= 0) { w = vw[i] + '0'; z++; k++; } /* else if (q == 0) { w = vw[i] + '0'; z++; k++; } */ else { w = vw[i]; } } } cout << z << endl; //cz2 = getTime(); //cerr << cz2 - cz1 << endl; //} return 0; } |