Showing posts with label c. Show all posts
Showing posts with label c. Show all posts
Friday, December 2, 2016
Sony Xperia Z Xperia M started a new firmware update 10 3 1 A 2 67 15 1 C 1 17
Sony Xperia Z Xperia M started a new firmware update 10 3 1 A 2 67 15 1 C 1 17
As announced by Sony Mobile, Xperia Z started today received a new Firmware update (10.3.1.A.2.67). In this update Sony promises improvements to the screen, camera, computer performance.
Sony Xperia M has 15.1.C.1.17 Firmware update on Android 4.1.2, the focus changes to fix errors in the boot sequence, referring to the phenomenon of green when shooting, improved management ram.Do you check for updates through Sony PC Companion.
Source: XperiaGuide, XperiaBlog
Go to link download
Saturday, November 19, 2016
Huawei Modems Universal Flasher Latest Version V1 6 c fr3nsis Free Download
Huawei Modems Universal Flasher Latest Version V1 6 c fr3nsis Free Download
Download and install Huawei modems universal flasher software latest version v1.6 full setup installer free download for windows from here today. You can easily flash any Huawei modem using this tool. Its latest version you can download from the given link below.
Huawei modem universal flasher software direct download link is given below. Follow the link to download now.
Download Here
Go to link download
Monday, November 7, 2016
Uji Soal Teori ONLINE Untuk Membuat Sim C
Uji Soal Teori ONLINE Untuk Membuat Sim C
Sekian banyak orang di indonesia dan semakin berkembangnya jaman juga teknologi informasi komunikasi, kini semua sudah serba online (internet) se akan berkembang dan bertambahnya penduduk akan bertambah pula pemakai mobil juga sepeda motor, hal ini menyebabkan semakin banyak pula orang yang akan membuat SIM (Surat Izin Mengemudi) Entah itu SIM A, SIM B, SIM C dan yang lain..
Banyak Orang yang lancar dalam membuat SIM, Tidak sedikit Pula Orang Yang gagal sampai mengulang berkali kali, karena ujian Membuat SIM tersebut.
seakan berkembangnya teknologi kini Telah Hadir Quiz untuk latihan sebelum membuat SIM C. QUiz ini berisi prediksi soal soal yang biasanya di ujikan di ujian Teori pembuatan SIM C.
Untuk lulus dalam ujian teori sim c, skor minimal adalah 70
saya mohon bantuannya apabila menemukan soal atau jawaban dalam kuis ujian teori sim c ini yang kurang pas untuk di sampaikan di kolom komentar. bantuan share nya sangat saya apresiasi sekali. terimakasih
Anda bisa berkontribusi dengan menambahkan soal di quiz ujian teori sim c ini. Untuk Menambahkan soal klik tautan di bawah ini
Sumber : https://kelaskita.com/quizmaster/quiz/quiz-sim-c/#
"Berbagi Itu Indah"
Go to link download
Sunday, October 2, 2016
Official photos Sony Xperia C cheap 5 inch screen 300 price
Official photos Sony Xperia C cheap 5 inch screen 300 price
In the past, the new Sony Xperia C is announced for the Chinese market, many members oblivious to this model, or worse is to equate it with "phone Chinese".
Read more »Go to link download
Wednesday, August 17, 2016
C Bellman Ford Implementation
C Bellman Ford Implementation
Bellman-Ford is a Single Source Shortest Path (SSSP) detection algorithm. I implemented this one using a new kind of approach to coding (new for me). I used a nested class implementation. The whole BFord algorithm is packed with its data structure in an object. The edges are also implemented using an internal class in the object. I never did nested class before this. Looks awesome.
#include <cstdio>
#include <vector>
#define INF (1<<31 - 1)
#define NIL -1
using namespace std;
class bford {
public:
class edge {
public:
int u, v, w;
};
int nVertex;
int *d, *p;
vector<edge> elist;
bford( ) {
d = new int[0];
p = new int[0];
elist.clear();
}
bool function( int s, int nVertex ) {
d = new int[(const int)nVertex+1];
p = new int[(const int)nVertex+1];
int i, j, w, u, v;
// init_single_source( s ) {
for (i=0 ; i<=nVertex ; i++) {
d[i] = INF;
p[i] = NIL;
}
d[s] = 0;
// }
for (i=0 ; i<nVertex-1 ; i++) {
for ( j=0 ; j<elist.size() ; j++) {
// relax( elist[j].u, elist[j].v, elist[j].w ) {
u = elist[j].u;
v = elist[j].v;
w = elist[j].w;
if (d[v] > d[u]+w) {
d[v] = d[u]+w;
p[v] = u;
}
// }
}
}
for (i=0 ; i<elist.size() ; i++) {
if ( d[ elist[i].v ] > d[ elist[i].u ] + elist[i].w ) {
return false;
}
}
return true;
}
};
int main( void ) {
int i, u, v, w, nVertex, nEdge;
bford grp;
scanf("%d",&nVertex);
scanf("%d",&nEdge);
for (i=0 ; i<nEdge ; i++) {
scanf("%d %d %d",&u,&v,&w);
grp.elist.push_back(bford::edge{u,v,w});
}
printf("%s ",(grp.function( 1, nVertex )?"True":"False"));
for (i=1 ; i<=nVertex ; i++) {
printf("%d - %d ",i, grp.d[i]);
}
return 0;
}
Go to link download
Subscribe to:
Posts (Atom)